Scribd
Upload
6 views27 pages

CSE327 Lecture 13 MMA1

The document discusses planning and scheduling in software engineering, focusing on the Critical Path Method (CPM) for project management. It outlines task dependencies, durations, early and late start/finish calculations, and the identification of the critical path, which determines the project's timeline. Key elements of CPM include critical path analysis, float determination, and scheduling parameters essential for effective project control.

Uploaded by

sumaya.suimee
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
6 views27 pages

CSE327 Lecture 13 MMA1

The document discusses planning and scheduling in software engineering, focusing on the Critical Path Method (CPM) for project management. It outlines task dependencies, durations, early and late start/finish calculations, and the identification of the critical path, which determines the project's timeline. Key elements of CPM include critical path analysis, float determination, and scheduling parameters essential for effective project control.

Uploaded by

sumaya.suimee
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
You are on page 1/ 27

Software

Engineering
(CSE 327)
Lecture 13
(Planning and Scheduling)
Planning, Task
Scheduling
Task ID Dependencies Duration
A 4
B A 3 B
C 5
A
End
D C 4 Start
D E
E B, D 5 C
F C 3 F G
G E, F 2

Task
ID
ES EF
A
0 4
LS LF
Start

Task duration
EF = ES + Task Duration
Early Start of an activity = Early Finish of predecessor activity

Early Start of an activity = Greater Early Finish time from


multiple predecessor activities

ES EF ES EF
0 A 4 4 B 7 ES EF
0 4 3 9 E 14 16
LS LF LS LF 5
Start End
ES EF ES EF LS LF
0 C 5 5 D 9
ES EF
5 4 14 G 16
LS LF LS LF
2
ES EF LS LF
5 F 8
3
LS LF
LS = LF - Task Duration
Late Finish of an activity = Late Start of successor activity
Late Finish of an activity = Earlier (least) Late Start time from
multiple successor activities

ES EF ES EF
0 A 4 4 B 7 ES EF
0 2 4 6 6 3 9 9 E 14 16
LS LF LS LF 9 5 14
Start End
ES EF ES EF LS LF
0 C 5 5 D 9
ES EF
0 5 5 5 4 9
14 G 16
LS LF LS LF
14 2 16
ES EF LS LF
5 F 8
11 3 14
LS LF
Float / Slack Time = (LS – ES) or (LF - EF)
Float time of Task A: (2 - 0) or (6 - 4) = 2
Float time of Task F: (11 - 5) or (14 - 8) = 6
Float time of Task D: (5 - 5) or (9 - 9) = 0

ES EF ES EF
0 A 4 4 B 7 ES EF
0 2 4 6 6 3 9 9 E 14 16
LS LF LS LF 9 5 14
Start End
ES EF ES EF LS LF
0 C 5 5 D 9
ES EF
0 5 5 5 4 9
14 G 16
LS LF LS LF
14 2 16
ES EF LS LF
5 F 8
11 3 14
LS LF
This network diagram has three paths from start to
end. The paths and their durations are as follows:
oStart -> A -> B -> E -> G -> End {duration: 14 days}
oStart -> C -> D -> E -> G -> End {duration: 16 days}
oStart -> C -> F -> G -> End {duration: 10 days}
Critical path is the duration of the longest path.
ES EF ES EF
0 A 4 4 B 7 ES EF
0 2 4 6 6 3 9 9 E 14 16
LS LF LS LF 9 5 14
Start End
ES EF ES EF LS LF
0 C 5 5 D 9
ES EF
0 5 5 5 4 9
14 G 16
LS LF LS LF
14 2 16
ES EF LS LF
5 F 8
11 3 14 The float on the critical path is zero.
LS LF
ES EF ES EF
0 A 4 4 B 7 ES EF
0 2 4 6 6 3 9 9 E 14 16
LS LF LS LF 9 5 14
Start End
ES EF ES EF LS LF
0 C 5 5 D 9
ES EF
0 5 5 5 4 9
14 G 16
LS LF LS LF
14 2 16
ES EF LS LF
5 F 8
11 3 14
LS LF
Late Finish of an activity = Late Start of successor activity
Late Finish of an activity = Earlier (least) Late Start time
from multiple successor activities
This network diagram has three paths from start to end.
oStart -> A -> B -> E -> G -> End {duration: 14 days}
oStart -> C -> D -> E -> G -> End {duration: 16 days}
oStart -> C -> F -> End {duration: 8 days}

ES EF ES EF
0 A 4 4 B 7 ES EF
0 2 4 6 6 3 9 9 E 14 16
LS LF LS LF 9 5 14
Start End
ES EF ES EF LS LF
0 C 5 5 D 9
ES EF
0 5 5 5 4 9
14 G 16
LS LF LS LF
14 2 16
ES EF LS LF
5 F 8
13 3 16
LS LF
Critical Path Method
• The Critical Path Method or CPM is a network
analysis technique
– concerned with planning and controlling of
complex, but routine projects.
– Simply, Critical path method is generally used for
the projects whose time duration is known with
certainty and also the amount of resources
required for the completion of the project is
assumed to be known.
Critical Path Method
• Critical path schedules will...
– Help you identify the activities that must be completed on
time in order to complete the whole project on time.
– Show you which tasks can be delayed and for how long
without impacting the overall project schedule.
– Calculate the minimum amount of time it will take to
complete the project.
– Tell you the earliest and latest dates each activity can start
on in order to maintain the schedule.
Critical Path Method

• The Critical Path Method has four key


elements...
– Critical Path Analysis
– Float Determination
– Early Start & Early Finish Calculation
– Late Start & Late Finish Calculation
Critical Path Method
• For each activity the following parameters need to be
determined:
– Earliest start time (ES): How early, the successor activity
begins once the predecessor activity finishes.
– Earliest Finish Time (EF): Earliest Start Time + duration of
each activity.
– Latest Finish Time (LF): The latest time within which the
activity finishes without delaying the project.
– Latest Start Time (LS): Latest Finish Time – Activity duration
Critical Path Analysis
• The critical path is the sequence of activities
with the longest duration. A delay in any of
these activities will result in a delay for the
whole project.
• Float is the amount of time an activity can slip
before it causes your project to be delayed.
Float is sometimes referred to as slack.

You might also like