Project Scheduling Management Assignment 2 Sample: Critical Path, Crashing and Resource Levelling (Illustrative Network)
For information and reference only – not to be submitted as your own work.
This is an abridged model-answer extract for Project Scheduling Management Assignment 2, which covers critical paths and floats, crashing a project by five days against a €1,500-per-day benefit, resource levelling and a scheduling-risk memo. The full brief is on the live question page, and our guide to how to approach critical path, crashing and levelling questions explains what markers look for.
Important: the network below is illustrative. The original network and crash tables are not reproduced in the public brief, so we built a nine-activity network of our own to show the method. Every duration, cost and resource figure here is invented for teaching. Do not copy these numbers into your own work: use the data in your own brief and follow the same steps. All arithmetic was checked with a short critical path script.
Planning table
| Brief task | Method shown | Output |
|---|---|---|
| Q1(a) Critical path, total float, free float | Forward pass, backward pass, float calculation | Float table and critical path |
| Q1(b) Crash 5 days, benefit €1,500/day | Cheapest critical activity first, re-check for new critical paths each day | Crash table with net benefit |
| Q2 Resource levelling, limited resources | Priority by early start, then total float | Levelled schedule and loading profile |
| Q4 Scheduling-risk memo | Risk, assumptions, consequences, missing information | Short memo |
This extract covers Questions 1, 2 and 4 on the illustrative data. Question 3 follows the same approach with the activity table in your own brief.
Illustrative network data
| Activity | Normal duration (days) | Predecessors | Normal cost (€) | Crash duration (days) | Crash cost (€) | Crash cost per day (€) | Resource units (crew) |
|---|---|---|---|---|---|---|---|
| A | 3 | – | 6,000 | 2 | 6,800 | 800 | 4 |
| B | 5 | A | 10,000 | 4 | 10,900 | 900 | 3 |
| C | 6 | A | 12,000 | 4 | 13,700 | 850 | 4 |
| D | 7 | B | 14,000 | 5 | 16,200 | 1,100 | 5 |
| E | 4 | B, C | 8,000 | 3 | 8,500 | 500 | 3 |
| F | 5 | C | 9,000 | 4 | 9,400 | 400 | 3 |
| G | 6 | D, E | 11,000 | 5 | 13,200 | 2,200 | 4 |
| H | 4 | E, F | 7,000 | 3 | 7,900 | 900 | 2 |
| I | 3 | G, H | 5,000 | 2 | 6,100 | 1,100 | 3 |
Total normal direct cost is €82,000. Crash cost per day is (crash cost minus normal cost) divided by days saved, assuming cost rises in a straight line as duration falls (Kerzner, 2017; Lock, 2013).
Question 1(a): critical path and floats
Forward and backward pass
The critical path method itself dates from Kelley and Walker (1959). The forward pass sets each activity’s early start (ES) as the latest early finish (EF) of its predecessors, and EF = ES + duration. The backward pass starts from the project finish (day 24) and sets each late finish (LF) as the earliest late start (LS) of its successors, with LS = LF minus duration. Total float is LS minus ES. Free float is the earliest ES of the successors minus the activity’s EF (Lock, 2013; Heizer, Render and Munson, 2020). Times are in days from the project start.
| Activity | Duration | ES | EF | LS | LF | Total float | Free float | Critical? |
|---|---|---|---|---|---|---|---|---|
| A | 3 | 0 | 3 | 0 | 3 | 0 | 0 | Yes |
| B | 5 | 3 | 8 | 3 | 8 | 0 | 0 | Yes |
| C | 6 | 3 | 9 | 5 | 11 | 2 | 0 | No |
| D | 7 | 8 | 15 | 8 | 15 | 0 | 0 | Yes |
| E | 4 | 9 | 13 | 11 | 15 | 2 | 1 | No |
| F | 5 | 9 | 14 | 12 | 17 | 3 | 0 | No |
| G | 6 | 15 | 21 | 15 | 21 | 0 | 0 | Yes |
| H | 4 | 14 | 18 | 17 | 21 | 3 | 3 | No |
| I | 3 | 21 | 24 | 21 | 24 | 0 | 0 | Yes |
A worked example: E has predecessors B (EF 8) and C (EF 9), so ES = 9 and EF = 13. Its successors are G (LS 15) and H (LS 17), so LF = 15 and LS = 11, giving total float of 11 minus 9 = 2. The earliest successor start is H at 14, so free float is 14 minus 13 = 1. Free float cannot exceed total float, which is a useful check on your own table.
Critical path
The critical path is A – B – D – G – I, with a project duration of 24 days. Listing every path confirms it:
| Path | Length (days) |
|---|---|
| A – B – D – G – I | 24 (critical) |
| A – C – E – G – I | 22 |
| A – B – E – G – I | 21 |
| A – C – F – H – I | 21 |
| A – C – E – H – I | 20 |
| A – B – E – H – I | 19 |
The second-longest path, A – C – E – G – I, is only two days shorter. That matters for crashing, because a saving of more than two days on the critical path will make it critical too.
Question 1(b): crashing by five days
Method
Crashing means paying to shorten activities. The rule is to shorten only critical activities, choose the cheapest crash cost per day, and re-check the network after each day for new critical paths. When two paths become critical, the shorter must be shortened too, either through a shared activity or by crashing one activity on each path (Kerzner, 2017; Lock, 2013).
Crash table
| Day saved | Activity crashed (cost/day) | Project duration | Critical path(s) after the step | Cumulative crash cost (€) | Benefit at €1,500/day (€) | Net gain (€) |
|---|---|---|---|---|---|---|
| 1 | A (800) | 23 | A-B-D-G-I | 800 | 1,500 | 700 |
| 2 | B (900) | 22 | A-B-D-G-I | 1,700 | 3,000 | 1,300 |
| 3 | D (1,100) | 21 | A-B-D-G-I and A-C-E-G-I | 2,800 | 4,500 | 1,700 |
| 4 | I (1,100) | 20 | A-B-D-G-I and A-C-E-G-I | 3,900 | 6,000 | 2,100 |
| 5 | D + E (1,100 + 500 = 1,600) | 19 | A-B-D-G-I, A-C-E-G-I and A-C-F-H-I | 5,500 | 7,500 | 2,000 |
Notes on each step:
- Days 1 and 2. Only A – B – D – G – I is critical. A (€800) and B (€900) are the cheapest critical activities and each has one day available.
- Day 3. A and B are now fully crashed. D and I both cost €1,100. Crashing D takes the critical path to 21 days, level with A – C – E – G – I (2 + 6 + 4 + 6 + 3 = 21).
- Day 4. There are now two critical paths. Crashing D again would shorten only one, so the move must be on an activity both paths share: G (€2,200) or I (€1,100). I is cheaper, so both paths fall to 20 days.
- Day 5. A, B and I are fully crashed. The options are G alone (€2,200), D + C (€1,100 + €850 = €1,950) or D + E (€1,100 + €500 = €1,600). D + E is cheapest. After this step three paths are critical at 19 days, including A – C – F – H – I.
Comparison with the €1,500 per day benefit
The marginal cost of days 1 to 4 (€800, €900, €1,100, €1,100) is below €1,500, so each is worth buying. Day 5 costs €1,600, which is €100 more than the benefit it brings. The total net gain is €2,100 for four days and €2,000 for five.
Recommendation: crash four days (24 to 20 days) at a cost of €3,900, taking direct cost from €82,000 to €85,900. Crashing the fifth day would take direct cost to €87,500 and reduce the net gain by €100. This assumes the €1,500 benefit is the only saving; if indirect costs or penalties also fall by more than €100 for the fifth day, the answer would change. The recommendation also assumes crash costs are linear and that there is no loss of quality.
Question 2: resource levelling with a limited resource
Each activity in the illustrative data needs a number of crew units. The brief’s own task uses two resources (M and L); this extract shows the method with one resource and a limit of 8 units, using normal durations.
Loading before levelling
If every activity starts at its early start, the crew units peak at 11 in days 9 to 13, above the limit of 8. Total demand is 154 unit-days (the sum of units times duration for all activities).
| Period (days) | Activities running | Units (early-start schedule) |
|---|---|---|
| 0–3 | A | 4 |
| 3–8 | B, C | 7 |
| 8–9 | C, D | 9 |
| 9–13 | D, E, F | 11 |
| 13–14 | D, F | 8 |
| 14–15 | D, H | 7 |
| 15–18 | G, H | 6 |
| 18–21 | G | 4 |
| 21–24 | I | 3 |
Levelling rules
Work through time. At each day, start eligible activities (all predecessors finished) in priority order: lowest early start first, then lowest total float, and start an activity only if the units in use plus its own units stay within 8. Activities already in progress are not interrupted (Lock, 2013; Kerzner, 2017).
- Day 8. D is eligible (ES 8, float 0), but C (4 units) is still running and 4 + 5 = 9 is over the limit. D waits until C finishes at day 9.
- Day 9. D (5) and E (3) start, using exactly 8 units. F (ES 9, float 3) must wait.
- Day 13. E finishes, so F starts (D 5 + F 3 = 8).
- Day 16. D finishes and G starts; F is still running (4 + 3 = 7). H waits because H, G and F together would need 9 units.
- Day 18. F finishes and H starts (G 4 + H 2 = 6). I starts on day 22 after G and H.
| Activity | Units | Early start–finish | Levelled start–finish | Delay (days) |
|---|---|---|---|---|
| A | 4 | 0–3 | 0–3 | 0 |
| B | 3 | 3–8 | 3–8 | 0 |
| C | 4 | 3–9 | 3–9 | 0 |
| D | 5 | 8–15 | 9–16 | 1 |
| E | 3 | 9–13 | 9–13 | 0 |
| F | 3 | 9–14 | 13–18 | 4 |
| G | 4 | 15–21 | 16–22 | 1 |
| H | 2 | 14–18 | 18–22 | 4 |
| I | 3 | 21–24 | 22–25 | 1 |
| Period (days) | Activities running | Units (levelled schedule) |
|---|---|---|
| 0–3 | A | 4 |
| 3–8 | B, C | 7 |
| 8–9 | C | 4 |
| 9–13 | D, E | 8 |
| 13–16 | D, F | 8 |
| 16–18 | F, G | 7 |
| 18–22 | G, H | 6 |
| 22–25 | I | 3 |
The peak falls from 11 to 8 and total demand is still 154 unit-days. The levelled project takes 25 days, one more than the unconstrained 24. The resource-constrained critical path is A – C – D – G – I, where C is followed by D because the crew cannot do both at once, not because of a logical dependency.
Implications and options
The resource limit costs one day, which is €1,500 of benefit if the daily benefit applies. It also means the crash plan in Question 1 may not deliver as shown, because crashing usually needs extra crew at the same time. Options for the project manager:
- Raise the limit. Running the same method with 9 or 10 units still gives 25 days, because F and H are held back by the crew limit later in the project. A limit of 11 restores 24 days. A temporary increase to 11 units, needed in days 9 to 13, therefore recovers the day.
- Use float. B has one day of resource-driven slack (it finishes at day 8 but D cannot start until 9). Spare crew on days 8 to 9 could be redeployed.
- Accept the day. If the €1,500 daily benefit is the only cost of delay, extra crew is worth buying only if it costs less than €1,500 for the day recovered.
In a real assignment, state the target (for example a 35-day completion date), compare the levelled duration to it, and show which option closes the gap at what cost.
Question 4: scheduling-risk memo (illustrative data)
To: Project Sponsor
From: Project Scheduler
Subject: Schedule risk and crashing recommendation (illustrative network)
Recommendation. Crash the project by four days, from 24 to 20, at an extra direct cost of €3,900. The benefit is 4 x €1,500 = €6,000, a net gain of €2,100. Do not buy the fifth day: its cheapest cost is €1,600 (activities D and E), which is €100 more than the benefit, so the net gain falls to €2,000.
Greatest scheduling risk. After crashing, the critical path A-B-D-G-I and the parallel path A-C-E-G-I both run at 20 days, and A-C-F-H-I sits at 19. Any slip in A, G or I delays the project day for day, and a slip in C, D or E now hits two near-critical paths at once.
Assumptions with most influence.
- Crash cost is linear and each crashed day delivers a full day saved.
- Durations are fixed, with no variability.
- The €1,500 daily benefit applies to every day saved.
- Eight crew units are available throughout.
If these fail. With the crew limit the project runs 25 days, not 24, so the saving starts from a worse base. Variability in D or G would erase some of the gain.
Information needed. Optimistic and pessimistic durations for each activity, confirmed crew availability by week, any contract penalties, and whether the €1,500 benefit continues after the planned finish.
Next step. Overall the plan is sound but fragile. Agree the four-day crash now, then re-test the network with duration ranges before work starts.
Where to go next
If you need help turning your own network into clear tables and a defensible recommendation, our university assignment help page explains how support works, and report writing help covers memos and structured write-ups. For a related operations brief, see the Pizzamatic forecasting and scheduling question. When your own brief is ready, submit it for a free quote.
References
Heizer, J., Render, B., & Munson, C. (2020). Operations management: Sustainability and supply chain management (13th ed.). Pearson.
Kelley, J. E., Jr., & Walker, M. R. (1959). Critical-path planning and scheduling. Proceedings of the Eastern Joint Computer Conference, 160–173.
Kerzner, H. (2017). Project management: A systems approach to planning, scheduling, and controlling (12th ed.). Wiley.
Lock, D. (2013). Project management (10th ed.). Gower.

Prepared by
Ireland Assignment Helper Editorial Team
This model answer was prepared by our editorial team in response to a real assignment brief we received. It shows one way to approach the task and is meant as a study guide, not for submission.