Developing a CPM network

• Specify the individual activities ACTIVITY IMMEDIATE EXPECTED

PREDECESSOR TIME
• Determine the sequence of the (IN WEEKS)
activities A - 5
• Draw the network diagram B - 6
• Estimate the activity C A 4
completion time
D A,B 2
• Identify the critical path

A C

START FINISH

B D
Estimating Time of Completion
• Forward Pass (Considers maximum)
• Backward Pass (Considers minimum)

Critical path is the path of activity having zero slack time

 Developing a PERT network
• Identify the activities
• Determine proper sequence of the activities
• Construuct the network diagram
• Estimate the time required for each activity
• Determine the critical path
• Update the PERT chart
 Time Estimates
• Optimistic Time(To): It is the shortest time in
which the activity can be completed
• Pessimistic Time(Tp): It is the longest
estimated time required to perform an activity
• Most Likely Time(Tm): It is the probable time
required to perform the activity
• Expected Time:
𝑇𝑜+4𝑇𝑚++𝑇𝑝
• Te=
6
Activity Descripti Preceden Optimisti Most Pessimist Expected
on ce c Time Likely ic Time Time
Time
A Initial - 12 16 26 17
Design
B Survey A 6 9 18 10
Market
C Build A 8 10 `18 11
Prototype
D Test C 2 3 4 3
Prototype
E Redesigni B,D 3 4 11 5
ng
F Market E 6 8 10 8
Testing
G Set up F 15 20 25 20
Productio
n
 PERT Chart

A-B-E-F-G=60
A-C-D-E-F-G=64 (Critical Path)