PRE 833 – PROJECT PLANNING

AND CONTROL

Assignment

Valentine Obomhele Sule

PGENG 8600402

A project is to be expedited based on the following CPM network data

 Activity Predecessor Normal Crash Time Normal Crash Cost
Time (days) (days) Cost
A - 4 2 1,000 1,500
B - 6 2 800 1,400
C - 2 1 400 600
D A 3 1 600 900
E A 5 3 800 1,400
F C 4 1 800 1,000
G B,D 6 2 1,000 1,600

i. Draw the network diagram and calculate the normal project duration.
ii. Using a step by step crashing algorithm reduce the project duration from normal
condition to fully crashed condition and tabulate the total cost and activities involved at
each stage of the project time reduction.
Solution
i.

A (4 days) E (5 days)
D (3 days)
B (6 days) G (6 days)

C (2 days) F (4 days)

The various paths are isolated and the duration indicated to confirm the total duration.
 A – E : 4 + 5 = 9 days

 A – D – G : 4 + 3 + 6 = 13 days
 B – G : 6 + 6 = 12 days

 C – F : 2 + 4 = 6 days
We need to establish the critical path duration as this indicates the normal project
duration.
 The critical path is A – D – G and the duration is 13 days.
Hence the normal project duration is 13 days

Activity Predecessor Normal time Crash time Cost slope

A* – 4 2 250
B – 6 2 150
C – 2 1 200
D* A 3 1 150
E A 5 3 300
F C 4 1 200/3
G* B, D 6 2 150

Iteration Activity Crash Project Group Added Total New

By Duration Marginal Cost Cost Critical
Cost Path
0 – – 13 – – – A–D–G
1 G 1 12 150 150 300 A–D–G
2 G 1 11 150 150 450 A–D–G
3 G 1 10 150 150 600 A–D–G
4 G 1 9 150 150 750 A–D–G
A–E
5 A 1 8 250 250 1,000 A–D–G
A–E
B–G
6 B 1 7 150 150 1,150 A–E
7 A,B 1 6 400 400 1,550 A–E
A–D–G
B–G
8 E, D, B, 1 5 666.67 666.67 2,216.67 A–E
F A–D–G
B–G
C–F

We select activity G over A and D for crashing because it has the lowest cost slope and the
highest number of days it can be crashed.
Iteration 0
Path Duration
A–E 9
A–D–G 13
B–G 12
C–F 6
 Iteration 1
Path Duration
A–E 9
A–D–G 12
B–G 11
C–F 6

Iteration 2
Path Duration
A–E 9
A–D–G 11
B–G 10
C–F 6

Iteration 3
Path Duration
A–E 9
A–D–G 10
B–G 9
C–F 6

Iteration 4
Path Duration
A–E 9
A–D–G 9
B–G 8
C–F 6

Now there are two critical paths. To finish the project earlier, we would need to shorten
both paths. Crashing A, A – D, E – A or E – D does this, since those two activities are on
both paths.

Cost to crash A 250

Cost to crash A – D 250 + 150 = 400
Cost to crash E – A 300 + 250 = 550
Cost to crash E – D 300 + 150 = 450
 Iteration 4
Path Duration
A–E 8
A–D–G 8
B–G 8
C–F 6

Now there is one critical path B – G. To finish the project earlier, we would need to
shorten this paths.

Cost to crash B 150

Iteration 5
Path Duration
A–E 7
A–D–G 7
B–G 8
C–F 6

We now have three critical paths: A – E, A – D – G and B – G.

Iteration 6
Path Duration
A–E 7
A–D–G 7
B–G 7
C–F 6

Cost to crash A – B 250 + 150 = 400

Cost to crash A – D – B 250 + 150 + 150 = 550
Cost to crash E – A – B 300 + 250 + 150 = 700
 Cost to crash E – D – B 300 + 150 + 150 = 600

Iteration 7
Path Duration
A–E 6
A–D–G 6
B–G 6
C–F 6

Cost to crash E – D – B – C 300 + 150 + 150 + 200 = 800

Cost to crash E – D – B – F 300 + 150 + 150 + 200/3 = 666.67

The maximum Crash Time for this project is 5 days

The Total Cost to crash Project from 13 days to 8 days is N2,216.67