2.

CRITICAL PATH METHOD

There are two types of Networks

Arrow Diagram Method (ADM)

-Activity-on-Arrow (AOA) Network

Precedence Diagram Method (PDM)

- Activity-on-Nodes (AON) Network
AOA
• Activity on Arrow (AOA)/ Arrow Diagram Method (ADM)
• In arrow diagram, project task or activities are
represented by the arrow and connected by the node
to express their logical relationship
• Node represents an event. An activity starts or ends at a
node.

Activity A Activity B

Node Node Node

ADM
Diagram for construction of pad footing

Fabricated rebar

Excavate
Fixed fwk Fixed rebar Pour concrete
trench

Fabricated formwork
AON
• Activity on Node (AON)/ Precedence Diagram Method (PDM)
• activity is place on the node
• The arrow used to connect between project task to show their logical
relationship

Act. A Act. B

Node Node
AON

Diagram for construction of pad footing

Arrow - Logical
Node - Activity
Logical – Show the relationship
between activities
- Sequences of interrelated activity
Basic definition in network diagram

• Activity- the performance of a task required to complete the project.

An activity require time, cost, or both.
• Network- a diagram to represent the relationship of activities to
complete a project. The network may be drawn as ADM or PDM.
• Duration- the estimated time required to perform an activity.
Activity Sequencing

• Understand the order of how the job to be accomplished in the field.

• The planner must understand how various activities of the project
related to each other in term of their logical sequence.
• Example preparing formwork before reinforcement could be place &
than pouring concrete.
Activity Sequencing

• Predecessor
• A task whose start or finish date determines the start or finish date of its
successor task.
• Successor
• A task whose start or finish date is driven by its predecessor task.
ADM vs. PDM

Item ADM PDM

ES D EF
A A
Activity LS TF
ES: Early Start LS: Late Start
LF
EF: Early Finish LF: Late Finish
• Activities shown as an arrow or D : Duration TF: Total Float
sometimes as a line.
• Activities shown on node.

A ESD EF 1 ES D EF
ES EF
1 2 A B
Event/ Node LS LF
LS TF LF LS TF LF
• 2 events / nodes
• 1 event
ADM vs. PDM
ADM PDM

Early Start (ES) is the earliest possible time an activity can start.
Early Finish (EF) is the earliest possible time an activity can finish if it is start on
Early Start Time (ES) and finish within the planned duration.
EF = ES + D
*D = duration

Late Finish (LF) is the latest possible time an activity can finish
without extending the completion date of the project.
Late Start (LS) is the latest possible time an activity can start without
extending the completing date of the project.
LS = LF - D
Total float (TF)- the amount of time an activity may be delayed
without delaying the completion date of the project.
TF = LF – ES – D or TF = LS – ES or TF = LF – EF

Free float (FF)- the amount of time an activity may be delayed

without delaying the early start time of the immediately following
activity.
FF(i) = ES(j) –EF(i) ; i-preceding activity, j-following activity
ADM vs. PDM
ADM
-A and B are activities. 1, 2 and 3 are events
-Activity A has ID or label 1-2 ; Activity B has ID or label 2-3
-Activity A precedes activity B

A B
1 2 3

PDM
Activity Nodes

ES D EF ES D EF ES D EF
1 2
A B B
LS TF LF LS TF LF LS TF LF
Predecessor Current Successor
Activity Activity Activity
ADM vs. PDM
Item ADM PDM

F – S F – S
F – F
Relationship • ADM only shows finish-to- S
S
–
-
S
F
start relationships, meaning
that each activity is
completed before the
successor activity starts.

- Critical Path
- A series of interconnected activities through the network
diagram, with each activity having zero total float time. The
critical path determines the minimum time to complete the
project.
Critical path
1. ESX = LSX, or
2. LFX = EFX, or

-
3. Total
Possible toFloat
have(TF) = 0 than one critical path
more
- Activities which lay on critical path cannot suffer any delay
ADM vs. PDM
Item ADM PDM
Definition
• An activity that • Dummy activity is not used
Dummy indicates any activity
following the dummy
in Precedence Diagram
Method (PDM)
cannot be started until
Activity the activity(ies)
preceding the dummy are
completed.
• Activity which has not
duration. It is only used
to show any relationship
D between activities.
or Function
• If there is a situation
where one event is used
to show relationship more
than one activity.
• To show a complicated
relationship clearly
ADM
ADM Dos and Donts

Item ADM
Activity A & B have the same ID for Activity A & B are not
ID same.
A: 1-2
B: 1-2
False A: 1-2
B: 1-3
True
A A
Dummy 1 2
Activity 1 2
B
3
B
D If C is to follow A & B, but If C is to follow A & B, but
D is to follow only B. D is to follow only B.
or (not fulfill) (use dummy)

A C A C

B D B D
 Item ADM
If P, Q and R follow A, and B follows P, Q and R. The following diagram is not the
correct representation of the same.
False P

Dummy A Q B
1 2 3 4
Activity
R
Reason: Activities P, Q and R have the same ID (2-3).
D True
or P 5
A Q B
1 2 3 4

R 6
Activities P has the ID (2-5), Q (2-3) and R (2-6).
 Item ADM
1. D is preceded by A only
2. E is preceded by A and B
3. F is preceded by B and C

Dummy False True

Activity
A D A D
D
or
B E B E

C F C F
Statement 3 not fulfill
where F is preceded by
A, B and C.
ADM vs. PDM

Item ADM PDM

- FORWARD PASS
: To establish the earliest expected start and finish
times for each activity in the network.
Estimating - BACKWARD PASS
duration : To establish the latest allowable start and finish
times for each activity in the network.

FORWARD PASS
Early
Early
Finis
Start
h
Late
Late
Finis
Start
h
BACKWARD PASS 18
Arrow Diagram Method
19

Note

Forward pass a : Early Start (ES)A

b : Late Start (LS)A
c = a + X e = c + Y c : Early Finish (EF)A = (ES)B
d : Late Finish (LF)A = (EF)B
a A c B e e : Early Finish (EF)B
1 b 2 d 3 f : Late Finish (LF)B
X Y f X : Duration of activity A
Y : Duration of activity B
d = f – Y

Backward pass Forward pass Backward pass

a = 0 f = e
c = a + X d = f – Y
e = c + Y b = d - X
 ADM ( Example 1 )

ACTIVITY DURATION(DAY) PREDECESSOR

A 3 -
B 5 A
C 3 B
D 4 -
E 4 A
F 10 E,D
G 9 C,F
 B
2 3
5
C
A 3
3 E
4 G
1 5 6
9
D F
4 10
4 ACTIVITY DURATION PREDECESSOR
(DAY)
A 3 -
B 5 A
C 3 B
D 4 -
E 4 A
F 10 E,D
G 9 C,F
 Forward Pass
0+3=3 Early Finish Box

3 B
Early Start Box 2 3
5
Early C
Start at
A 3
3 E
node 1 0 4 G
is zero 1 5 6
9
D F
4 10
4

Make forward pass through the

network by adding duration times.
 Forward Pass
Early Start Box Early Finish Box

B 8 3+5=8
2 3 3
5
C
A 3
3 E
0 4 G
1 5 6
9
D F
4 10
4

Make forward pass through the

network by adding duration times.
 Forward Pass

3 B
2 3 8
5
C
A 3+4=7 3
3 E
0 4 G
1 5 6
9
D F
4 7 10
4
Larger=7
0+4=4

If two or more activities terminate at a junction

node, place the larger sum at ES box.
 Forward Pass

3 B
2 3 8
5
C
A 3
3 E
0 4 17 G 26
1 5 6
9
D F
4 7 10
4
 Backward Pass

3 B
2 3 8
5
C
A 3
3 E
0 4 17 G 26
1 5 6
9 26
D F
4 7 10
4

Early finish of activity G in the node 6 =26 days. That’s means it

will take 26 days to complete the project. Therefore, 26 days
represents Late Finish of the project.
Enter 26 into Late Finish box at the node 6, and make a backward
pass to establish LF for each activity by deducting the durations.
 Backward Pass
14-5=9

3 B
2 3 8
3 5 14
Smaller=3
C
A 3
3 E 7-4=3
0 4 17 G 26
1 5 6
0 17 9 26
D F
4 7 10
4
7 26-9=17

In the case of junction nodes (with two or more activities), place the
smaller value in the LF box of that node.
 Completed

3 B
2 3 8
3 5 14
C
A 3
3 E
0 4 17 G 26
1 5 6
0 17 9 26
D F
4 7 10
4
7
 Total Float TFB = LF-D-ES
TFB=6 =14-5-3
TFA = LF-D-ES =6
=3-3-0 3 B
=0 2 3 8
3 5 14
C TFC=6
TFA=0 A 3
3 E TFE=0
0 4 17 G 26
1 5 6
0 17 9 26
D F
10 TFG=0
4 7
4
TFD=3 7 TFF=0

Total Float (TF) =LF-D-ES

 Critical Path
TFB=6
3 B
2 3 8
3 5 14
C TFC=6
TFA=0 A 3
3 E TFE=0
0 4 17 G 26
1 5 6
0 17 9 26
D F
10 TFG=0
4 7
4
TFD=3 7 TFF=0

Activities on critical path : A,E,F and G.

 Critical Path
ACTIVITY DURATION(DAY) ES EF LS LF TF
A 3 0 3 0 3 0*
B 5 3 8 3 14 6
C 3 8 17 14 17 6
D 4 0 7 0 7 3
E 4 3 7 3 7 0*
F 10 7 17 7 17 0*
G 9 17 26 17 26 0*

* Critical Activity
Total Float (TF) =LF-D-ES
 ACTIVITY DURATION ES EF LS LF TF
(DAY)
A 3 0 3 0 3 0*
B 5 3 8 3 14 6
C 3 8 17 14 17 6
D 4 0 7 0 7 3
BAR CHART E 4 3 7 3 7 0*
F 10 7 17 7 17 0*
G 9 17 26 17 26 0*

Activity Duration

17

21
10
11
12
13
14
15
16

18
19
20

22
23
24
25
26
1
2
3
4
5
6
7
8
9
(days)
A 3
B 5
C 3
D 4
E 4
F 10
G 9
Example 2 (ADM)
Activity Duration (day) Predecessor (s)
Act. A 2 -
Act. B 3 -
Act. C 3 A
Act. D 4 B
Act. E 3 C,D
Act. F 2 C,D
Act. G 4 E
Act. H 3 F

1. Develop an arrow diagram for the project.

2. Identify critical activity and critical path for the project.
 Activity Duration Predecessor (s)
(day)
Act. A 2 -
Act. B 3 -
Act. C 3 A
Act. D 4 B
Act. E 3 C,D
Act. F 2 C,D
Act. G 4 E
Act. H 3 F

2
C 5
A G
3 E
2 3 4
1 4
F 7
B D
4 2 H
3 3
6
3
 Forward pass

2
2
C 5 10
A G
3 E
2 4
1
0 4 7 3
14
F 7
B D
3 4 2 H
3 3 9
6
3
 Backward pass

2
2
4 C 5 10
A 10 G
3 E
2 4
1
0 4 7 3
7 14
0 F 7
B D 14
3 4 2 H
3 3 9
3 6
11 3
Total Float
Activity Duration ES EF LS LF TF
(day)
Act. A 2 0 2 0 4 2
Act. B 3 0 3 0 3 0*
Act. C 3 2 7 4 7 2
Act. D 4 3 7 3 7 0*
Act. E 3 7 10 7 10 0*
Act. F 2 7 9 7 11 2
Act. G 4 10 14 10 14 0*
Act. H 3 9 14 11 14 2

* Critical Activity Total Float (TF) =LF-D-ES

 Critical Path

2
2
4 C 5 10
A 10 G
3 E
2 4
1
0 4 7 3
7 14
0 F 7
B D 14
3 4 2 H
3 3 9
3 6
11 3

Activities on critical path : B,D,E and G.

Critical path
Exercise 3 (ADM)
Activity Duration (day) Predecessor (s)
Act. A 2 -
Act. B 3 A
Act. C 5 A
Act. D 4 A
Act. E 2 B,C
Act. F 3 C
Act. G 4 C,D
Act. H 2 E,F,G

• Prepare a arrow diagram for the project.

• Identify critical path for the project.
 Exercise 3 Forward pass

B 7
4
3
5,7

E
2
9,10,11
0 A 2 C 7 11 H 13
1 2 3 F 6 7
2 5 3 2

G
6,7

4
D 7
5
4
 Exercise 3 Backward pass

B 7
4
3 9

E
2
0 A 2 C 7 9,8,7 11 H 13
1 2 3 F 6 7
0 2 5 7 3 11 2 13
2
6,2,3

G
4
D 7
5
4 7
 Exercise 3 (ADM-Solution)

TFB= 9-2-5 B 7
=2 4
3 9 TFE= 11-7-2
=2
TFA= 2-0-2

E
2
=0 TFC= 7-2-5 TFF= 11-7-3 TFH= 13-11-2
0 2 =0 7 =1 =0 13
A C F 11 H 7
1 2 3 6
0 2 2 5 7 3 11 2 13

TFG= 11-7-5

G
=0

4
TFD= 7-2-4 7
D
=2 5
4 7
Activities on critical path : A,C,G and H.
Critical path
Link (Relationship)
• Finish to Start (FS)
• Activity B cannot start until Activity A finish

• Start to Start (SS)

Act. A Act. B
• Activity B cannot start until Activity A start

Act. A

Act. B
Link (Relationship)
• Finish to Finish (FF)
• Activity B cannot finish until Activity A finish. Act. A

• Start to Finish (SF)

Act. B
• Activity B cannot finish until Activity A start.

Act. A

Act. B
Lead time & lag time

• Lead time
• Overlap between dependent Act. A
activity
• Eg : FS – 5d

• Lag time Act. B

• Delay between dependent
activity 5d
• Eg: FS + 2 d

Act. A

Act. B
2d
 PDM ( Example 1)

ACTIVITY DURATION(DAY) PREDECESSOR

A 2 START
B 6 A
C 6 B
D 1 B
E 3 A
F 3 D,E
G 2 C(+2),F
 ACTIVITY DURATION PREDECESSOR
(DAY)

A 2 START
ES D EF B 6 A
C 6 B
Activity
D 1 B
LS TF LF
E 3 A
EXAMPLE 1
F 3 D,E
G 2 C(+2),F
2 6 6
A B C

FS +2 2
G
1
D

3
F
3
E
EXAMPLE 1

FORWARD PASS

0 2 2 2 6 8 8 6 14
A B C
16,12

FS +2 16 2 18
G
8 1 9
D
5,9
9 3 12
F

2 3 5
E
EXAMPLE 1

BACKWARD PASS

0 2 2 2 6 8 8 6 14
A B C
16,12

FS +2 16 2 18
G
8 1 9 16 18
D
5,9
9 3 12
F

2 3 5 16
E
EXAMPLE 1

BACKWARD PASS

0 2 2 2 6 8 8 6 14
A B C
2 2 8 8 14 16,12
2,10 8,12 FS +2 16 2 18
G
8 1 9 16 18
D
5,9
12 13
9 3 12
F

2 3 5 13 16
E
10 13
EXAMPLE 1

BACKWARD PASS

0 2 2 2 6 8 8 6 14
A B C
0 2 2 8 8 14 16,12
2,10 8,12 FS +2 16 2 18
G
8 1 9 16 18
D
5,9
12 13
9 3 12
F

2 3 5 13 16
E
10 13
EXAMPLE 1

COMPLETED

0 2 2 2 6 8 8 6 14
A B C
0 2 2 8 8 14 16,12

2,10 8,12 FS +2 16 2 18
G
8 1 9 16 18
D
5,9
12 13
9 3 12
F

2 3 5 13 16
E
10 13
 EXAMPLE 1
53

TOTAL FLOAT TFC = LF-EF

TFG = LF-EF
=14-14
=18-18
0 2 2 2 6 8 8 6 14 =0
=0
A B C
0 0 2 2 0 8 8 0 14
FS +2 16 2 18
TFB = LF-EF
=8-8 G
TFA = LF-EF
=0 8 1 9 16 0 18
=2-2
=0 D
12 4 13
9 3 12 TFF = LF-EF
TFD = LF-EF =16-12
=13-9 F =4
=4
2 3 5 13 4 16
E TFE = LF-EF
10 8 13 =13-5
=8
 EXAMPLE 1
54

FREE FLOAT

0 2 2 2 6 8 8 6 14 FFC = ESSUCC-EF- Lag

=16-14-2
A B C =0
0 0 2 2 0 8 8 0 14
FS +2 16 2 18
FFA = ESSUCC-EF- FFB = ESSUCC-EF-
FFF = ESSUCC-EF- Lag
G
Lag Lag 8 1 9 =16-12-0 16 0 18
=2-2-0 =8-8-0
=0 =0 D =4

12 4 13
FFD = ESSUCC-EF- Lag 9 3 12
FFA = ESSUCC-
=9-9-0 F EF-
=0
Lag
2 3 5 13 4 16 =18-18-
0
E =0

10 8 13
EXAMPLE 1

CRITICAL PATH

0 2 2 2 6 8 8 6 14
A B C
0 0 2 2 0 8 8 0 14 16,12

2,10 8,12 FS +2 16 2 18
G
8 1 9 16 0 18
D
5,9
12 4 13
9 3 12
F

2 3 5 13 4 16
E
10 8 13
Example 2 (PDM)
Activity Duration (day) Predecessor (s)
Act. A 10 -
Act. B 11 A
Act. C 5 B
Act. D 4 B
Act. E 12 A
Act. F 3 C,D
Act. G 7 F
Act. H 11 E
Act. I 4 G,H

1. Develop a precedence diagram for the project.

2. Identify critical activity and critical path for the project.
Example 2 (PDM)
5

11 C 3 7

B F G

D
10 4

A I

12 11

E H

ES D LS

Activity

LS TF LF
 Example 2 (PDM-forward pass)
21 5 26

10 11 21 C 26 3 29 29 7 36

B F G

21 4 25

D
0 10 10 36 4 40

A I

10 12 22 22 11 33

E H

ES D LS

Activity

LS TF LF
 Example 2 (PDM-backward pass)
21 5 26

10 11 21 C 26 3 29 29 7 36
21 26
B F G
10 21 26 29 29 36
21 4 25

D
0 10 10 22 26 36 4 40

A I
0 10 36 40

10 12 22 22 11 33

E H
13 25 25 36
ES D LS

Activity

LS TF LF
 Example 2 (PDM-Total float)
21 5 26

10 11 21 C 26 3 29 29 7 36
21 0 26
B F G
10 0 21 26 0 29 29 0 36
21 4 25

D
0 10 10 22 1 26 36 4 40

A I
0 0 10 36 0 40

10 12 22 22 11 33

E H
13 3 25 25 3 36
ES D LS

TF = LF – ES – D or TF = LS – ES or TF = LF – EF Activity
Critical path
LS TF LF
Example 3 (PDM)
Activity Duration (week) Predecessor (s)
Act. A 2 -
Act. B 3 A (FS+2),
C (FF+1),
D(FF)
Act. C 2 A
Act. D 1 C (SS)

1. Develop a precedence diagram for the project.

2. Identify critical activity and critical path for the project.
Example 3 (PDM-forward pass)

4 3 7
+2
B

0 2 2

A
2 2 4
+1
C

2 1 3

D
Example 3 (PDM-backward pass)

4 3 7
+2
B
4 0 7
0 2 2

A Total Float = LF – ES – D
0 0 2 2 2 4 TF(A) = 2-0-2 = 0
+1 TF(B) = 7-4-3 = 0
C
TF(C) = 6-2-2 = 2
4 2 6
TF(D) = 7-2-1 = 4

2 1 3

D
6 4 7
Critical path
Exercise 4(PDM)
Activity Duration (day) Predecessor (s)
Act. A 2 -
Act. B 3 A
Act. C 5 A
Act. D 4 A
Act. E 2 B,C
Act. F 3 C
Act. G 4 C,D
Act. H 2 E,F,G

• Prepare a precedence diagram for the project.

• Identify critical path for the project.
Exercise (PDM-Solution)

2 3 5
7 2 9
B
E
6 4 9
9 2 11

0 2 2 5 7 3 10 2
2 7 11 13
A C F H
0 0 2 2 8 1 11 11 0 13
0 7

7 4 11
2 4 6
G
D
7 0 11
3 1 7
UWB10202 Effective Communication by Norazmi Danuri
(norazmi@uthm.edu.my)
UWB10202 Effective Communication by Norazmi Danuri
(norazmi@uthm.edu.my)