The Critical Path Method

(CPM)
Lec. Bilal Ayub
CE & M Dept
NIT- SCEE
bilalayub@nit.nust.edu.pk
Introduction
.Suppose you decide with your friend to go in hunting trip

You must do specific activity such that the trip well be at the right way. The following
.activity must be done

2
From chart you can see that the 3rd activity (preparing the jeep) have the longest period of time any
”delay with this activity leads to delay in the trip this activity is a “critical activity

Critical activity : An activity on the critical path any delay on the start or finish of a critical activity will
result in a delay in the entire project

Critical path : The longest path in a network from start to finish

3
Events and Milestones
 An event: a point in time that is usually the start or finish of a certain
activity(s)
Duration = 0

 Important events are called milestones

milestones such as NTP and
finish milestones such as Substantial Completion

 An activity has a start date and a finish date

 An event / milestone has a start date or a finish date

4
Node Networks
• Node networks are also called activity on node (AON) networks.
• In node networks, we use a different notation for representation:
• a node represents an activity.
• Nodes(activities) are connected with arrows (or lines) that represent
the logical relationships.
• Start any network with one node (whether this node represents an
event or an activity) and end it with one node.
• Doing so may require one or two fictitious activities in node diagrams
that start or end with more than one activity.
• We call these activities PS (project start) and PF (project finish)displayed
as diamond-shaped nodes.
Node Format

ES Activity ID EF

Activity Name

LS Duration LF

TF FF

6
Recommendations for Proper Node
Diagram Drawing
1. Nodes in node diagrams (activities) as squares (rectangles).
2. Milestones are usually drawn as diamonds to emphasize the fact that they have no
duration; thus, nodes have no ‘‘sides.’’
3. Do not connect nodes (in node diagrams) from the top or bottom. Connect sides only.
The left side represents the start side, and the right side represents the end (finish)
side.
4. Although networks are not time-scaled, in general, they should be designed from left
to right in an almost chronological order. Relationship lines (arrows) can be horizontal,
inclined, or broken.
5. Do not combine relationship lines . These relationships are independent from their
start to their end. Besides, one of them may carry a lag while the other one does not
(or carries a different lag).
5. Try to minimize line crossings .When two lines (relationships) must intersect,
make a ‘‘jump’’ on one of them to indicate that they do not intersect or
meet.
6. Start the network with one node and finish it with one node i.e insert a PS
(Project Start) milestone node at the start and tie it to those activities that
start the network.
7. Insert a PF (Project Finish) milestone node at the end and tie those activities
that end the network to it.
8. In many cases of hand drawing, you will need to redraw the network after
your first attempt. Although your first attempt may be logically proper, it
may look awkward and confusing.
9. Redraw it to minimize line crossing and relocate activities to be as near as
possible to their predecessors and successors.
Examples
Example
Draw the logic network and perform the CPM calculations for the schedule shown next.

Duration IPA Activity

5 - A
8 A B
6 A C
9 B D
6 B,C E
3 C F
1 D,E,F G

15
Forward pass calculations

In mathematical terms, the ES for activity j is as follows :

ESj =max( EFi )

where (EFi) represents the EF for all preceding activities.

Likewise, the EF time for activity j is as follows :

EF j= ESj + Dur j

where Dur j is the duration of activity j

Forward pass: The process of navigating through a network from start to end and calculating the
completion date for the project and the early dates for each activity

16
Solution :

5,13 13,22
B D
8 9
0,5
13,19 22,23
A G
E
5 1
6
5,11 11,14
C F
6 3

17
 Backward pass calculations
: In mathematical terms, the late finish LF for activity j is as follows

LFj =min(LSk (

.where (LSk) represents the late start date for all succeeding activities

: Likewise, the LS time for activity j (LS j) is as follows

LS j= LFj - Dur j

where Dur j is the duration of activity

Backward pass: The process of navigating through a network from end to start and calculating the late dates for
each activity. The late dates (along with the early dates) determine the critical activities, the critical path, and the
.amount of float each activity has

18
Solution :

5,13 13,22
B D
8 9
0,5 5,13 13,22
13,19 22,23
A G
E
5 1
6
0,5
16,22 22,23
5,11 11,14
C F
6 3
10,16 19,22

CPM ( ES = LS , EF = LF , TF = FF = 0)
19
Four Types Of Floats
There are several types of float. The simplest and most important type of float is
Total Float (TF)

 Total float (TF): The maximum amount of time an activity can be delayed from its
early start without delaying the entire project.

TF = LS – ES
or
TF = LF - EF
or
TF = LF - Dur - ES

25
 Free Float: may be defined as the maximum amount of time an activity can be delayed
without delaying the early start of the succeeding activities

FFi = min(ESi+1) - EFi

where min (ESi+1) means the least (i.e., earliest) of the early start dates of succeeding activities

26
Consider the previous example

5,13 13,22
B D
8 9
0,5 5,13 13,22
13,19 22,23
A G
E
5 1
6
0,5
16,22 22,23
5,11 11,14
C F
6 3
10,16 19,22

CPM ( ES = LS , EF = LF , TF = FF = 0)
27
In the example we can find the free float and total float for each activity as the following :

Activity C’s free float, FF = 11 - 11 = 0 days

And
Activity C’s total float, TF =16 - 11= 5 days …… and so on.

FF TF LF LS EF ES Duration Activity

0 0 5 0 5 0 5 A
0 0 13 5 13 5 8 B
0 5 16 10 11 5 6 C
0 0 22 13 22 13 9 D
3 3 22 16 19 13 6 E
8 8 22 19 14 11 3 F
0 0 23 22 23 22 1 G

 Critical activity
 Note : We must always realize that FF ≤ TF
28
 Interfering float: may be defined as the maximum amount of time an activity can be
delayed without delaying the entire project but causing delay to the succeeding
activities.

TF = FF - Int. or Int. F = TF - FF

 Independent float (Ind. F): we may define it as the maximum amount of time an
activity can be delayed without delaying the early start of the succeeding activities
and without being affected by the allowable delay of the preceding activities.

Ind. Fi = min(ESi1+) – max(LFi-1) – Duri

Note: make sure that Ind. F ≤ FF

29
Example

Activity Duration IPA

A 5 -
B 8 A
C 6 A
D 9 B
E 6 B,C
F 3 C
G 1 D,E,F

30
Tabular Solution

Activity Duration ES EF LS LF TF

A 5 0 5 0 5 0

B 8 5 13 5 13 0

C 6 5 11 10 16 5

D 9 13 22 13 22 0

E 6 13 19 16 22 3

F 3 11 14 19 22 8

G 1 22 23 22 23 0

31
Graphic Solution

5, 13 13, 22

B D
8 9

0, 5 5, 13 3 13, 19 13, 22 22, 23

A E G
5 6 1

0, 5 16, 22 22, 23

5 5, 11 8 11, 14

C F
6 3

10, 16 19, 22

All dates above represent the end of the day

32
Example

Activity Duration IPA

A 5 -
B 6 A
C 5 A
D 3 A
E 3 B
F 4 B, C
G 4 D
H 7 B,C,G
I 8 E, F
J 2 F
K 3 H, J
L 2 I, J

33
 B E I
6 3 8

L
2
A C F J
5 5 4 2 PF

D G H K
3 4 7 3

34
Graphic Solution

5, 11 1 11, 14 15, 23
B E I
6 3 8
23, 25
5, 11 12, 15 15, 23
L
1 5, 10 5 15, 17 2
0, 5 11, 15 25
23, 25
A C F J
5 5 4 2 PF
0, 5 6, 11 11, 15 20, 22
25

3 3 3 3
5, 8 8, 12 12, 19 19, 22
D G H K
3 4 7 3
8, 11 11, 15 15, 22 22, 25

35
Tabular Solution

Activity ES EF LS LF TF FF
A 0 5 0 5 0 0
B 5 11 5 11 0 0
C 5 10 6 11 1 1
D 5 8 8 11 3 0
E 11 14 12 15 1 1
F 11 15 11 15 0 0
G 8 12 11 15 3 0
H 12 19 15 22 3 0
I 15 23 15 23 0 0
J 15 17 20 22 5 2
K 19 22 22 25 3 3
L 23 25 23 25 0 0

36
Float Discussion

 Total float –in general- belongs to a path rather than the activity itself

 If an activity uses “its” float, successors may lose some or all of “their” float

 Total float versus free float

 Total float is broken down into free float, independent float, and interfering float.

 Researchers have come up with even more types

37
 The question is: “who owns the float”?

 Float distribution attempts

 Review the contract – what if it is not mentioned?

 Float with resource leveling

 Shifting activities within their float may affect:

 Start / finish dates of succeeding activities

 Resource usage: Labor and equipment (crews)

 Materials: delivery, storage

 Cash flow
38
Lags in Node Networks
 A lag is a minimum compulsory waiting period between the start/finish of an
activity and the start/finish of the successor

 Actual waiting period may be greater, but never less than the lag

 Lags are very common with SS and FF relationships

 A lead is a negative lag

 The lag is added in the CPM’s forward pass calculations and subtracted in the
backward pass
 Arrow networks cannot accommodate lags. The only solution in such networks is to
treat it as a real activity with a real duration, no resources, and a $0 budget.
 A node network can accommodate such a lag if we simply put the lag on the
relationship line
39
Examples:
 Concrete curing (before formwork stripping or reshoring)

 Asphalt curing (before striping)

 Waiting for a permit to be issued

 Waiting for the delivery of a custom material or equipment

40
Example

Activity Duration IPA Lag

A 5 -
B 3 -
C 6 -
D 7 A
E 7 A
B 4
F 4 A,B,C
G 5 E
F 3
H 6 D
G 2
I 3 D,G

41
Graphic Solution

0, 5 5, 12 21, 27
A D H
5 7 6
2, 7 14, 21 2 21, 27
0 0, 3 7, 14 14, 19 19, 22 27

PS B 4 E G I PF
3 7 5 3
0 0, 3 7, 14 14, 19 24, 27 27
3
0, 6 6, 10
C F
6 4
1, 7 7, 11

42
Tabular Solution

Activity ES EF LS LF TF FF
A 0 5 2 7 2 0
B 0 3 0 3 0 0
C 0 6 1 7 1 0
D 5 12 14 21 9 7
E 7 14 7 14 0 0
F 6 10 7 11 1 1
G 14 19 14 19 0 0
H 21 27 21 27 0 0
I 19 22 24 27 5 5

43
Lead
• The term lead simply means a negative lag.
• It is seldom used in construction.
• In simple language: A positive time gap (lag) means ‘‘after’’
and a negative time gap (lead) means ‘‘before.’’
Calendars

 Each activity has to be assigned a calendar

 Different crews working for different activities work on different calendars.

 The crew working for the same activity may work 5 days/week at normal times then switch
to 6 or 7 days/week

 User has to be aware of the impact of such matter on the duration of activities
and consequently the project

49
 Computer scheduling programs can handle calendars:
Global, default, and other calendars

 Recurring holidays

 Work hours per day

 Resource calendars

 Scheduling in other countries

50
Non-Work Days
 Schedulers must take in account non-work days. This includes:

 Scheduled non-work days such as:.

• Holidays,

• Shut-downs.

 Unscheduled non-work days such as:

• Rain days (or severe weather),

• Other unforeseen interruptions

 Distribution of unscheduled non-work days

51
Example

IPAs Duration Activity

-- 2 A
A 2 B
A 4 C
C 1 D
B,C 4 E
B 2 F
D 1 G
F,E 4 H
F 2 I
G,H 4 J
I,H 4 K
K,J 1 L
The Four Types Relationships

Activities represented by nodes and links that allow the use of four
relationships:

1) Finish to Start – FS

2) Start to Finish – SF

3) Finish to Finish – FF

4) Start to Start – SS

3/23/20 53
Finish to Start (FS) Relationship
.The traditional relationship between activities .

Implies that the preceding activity must finish .

.before the succeeding activities can start

.Example: the plaster must be finished before the tile can start .

Plaster Tile

3/23/20 54
Start to Finish (SF) Relationship

.Appear illogical or irrational .

.Typically used with delay time OR LAG .

.The following examples proves that its logical .

Erect steel Pour

reinforcement
formwork concrete

5 SF

Order
concrete
3/23/20 55
Finish to Finish (FF) Relationship

• Both activities must finish at the same time.

• Can be used where activities can overlap to a certain limit.

Erect Remove
scaffolding Old paint

FF/1

sanding

FF/2

Dismantle
painting inspect scaffolding
3/23/20 56
Start to Start (SS) Relationship

• This method is uncommon and almost non-existing in project construction .

Clean surface Spread grout

SS

Set tile Clean floor area

3/23/20 57
Advantages of using Precedence Diagram

1. No dummy activities are required.

2. A single number can be assigned to identify each activity.

3. Analytical solution is simpler.

3/23/20 58
COMPARISON OF ARROW AND
NODE NETWORKS
1. Node networks are easier to draw.
2. Node networks do not require dummy activities to fix the activity
identity problem.
3. Node networks do not require dummy activities to straighten up the
logic.
4. Node networks can accommodate lags between activities without the
addition of more activities.
5. In addition to the preceding advantages, node diagrams can be taken to
an advanced stage in which they represent not just the traditional finish-
to-start relationship but also three other relationships (start to start,
finish to finish, and start to finish).