0% found this document useful (0 votes)
43 views6 pages

Critical Path Method

Download as pptx, pdf, or txt
Download as pptx, pdf, or txt
Download as pptx, pdf, or txt
You are on page 1/ 6

CPM

Critical Path Method


CPM
• Activities timing are deterministic
• Single duration
• Longest path of the network
• Earliest start time – forward pass
– Formula ESj = maxi (ESi + Dij)
• Latest completion time – backward pass
– Formula LCi = minj (LCj - Dij)
Earliest start time - Forward Pass
6
8
2 D(2)
0 A(6)
5

1 I(5)
B(3) 3 17
3 E(3)
8
C(4)
6 9
F(5)
H(5) J(3)
4
4 G(3) 7
14
Latest completion time – backward pass
10
6 12
8
0 2 D(2)
0 A(6)
5
6 17
1 I(5)
B(3) 3 17
3 E(3)
9
8
C(4)
6 9
F(5)
H(5) J(3)
4 4
4 G(3) 7 14
14
CPM - Conditions
1. ESi = LCi (starting node)
2. ESj = LCj (ending node)
3. ESj – ESi = LCj – LCi = Dij
10
6 12
8
0 2 D(2)
0 A(6)
5
6 17
1 I(5) 17
B(3) 3
3 E(3) 9
9 8
6
C(4)
F(5)
H(5) J(3)
4 4
4
G(3) 7 14
14
Activity
Activity Predecessor O M P Mean = Variance =
(O+4M+P)/ 6 [(P – O)/6]2
A - 2 3 4
B - 2 3 4
C B 6 7 8
D A 5 6 7
E A 4 5 6
F C, D 4 8 12
G C, D 4 5 6
H G 2 3 4
I E 2 4 6

Construct the network and find the critical path after


forward and backward pass

You might also like