Scribd
Upload
60 views6 pages

Critical Path Method

The Critical Path Method (CPM) is used to schedule a project by identifying its critical path, which is the longest continuous chain of activities from start to finish with the least amount of slack. It determines the earliest start and latest completion times of each activity by performing forward and backward passes through the network using formulas that calculate times based on predecessor dependencies and activity durations. Activities on the critical path must finish on their latest completion times or the overall project will be delayed.

Uploaded by

6 4 8 3 7 JAYAASRI K
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
60 views6 pages

Critical Path Method

The Critical Path Method (CPM) is used to schedule a project by identifying its critical path, which is the longest continuous chain of activities from start to finish with the least amount of slack. It determines the earliest start and latest completion times of each activity by performing forward and backward passes through the network using formulas that calculate times based on predecessor dependencies and activity durations. Activities on the critical path must finish on their latest completion times or the overall project will be delayed.

Uploaded by

6 4 8 3 7 JAYAASRI K
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
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

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy