The following table shows, for each activity of a big project, the normal and crash times as also the normal and crash costs. The contract includes a penalty clause of ₹ 200 per day in excess of 20 days. The overhead cost is ₹ 400 per day :
Activity | Time (in day) Normal | Time (in day) Crash | Cost (in ₹) Normal | Cost (in ₹) Crash
1–2 | 6 | 4 | 600 | 1,000
1–3 | 4 | 2 | 600 | 1,400
2–4 | 5 | 3 | 500 | 1,500
2–5 | 3 | 1 | 450 | 650
3–4 | 8 | 6 | 1,000 | 2,200
4–6 | 10 | 6 | 800 | 3,000
5–6 | 4 | 2 | 400 | 1,000
6–7 | 4 | 3 | 450 | 800
(i) Draw a project network and determine critical path.
(ii) Find the cost of completing the project in normal time.
(iii) Crash the project activities and determine the cost of completing the project in minimum time.
(iv) What is the optimal duration of the project and what is the cost involved?
20 marks · directive: Calculate
The core of a good answer
The critical path is 1-3-4-6-7 (26 days) and the normal-time cost is ₹16,400; crashing to the minimum duration of 17 days costs ₹17,050, while the optimal (least-cost) duration is 20 days at a total cost of ₹15,750.
An outline written by upsc.help, not an official UPSC answer; every fact checked by a separate review. How we work
What the question asks
A time-cost trade-off (CPM crashing) problem: find paths and the critical path, total cost = direct cost + overhead (₹400 a day) + penalty (₹200 a day beyond 20), then crash critical activities in order of the lowest cost slope as long as the extra direct cost is less than the indirect saving.
Answer outline
Introduction
Given: eight activities on nodes 1 to 7; normal direct cost = 600 + 600 + 500 + 450 + 1,000 + 800 + 400 + 450 = ₹4,800. Indirect cost per day = ₹400 overhead plus ₹200 penalty for each day above 20, so ₹600 a day saved above 20 days and ₹400 a day at or below 20.
Step 1: Network and critical path (i)
- Network: 1 → 2 → 4, 1 → 3 → 4, 2 → 5 → 6, 4 → 6 → 7.
- Paths: 1-2-4-6-7 = 6 + 5 + 10 + 4 = 25; 1-3-4-6-7 = 4 + 8 + 10 + 4 = 26; 1-2-5-6-7 = 6 + 3 + 4 + 4 = 17.
- Critical path 1-3-4-6-7, normal duration 26 days.
Step 2: Normal cost (ii)
- Direct ₹4,800 + overhead 26 × 400 = ₹10,400 + penalty (26 - 20) × 200 = ₹1,200.
- Total = ₹16,400.
Step 3: Cost slopes = (crash cost - normal cost) / (normal time - crash time)
- 1-2: 400/2 = 200; 1-3: 800/2 = 400; 2-4: 1,000/2 = 500; 2-5: 200/2 = 100.
- 3-4: 1,200/2 = 600; 4-6: 2,200/4 = 550; 5-6: 600/2 = 300; 6-7: 350/1 = 350.
Step 4: Crashing in stages
- 26 → 25: crash 6-7 by 1 day (slope 350, on all paths): direct 5,150; total 5,150 + 10,000 + 1,000 = ₹16,150.
- 25 → 24: crash 1-3 by 1 day (400): direct 5,550; total 5,550 + 9,600 + 800 = ₹15,950. Paths 1-2-4-6-7 and 1-3-4-6-7 are now both critical at 24.
- 24 → 20: crash 4-6 by 4 days (550 a day, common to both critical paths; cheaper than 1-2 + 1-3 at 600): direct 7,750; total 7,750 + 8,000 + 0 = ₹15,750.
- 20 → 19: cheapest joint option 1-2 + 1-3 = 200 + 400 = 600 a day: direct 8,350; total ₹15,950.
- 19 → 18: 1-2 + 3-4 = 200 + 600 = 800: direct 9,150; total ₹16,350.
- 18 → 17: 2-4 + 3-4 = 500 + 600 = 1,100: direct 10,250; total ₹17,050. Path 1-3-4-6-7 is now fully crashed (2 + 6 + 6 + 3 = 17), so 17 days is the minimum.
Step 5: Minimum time cost (iii) and optimum (iv)
- Minimum duration 17 days: direct ₹10,250 + overhead ₹6,800 = ₹17,050 (crashing every activity fully would cost ₹11,550 direct, ₹18,350 in all, with no time gain).
- Total cost falls until 20 days and rises after, so the optimal duration is 20 days at ₹15,750.
Conclusion
Optimal duration 20 days, minimum total cost ₹15,750 (crash 6-7 by 1, 1-3 by 1 and 4-6 by 4 days); minimum duration 17 days at ₹17,050; normal 26 days at ₹16,400. Check: an exhaustive search over all integer crash combinations in Python gave the same least cost for every duration from 17 to 26 days.
Examples and data to cite
- Duration and total cost table: 26 days ₹16,400; 25 ₹16,150; 24 ₹15,950; 23 ₹15,900; 22 ₹15,850; 21 ₹15,800; 20 ₹15,750; 19 ₹15,950; 18 ₹16,350; 17 ₹17,050.
Facts to remember
- Cost slope = (crash cost - normal cost) / (normal time - crash time).
- Crash only critical activities, cheapest slope first; when several paths are critical, shorten all of them together.
- Stop crashing when the added direct cost per day exceeds the indirect cost saved per day.
- Total project cost = direct cost + indirect cost (overheads, penalties); the optimum is the minimum of the total cost curve.
- CPM was developed in the late 1950s by Morgan R. Walker of DuPont and James E. Kelley Jr. of Remington Rand.