CRITICAL PATH METHOD

ASSA ABLOY SA is a company specializing in door opening solutions. One part

of the company focuses on manufacturing pin tumbler and lever locks for multiple brands
including Union, Yale and Multi-Lock. Find the Critical Path. The production line used
to produce padlocks is a perfect example of a network system; the steps are shown:

Solving the problem:

1. Drawing the Project Network

F G
0.80 1.0

A B C H I J
0.50 1.0 1.5 0.40 1.40 0.50

D E
1.4 1.20
2. Determining early start (ES) and early finish (EF)

EF = ES + Duration
Activity Duration ES EF
ES(A) = 0 A 0.5 0 0.5
EF(A) = ES(A) + 0.5 = 0.5 B 1 0.5 1.5
EF(B) = EF(A) + 1 = 1.5 C 1.5 1.5 3
EF(C) = EF(B) + 1.5 = 3 D 1.4 1.5 2.9
EF(D) = EF(B) + 1.4 = 2.9 E 1.2 2.9 4.1
EF(E) = EF(D) + 1.2 = 4.1 F 0.8 1.5 2.3
EF(F) = EF(B) + 0.8= 2.3 G 1 2.3 3.3
EF(G) = EF(F) + 1 = 3.3 H 0.4 4.1 4.5
EF(H) = EF(E) + 0.4 = 4.5 I 1.4 4.5 5.9
EF(I) = EF(H) + 1.4 = 5.9 J 0.5 5.9 6.4
EF(J) = EF(I) + 0.5 = 6.4

1.50 2.30 2.30 3.30

F G
0.80 1.0

0 0.50 0.50 1.50 1.50 3.00 4.10 4.50 4.50 5.90 5.90 6.40
A B C H I J
0.50 1.0 1.5 0.40 1.40 0.50

1.50 2.90 2.90 4.10

D E
1.4 1.20

3. Determining late start (LS) and late finish (LF)

LS = LF - Duration

LF(J) = 6.4
LS(J) = LF(J) – 0.5 = 5.9 Activity Duration ES EF LS LF
LS(I) = LS(J) – 1.4 = 4.5 A 0.5 0 0.5 0.00 0.5
B 1 0.5 1.5 0.5 1.5
LS(H) = LS(I) – 0.4 = 4.1
C 1.5 1.5 3 2.6 4.1
LS(G) = LS(H) – 1 = 3.1
D 1.4 1.5 2.9 1.5 2.9
LS(F) = LS(G) – 0.8 = 2.3 E 1.2 2.9 4.1 2.9 4.1
LS(E) = LS(H) – 1.2 = 2.9 F 0.8 1.5 2.3 2.3 3.1
LS(D) = LS(E) – 1.4 = 1.5 G 1 2.3 3.3 3.1 4.1
LS(C) = LS(H) – 1.5 = 2.6 H 0.4 4.1 4.5 4.1 4.5
LS(B) = LS(D) – 1 = 0.5 I 1.4 4.5 5.9 4.5 5.9
LS(A) = LS(B) – 0.5 = 0.0 J 0.5 5.9 6.4 5.9 6.4
 1.50 2.30 2.30 3.30
F G
2.30 3.10 3.10 4.10
0.80 1.0

0 0.50 0.50 1.50 1.50 3.00 4.10 4.50 4.50 5.90 5.90 6.40
A B C H I J
0.00 0.50 0.50 1.50 2.60 4.10 4.10 4.50 4.50 5.90 5.90 6.40
0.50 1.0 1.5 0.40 1.40 0.50

1.50 2.90 2.90 4.10

D E
1.50 2.90 2.90 4.10
1.4 1.20

3. Determining the total float (TF) and free float (FF)

TF = LF – ES – D

TF(A) = 0.5 – 0 – 0.5 = 0 Activity Duration ES EF LS LF TF

TF(B) = 1.5 – 0.5 – 1 = 0 A 0.5 0 0.5 0.00 0.5 0.00
TF(C) = 4.1 – 1.5 – 1.5 = 1.1 B 1 0.5 1.5 0.5 1.5 0.00
C 1.5 1.5 3 2.6 4.1 1.10
TF(D) = 2.9 – 1.5 – 1.4 = 0 D 1.4 1.5 2.9 1.5 2.9 0.00
TF(E) = 4.1 – 2.9 – 1.2 = 0 E 1.2 2.9 4.1 2.9 4.1 0.00
TF(F) = 3.1 – 1.5 – 0.8 = 0.8 F 0.8 1.5 2.3 2.3 3.1 0.80
TF(G) = 4.1 – 2.3 – 1 = 0.8 G 1 2.3 3.3 3.1 4.1 0.80
H 0.4 4.1 4.5 4.1 4.5 0.00
TF(H) = 4.5 – 4.1 – 0.4 = 0 I 1.4 4.5 5.9 4.5 5.9 0.00
TF(I) = 5.9 – 4.5 – 1.4 = 0 J 0.5 5.9 6.4 5.9 6.4 0.00
TF(J) = 6.4 – 5.9 – 0.5 = 0

FF = Earliest Successor (ES) – EF

FF(A) = 0.5 – 0.5 = 0

FF(B) = 1.5 – 1.5 = 0 Activity Duration ES EF LS LF TF FF
A 0.5 0 0.5 0.00 0.5 0.00 0.00
FF(C) = 4.1 – 3 = 1.1 B 1 0.5 1.5 0.5 1.5 0.00 0.00
FF(D) = 2.9 – 2.9 = 0 C 1.5 1.5 3 2.6 4.1 1.10 1.10
FF(E) = 4.1 – 4.1 = 0 D 1.4 1.5 2.9 1.5 2.9 0.00 0.00
FF(F) = 2.3 – 2.3 = 0 E 1.2 2.9 4.1 2.9 4.1 0.00 0.00
F 0.8 1.5 2.3 2.3 3.1 0.80 0.00
FF(G) = 4.1 – 3.3 = 0.8 G 1 2.3 3.3 3.1 4.1 0.80 0.80
FF(H) = 4.5 – 4.5 = 0 H 0.4 4.1 4.5 4.1 4.5 0.00 0.00
FF(I) = 5.9 – 5.9 = 0 I 1.4 4.5 5.9 4.5 5.9 0.00 0.00
J 0.5 5.9 6.4 5.9 6.4 0.00 -

4. Determine the critical path

The critical path in any project network is the longest path from the first activity to the
last activity.
· An activity with a total float of zero is a critical activity.
· A path from Activity A to Activity J that consists entirely of critical activities is the
critical path.

Activity Duration ES EF LS LF TF FF
A 0.5 0 0.5 0.00 0.5 0.00 0.00
B 1 0.5 1.5 0.5 1.5 0.00 0.00
C 1.5 1.5 3 2.6 4.1 1.10 1.10
D 1.4 1.5 2.9 1.5 2.9 0.00 0.00
E 1.2 2.9 4.1 2.9 4.1 0.00 0.00
F 0.8 1.5 2.3 2.3 3.1 0.80 0.00
G 1 2.3 3.3 3.1 4.1 0.80 0.80
H 0.4 4.1 4.5 4.1 4.5 0.00 0.00
I 1.4 4.5 5.9 4.5 5.9 0.00 0.00
J 0.5 5.9 6.4 5.9 6.4 0.00 -

1.50 2.30 2.30 3.30

F G
2.30 3.10 3.10 4.10
0.80 1.0

0 0.50 0.50 1.50 1.50 3.00 4.10 4.50 4.50 5.90 5.90 6.40
A B C H I J
0.00 0.50 0.50 1.50 2.60 4.10 4.10 4.50 4.50 5.90 5.90 6.40
0.50 1.0 1.5 0.40 1.40 0.50

1.50 2.90 2.90 4.10

D E
1.50 2.90 2.90 4.10
1.4 1.20

As can be seen from above, the critical path is: A –B–D–E–H–I–J

Reference: Critical Path Method. (2018). Solved Problem. [online] Available at:
https://criticalpathmethod.weebly.com/solved-problem.html [Accessed 24 Apr. 2018].