Application of PERT & CPM
Application of PERT & CPM
Classification of Activities
• Predecessor Activity • Concurrent activity • Critical Activity
a b
a
2
1
PREDECESSOR ACTIVITY
b 3
b 3
4
c
Time Estimates in PERT
Optimistic Time (a) Most Likely Time (m) Pessimistic Time (b)
Minimum Possible Time Best estimate of time Maximum possible time
Expected Time, T
= (a+4m+b)/6
Critical Path
Longest Possible Continuous Path from Starting to Ending Point
C(3)
H(1)
F(1) G(2)
Slack
Maximum length of time that can be delayed without delaying entire project
Slack of critical activity = Zero
Slack = LS-ES or LF-EF
Earliest Start Time (ES) Earliest Finish Time (ES) Latest Finish Time (LF) Latest Start Time (LS)
Immediate
Activity description Activity code Optimistic time (a) Most likely time (m) Pessimistic time (b)
predecessors
Site clearing A - 1 2 3
Foundation B A 2 3.5 8
Block Laying C B 6 9 18
Roofing D C 4 5.5 10
Plumbing E C 1 4.5 5
Electrical work F E 4 4 10
Plastering G D 5 6.5 11
Fixing up of doors
H E, G 5 8 17
and windows
Ceiling I C 3 7.5 9
Flooring J F, I 3 9 9
Interior Fixtures K J 4 4 4
Exterior fixtures L J 1 5.5 7
Painting M H 1 2 3
Landscaping N K, L 5 5.5 9
Expected Time Standard Deviation
𝑎+ 4 𝑚 +𝑏 𝑏−𝑎
𝑇𝑒= ∂=
6 6
a = Optimistic Time
m = Most Likely Time
b = Pessimistic Time
Expected time duration and standard deviation calculation:
Immediate Expected time ( Standard deviation
Activity description Activity code
predecessors (∂)
Site clearing A - 2 0.33
Foundation B A 4 1
Block Laying C B 10 2
Roofing D C 6 1
Plumbing E C 4 0.17
Electrical work F E 5 1
Plastering G D 7 1
Fixing up of doors
H E, G 9 2
and windows
Ceiling I C 7 1
Flooring J F, I 8 1
Interior Fixtures K J 4 0
Exterior fixtures L J 5 1
Painting M H 2 0.33
Landscaping N K, L 6 0.67
Calculation of Earliest Start, Earliest Finish, Latest Start and Latest Finish:
Immediate
Activity code ES EF LS LF
predecessors
A - 2 0 2 0 2
B A 4 2 6 2 6
C B 10 6 16 6 16
D C 6 16 22 20 26
E C 4 16 20 16 20
F E 5 20 25 20 25
G D 7 22 29 26 33
H E, G 9 29 38 33 42
I C 7 16 23 18 25
J F, I 8 25 33 25 33
K J 4 33 37 34 38
L J 5 33 38 33 38
M H 2 38 40 42 44
N K, L 6 38 44 38 44
Network Diagram
Critical Path
Activity Node A B C D E F G H I J K L M N
Slack (LS-ES) 0 0 0 4 0 0 4 4 2 0 1 0 4 0
On Critical
Yes Yes Yes No Yes Yes No No No Yes No Yes No Yes
Path
A–B–C–E–F–J–L–N
CPM
Critical path is a sequence of activity between a project’s start and finish
that takes the longest time to complete.
ct iv ity’s
A
Cost
TRADE
OFF
c t iv ity’s
A
u r ation
d
Aim
A basic idea
Advantages of CPM
Disadvantages of CPM