Planning and
Scheduling
ENGR. KIRCHOFF TAGAL
CPM – The Critical Path Method
was developed jointly by the DuPont and Remington Rand
Companies as a method for planning and scheduling plant
maintenance and construction projects utilizing computers.
PERT – Program Evaluation and Review Technique
Developed for planning and controlling weapons system development.
Both CPM and PERT use a network diagram to graphically represent
the major activities of a project and to show the relationships between
activities. The major difference between CPM and PERT is that PERT
utilizes probability concepts to deal with the uncertainty associated with
activity-time estimates, whereas CPM assigns each activity a single fixed
duration.
THE NETWORK DIAGRAM
Network – graphically portrays major project activities and their
relationships.
THE NETWORK DIAGRAM
▪Activity-on-arrow – utilized to illustrate network construction and time calculations.
▪Activity-on-node – the node (which represented an event in the activity-on-arrow method) is now used to represent an
activity.
▪ Activity is represented by an arrow that has an associated description and expected duration.
▪ Activities are identified by citing the event number at the tail of the arrow (I number) followed by the event number at the
head of the arrow (J number).
▪An event is simply a point in time and, as used in network diagramming, is assumed to occur instantaneously when all
activities leading into the event have been completed.
▪Event represented by a circle where the arrow start or terminate.
▪Events are numbered for identification purposes and event numbers are also utilized to identify activities on the diagram.
▪Precedence - what activities must precede the activity?
▪Succession - what activities must follow the activity?
METHODS IN DRAWING NETWORKS
THE NETWORK DIAGRAM
THE NETWORK DIAGRAM
Forward pass:
- The Early Start and Early Finish Time Calculated by moving Forward Through the
Network.
-Consider Maximum.
Backward pass:
-The Latest Start and Latest Finish Time Calculated by moving Backward Through
the Network.
-Consider Minimum
STEPS IN CRITICAL PATH
STEP 1
Make a forward pass through the network as follows: For each activity i beginning at
the Start node, compute:
Earliest Start Time (ES) = the maximum of the earliest finish times of all activities immediately
preceding activity i. (This is 0 for an activity with no predecessors.). This is the earliest time an
activity can begin without violation of immediate predecessor requirements.
Earliest Finish Time (Ef) = (Earliest Start Time) + (Time to complete activity i. This represent the
earliest time at which an activity can end.
The project completion time is the maximum of the Earliest Finish Times at the
Finish node.
STEP 2
Make a backwards pass through the network as follows:
Move sequentially backwards from the Finish node to the Start node. At a given node, j, consider all activities ending at node j. For
each of these activities, (i,j), compute:
Latest Finish Time (LF) = the minimum of the latest start times . This is the latest time an activity
can end without delaying the entire project.
Latest Start Time (LS) = (Latest Finish Time) - (Time to complete activity ). This is the latest time
an activity can begin without delaying the entire project.
STEP 3
Calculate the float time for each activity by:
Float or slack = (Latest Start) - (Earliest Start),
or
= (Latest Finish)-(EarliesFinish).
A critical path is a path of activities, from the Start node to the Finish node, with 0
float times.
Example 1
ACTIVITY IMMEDIATE PREDECESSORS COMPLETION TIME (WEEKS)
A - 2
B A 3
C A 3
D C 4
E D 8
F B,E 6
G F 2
Example 1
2 17 23 25
2 17 23 25
B(3) F(6) G(2)
2 5 6 7
A(2)
1 C(3)
E(8)
0
0 D(4) 𝐿𝐹 𝐿𝑎𝑡𝑒𝑠𝑡 𝐹𝑖𝑛𝑖𝑠ℎ
3 4 =
𝐸𝑆 𝐸𝑎𝑟𝑙𝑖𝑒𝑠𝑡 𝑆𝑡𝑎𝑟𝑡
5 9
5 9
Example 1
Activty Time Earliest Earliest Latest Start Latest Finish Slack
Start(ES) Finish(EF) (LS) (LF) (LS-ES)
A 2 0 2 0 2 0
B 3 2 5 14 17 12
C 3 2 5 2 5 0
D 4 5 9 5 9 0
E 8 9 17 9 17 0
F 6 17 23 17 23 0
G 2 23 25 23 25 0
THE CRITICAL PATH
A–C–D–E–F-G
Example 2
ACTIVTY IMMEDIATE PREDECESSOR COMPLETION TIME (Days)
A - 6
B A 6
C A 4
D A 2
E B 3
F D 6
G E,C,F 5
H D 4
I D 8
J G,H 9
K I 6
Example 2
3
12 E(3)
B(6)
12
6 15 20 29
6 15 20 29
C(4) G(5) J(9)
2 5 6 8
A(6)
D(2)
1 F(6)
H(4)
0 K(6)
0
4 7
9 I(8) 23 𝐿𝐹 𝐿𝑎𝑡𝑒𝑠𝑡 𝐹𝑖𝑛𝑖𝑠ℎ
8 16 =
𝐸𝑆 𝐸𝑎𝑟𝑙𝑖𝑒𝑠𝑡 𝑆𝑡𝑎𝑟𝑡
Example 2
Activty Time Earliest Earliest Latest Start Latest Finish Slack
Start(ES) Finish(EF) (LS) (LF) (LS-ES)
A 0 6 0 6 0
6
B 6 12 6 12 0
6
C 6 10 11 15 5
4
D 6 8 7 9 1
2
E 12 15 12 15 0
3
F 8 14 9 15 1
6
G 15 20 15 20 0
5
H 8 12 16 20 5
4
I 8 16 15 23 7
8
J 20 29 20 29 0
9
K 16 22 23 29 7
6
THE CRITICAL PATH
A–B–E–G-J
