Critical path analysis
D1 Topic 4, spec point by spec point (Critical path analysis). Each spec point has the method, worked examples written the way the mark scheme wants them, how the marks go and the mistakes that cost the most marks.
Spec4.1Activity networks from a precedence table
Modelling a project by an activity network from a precedence table. Activity on arc is used, including dummies. Precedence tables show only immediate predecessors.
Activity on arc
- Each activity is an arc (an arrow), labelled with its letter and duration.
- Each node is an event: the moment when all activities into it are finished and those out of it can start.
- There is one start event and one finish event.
Dummies
A dummy is a dashed arc with duration 0. It carries a dependency but takes no time. You need one in two situations:
- Shared predecessors that aren't identical. If D depends on A and B but C depends only on A, then C can start at the end of A, and a dummy from the end of A to the end of B lets D wait for both.
- Uniqueness. Two activities can't share both the same start event and the same end event (each activity must be identified by its pair of events). Add a dummy so they end at different events.
Use the minimum number of dummies the question asks for. Don't add one where an activity could simply start from an existing event.
Drawing a network: a routine
- Activities with no predecessors start from the start event.
- For each activity in turn, find the event where all its predecessors (and only those) have finished. If no such event exists, create one with dummies.
- Join everything that has no successor to the finish event.
- Check every row of the table against the drawing.
where dummies are needed
| Activity | Depends on | Duration |
|---|---|---|
| A | – | 5 |
| B | – | 3 |
| C | A | 4 |
| D | A, B | 6 |
| E | C | 3 |
| F | C, D | 5 |
| G | E, F | 2 |
Events: A from 0 to 1, B from 0 to 2, dummy from 1 to 2 (D needs A and B; C needs only A).
C from 1 to 3, D from 2 to 4, dummy from 3 to 4 (F needs C and D; E needs only C).
E from 3 to 5, F from 4 to 5, G from 5 to 6 (finish). Two dummies.
- M1 for most activities on arcs with one start and at least the right number of dummies; A1 A1 A1 for groups of activities correct; A1 cso with arrows, one finish and the dummies in the right places (WDM11A Jan 2026 Q4, WDM11 Jun 2021 Q6a).
Often asked as: draw the network (usually 5 marks) using the minimum number of dummies; explain why a particular dummy is needed.
Missing arrows, or more than one finish event.
Dummies pointing the wrong way (the dependency flows along the arrow).
Spec4.2Completing a precedence table from a network
Completion of the precedence table for a given activity network.
The idea
This is 4.1 in reverse. An activity's immediate predecessors are all the activities that arrive at its start event, including those that arrive through dummies (follow each dummy back to the activity at its tail).
Method
- For each activity, look at the event it starts from.
- List every activity arriving there.
- For each dummy arriving there, go back along it and list what arrives at its start (and keep following any further dummies).
reading through dummies
In the network from 4.1: D starts at event 2. Arriving at event 2: B, and a dummy from event 1, where A arrives. So D depends on A and B.
F starts at event 4: D arrives, and a dummy from event 3, where C arrives. So F depends on C and D.
E starts at event 3: only C arrives. E depends on C.
- B1 for some rows correct, B1, B1 for the rest, in groups (WDM11 Jan 2026 Q7a, WDM11 Jun 2025 Q7a).
- Dummies must be read through (WDM11 Oct 2021 Q4a).
Often asked as: a 2–3 mark start to a critical path question.
Listing only the activities directly attached, ignoring what comes through a dummy.
Listing all earlier activities rather than just the immediate ones.
Spec4.3The critical path
The algorithm for finding the critical path; earliest and latest event times; earliest and latest start and finish times for activities.
Forward pass: early event times
Write each event's early time (top box). Start with 0. Moving along the arrows:
\[\text{early time of an event} = \max(\text{early time at tail} + \text{duration}) \text{ over all arcs into it}\]
Take the largest because everything arriving must be finished. The early time of the finish event is the minimum project duration.
Backward pass: late event times
Write each event's late time (bottom box). The finish event's late time equals its early time. Moving against the arrows:
\[\text{late time of an event} = \min(\text{late time at head} - \text{duration}) \text{ over all arcs out of it}\]
Take the smallest so that no later activity is delayed.
Critical activities
An activity from event \(i\) to event \(j\) is critical if
- the early and late times are equal at both ends, and
- \(\text{late}_j - \text{early}_i = \text{duration}\).
(The second check matters: equal times at both ends isn't always enough.) A critical path is a route of critical activities from start to finish. Delaying any critical activity delays the whole project.
For an activity: earliest start \(= \text{early}_i\); latest finish \(= \text{late}_j\); earliest finish \(=\) earliest start \(+\) duration; latest start \(=\) latest finish \(-\) duration.
event times and the critical path
The project in 4.1:
| Event | 0 | 1 | 2 | 3 | 4 | 5 | 6 |
|---|---|---|---|---|---|---|---|
| Early | 0 | 5 | 5 | 9 | 11 | 16 | 18 |
| Late | 0 | 5 | 5 | 11 | 11 | 16 | 18 |
Event 2: \(\max(0 + 3, 5 + 0) = 5\). Event 4: \(\max(5 + 6, 9 + 0) = 11\). Event 5: \(\max(9 + 3, 11 + 5) = 16\).
Event 3 late: \(\min(16 - 3, 11 - 0) = 11\). Event 1 late: \(\min(11 - 4, 5 - 0) = 5\).
Critical path: A, D, F, G (through the first dummy). Minimum duration 18.
- M1 all top boxes complete and generally increasing along the arrows (one rogue value allowed), A1 all correct; M1 all bottom boxes complete and generally decreasing, A1 all correct (WDM11A Jan 2026 Q6a, WDM11 Jun 2025 Q7b).
- A change to one duration: find the new time and critical path (WDM11 Oct 2021 Q4e).
- Missing values from given floats: form an equation from float = late − early − duration (WDM11 Jun 2022 Q2a).
Often asked as: very common (48 questions). Event times in the answer book's boxes; list the critical activities; effect of a delay.
Taking the minimum on the forward pass or the maximum on the backward pass.
Ignoring dummies when computing times (they count, with duration 0).
Spec4.4Float, Gantt charts and scheduling
Total float, Gantt (cascade) charts and scheduling.
Total float
\[\text{total float of activity } (i, j) = \text{late}_j - \text{early}_i - \text{duration}\]
It's how long the activity can be delayed (or extended) without delaying the project. Critical activities have zero float.
Gantt (cascade) charts
A time axis across the top. Each activity is a bar starting at its earliest start time with length equal to its duration; its float is shown as a dotted box after the bar. Critical activities are usually drawn on one row. Reading down a vertical line at time \(t\) shows which activities must or might be happening at that time.
Scheduling workers
- Lower bound for the number of workers (to finish in the minimum time):
\[\left\lceil \frac{\text{sum of all durations}}{\text{critical (minimum) project time}} \right\rceil\]
- Assign each worker the next available activity (in order of earliest start, and within float); a worker must not start an activity before all its predecessors finish.
- From a Gantt chart: if at some time several activities must be happening (their bars overlap with no float to move), that number is also a lower bound.
floats and a schedule
The project in 4.1 (minimum time 18).
Floats: B: \(5 - 0 - 3 = 2\). C: \(11 - 5 - 4 = 2\). E: \(16 - 9 - 3 = 4\). A, D, F, G: 0.
Lower bound for workers: \(\frac{5 + 3 + 4 + 6 + 3 + 5 + 2}{18} = \frac{28}{18} = 1.6\), so 2.
A schedule with 2 workers: Worker 1: A (0–5), D (5–11), F (11–16), G (16–18). Worker 2: B (0–3), C (5–9), E (9–12). Every activity starts after its predecessors, and the project ends at 18.
- Float: B1ft for late − early − duration with all three numbers shown (the answer alone is B0) (WDM11 Jun 2023 Q1b).
- Lower bound: M1 for the sum of durations ÷ the critical time, A1 for the rounded-up value with no wrong working; a bare answer is M0 (WDM11A Jan 2026 Q6c).
- From a Gantt chart: name the number of workers, the activities that must be happening, and a specific time (e.g. "at time 12.5, D, E, F, G and H must all be happening, so 5 workers are needed") (WDM11 Jan 2025 Q7e+f).
Often asked as: very common (39 questions). Floats; draw a cascade chart; lower bound for workers; a schedule on a grid; can it be done with fewer workers?
Float as late start − early start of the events without subtracting the duration.
Rounding the worker lower bound down.