PERT-CPM

1. The activities and time estimate for a particular project are as follows:

Immediate Time (in days)

ACTIVITY
Predecessor Optimistic Most Probable Pessimistic Expected

A - 7 8 15 9.00

B A 10 11 12 11.00

C A,B 5 7 9 7.00

D B, C 11 14 17 14.00

E D 5 7 9 7.00

F E 5 7 11 7.00

a. Construct the network diagram:

What is the critical path and expected project completion time? Critical Path = A-B-C-D-E-F

Expected Project Completion Time = 55 days

b. Determine the expected projected completion time and critical path.

 c. Using te, determine the earliest and latest activity times and slack times. Given ES=0 and
EF=LF.
Activity te LS ES LF EF Slack CP?

A 9.00 0 0 9 9 0 Yes

B 11.00 9 9 20 20 0 Yes

C 7.00 20 20 27 27 0 Yes

D 14.00 27 27 41 41 0 Yes

E 7.00 41 41 48 48 0 Yes

F 7.33 48 48 55 55 0 Yes

d. Using te as the Normal time, compute determine an optimum crashing plan.

Normal
Activity time Crash time Cost/day

A 9.00 6 12,000

B 11.00 8 4,000

C 7.00 4 7,000

D 14.00 11 2,000

E 7.00 5 7,000

F 7.00 4

ACTIVITY COST/DAY AVAIL.DAY

A 12,000 3 days

B 4,000 3 days

C 7,000 3 days

D 2,000 3 days

E 7,000 2 days

F 3,000 3 days

Length after crashing in days

 Path ‘n=0 1 2 3 4 5

A-B-D-E-F 48 47 46 45 44 43

A-B-C-D-E-F 55 54 53 52 51 50

A-C-D-E-F 44 43 42 41 40 39

Activity Crashed D D D F F

Cost 2,000 2,000 2,000 3,000 3,000

Solutions:

ACTIVITY EXPECTED TIME

A ( 7 + 4(8) + 15 ) / 6 = 9.00

B ( 10 + 4(11) + 12 ) / 6 = 11.00

C ( 5 + (4)7 + 9 ) / 6 = 7.00

D ( 11 + 4(14) + 17 ) / 6 = 14.00

E ( 5 + 4(7) + 9 ) / 6 = 7.00

F (5

Earliest Time 0
Forward
Earliest Finish 9+0=9

Latest Start 9–9=0

Backward
Latest Finish 9 (from the latest start of Activity B)

Slack 0 – 0 = 0 or 9 – 9 = 0

Critical Path Yes, since the slack is 0, Activity A is critical, and its
delay would delay the whole project.

ACTIVITY B

Forward Earliest Start 9 (from the Earliest Finish of Activity A)

 Earliest Finish 11 + 9 = 20

Latest Start 20 – 11 = 9
Backward
Latest Finish 20 (from the latest start of Activity C since it is lower)

Slack 9 – 9 = 0 or 20 – 20 = 0

ACTIVITY C

Earliest Start 20 (from the Earliest Finish of Activity B)

Forward
Earliest Finish 7 + 20 = 27

Latest Start 27 -7 = 20
Backward
Latest Finish 27 (from the latest start of Activity D)

Slack 20 – 20 = 0 or 27 – 27 = 0

Critical Path Yes, since the slack is 0, Activity C is critical, and its
delay would delay the whole project as well.

ACTIVITY D

Earliest Start 27 (from the Earliest Finish of Activity C)

Forward
Earliest Finish 14 + 27 = 41

Latest Start 41 – 14 = 27
Backward
Latest Finish 41 (from the latest start of Activity E)

Slack 27 – 27 = 0 or 41 – 41 = 0

Critical Path Yes, since the slack is 0, Activity D is critical, and its
delay would delay the whole project as well.

ACTIVITY E

Earliest Start 41 (from the Earliest Finish of Activity D)

Forward
Earliest Finish 7 + 41 = 48
 Latest Start 48 – 7 = 41
Backward
Latest Finish 48 (from the latest start of Activity F)

Slack 41 – 41 = 0 or 48 – 48 = 0

ACTIVITY F(end)

Earliest Start 48 (from the Earliest Finish of Activity E)

Forward
Earliest Finish 7 + 48 = 55

Latest Start 55 – 7 = 48
Backward
Latest Finish 55 (Since it is the last Activity)

Slack 48 – 48 = 0 or 55 – 55 = 0

Critical Path

ACTIVITY Normal Time Crash Time Available Time

A 9.00 6 3 Days

B 11.00 8 3 Days

C 7.00 4 3 Days

D 14.00 11 3 Days

E 7.00 5 2 Days

F 7.00 4 3 Days

Proof: