ACT-506: Advanced Application of Computer in Textiles Lecture on Critical Path Analysis
Critical Path Analysis
Problem-1: Consider the following table
Activity Predecessor Mean Duration
A - 7
B - 3
C - 4
D A 2
E A,B 3
F C 5
G C 3
H E,F 4
I E,F 5
J D,H 6
K I,G 3
(i) Construct the project network
(ii) Find the critical path and expected project completion time
(iii) Find the total float and free float
# The CPM network is shown below:
A.N.M. Bazlur Rashid, Assistant Professor (Computer) & Head, Department of Allied Engineering, Bangladesh University of Textiles / Page 1 of 4
ACT-506: Advanced Application of Computer in Textiles Lecture on Critical Path Analysis
Critical Path and Project Completion Time:
The critical path of a project network is the longest path in the network. It can be identified by listing all
possible paths from source to destination and then choosing the maximum path.
Let, Dij be the duration of the activity. ESj be the earliest start times of all the activities which are emanating
from node j (shown lower square side in the network). ESj is defined as ESj=max(ESi+Dij).
LCi be the latest completion time and defined as LCi=min(LCj-Dij). LCi values are shown in the upper squares in
the network.
An activity is said to be critical if all the following conditions are satisfied.
ESi=LCi ESj=LCj ESj-ESi=LCj-LCi=Dij
That is, whenever, we have a upper square value=lower square value in the network, we can add it into critical
path. Thus the critical path of our given problem is A-dummy-E-H-J.
Project completion time = 20;
Computing Total Floats and Free Floats:
Total Floats= LCj-ESi-Dij and Free Floats=ESj-ESi-Dij
Now, the following table shows us the TF and FF values required in this problem.
Activity Duration TF FF
1-2 7 0 0
1-3 3 4 4
1-4 4 1 0
2-3 0 0 0
3-5 3 0 0
3-6 2 5 5
4-5 5 1 1
4-7 3 10 8
5-7 5 0 0
5-6 4 0 0
6-8 6 0 0
7-8 3 2 2
A.N.M. Bazlur Rashid, Assistant Professor (Computer) & Head, Department of Allied Engineering, Bangladesh University of Textiles / Page 2 of 4
ACT-506: Advanced Application of Computer in Textiles Lecture on Critical Path Analysis
NOTE:
ES is defined as- take the maximum path cost from all possible paths from starting node to node n.
LC is defined as- take the minimum value from all possible paths from node n to ending node.
TF is calculated as- targets upper square-sources lower square-path cost.
FF is calculated as- targets lower square-sources lower square-path cost.
Problem-2: A small project consists of seven activities for which the relevant data are given below.
Activity Predecessor Mean Duration
A - 4
B - 7
C - 6
D A,B 5
E A,C 7
F C,D,E 6
G C,D,E 5
(i) Draw the network and find the project completion time.
(ii) Calculate total float for each of activities.
# The CPM network is shown below:
A.N.M. Bazlur Rashid, Assistant Professor (Computer) & Head, Department of Allied Engineering, Bangladesh University of Textiles / Page 3 of 4
ACT-506: Advanced Application of Computer in Textiles Lecture on Critical Path Analysis
# Determining Critical Path and Project Completion Time:
By the same way as in problem-1, we get the critical path C-E-F and project completion time is 19.
# Computing Total Floats and Free Floats:
Now, the following table shows us the TF and FF values required in this problem.
Activity Duration TF FF
1-2 7 1 0
1-3 4 2 0
1-4 6 0 0
3-2 0 3 3
3-4 0 2 2
2-5 5 1 1
4-5 7 0 0
4-5 0 7 7
5-7 6 0 0
5-6 5 1 0
6-7 0 1 1
A.N.M. Bazlur Rashid, Assistant Professor (Computer) & Head, Department of Allied Engineering, Bangladesh University of Textiles / Page 4 of 4
