Activity networks and critical paths

Activity networks and critical paths

Spec DE1–DE4 · AQA A-Level Further Maths: Revision notes

Studying this course? Keep your progress in one place.

Key facts

  • An activity-on-node network shows each activity as a node, with arrows from its immediate predecessors.
  • Forward pass: EFT = EST + duration; EST is the maximum of the predecessors' EFTs.
  • Backward pass: LST = LFT −- duration; LFT is the minimum of the successors' LSTs.
  • Float = LFT −- EST −- duration; critical activities have float 0.
  • A critical path has length equal to the minimum completion time.

Activity networks

Each activity is a node, with an arrow from every immediate predecessor to it, so an activity starts only when all its predecessors finish.

A critical path analysis models a project as activities, each with a duration and immediate predecessors: the activities that must finish before it can start.

In an activity-on-node network an arrow from PP to QQ means PP must finish before QQ can start. Activities with no predecessor start at time 0.

To construct a network, list each activity once and join it from each of its immediate predecessors. If EE depends on BB and CC, there are arrows from BB and from CC into EE.

ABCDE
A and B start; C follows A; D follows A and B; E follows C and D.

In an activity-on-node network, what does an arrow from PP to QQ mean?

The forward pass

Work from the start: EFT is EST plus duration, and EST is the largest EFT of the predecessors.

The forward pass finds the earliest start time (EST) and earliest finish time (EFT) of every activity.

EST is 0 for activities with no predecessor. For any other activity the EST is the maximum of the EFTs of its immediate predecessors, because it must wait for the last one.

The minimum completion time of the project is the largest EFT.

Example: FF has predecessors CC (earliest finish 7) and DD (earliest finish 11), so FF starts at max⁡(7,11)=11\max(7,11)=11.

A: 0-3B: 0-2C: 3-7D: 3-8E: 8-11
Forward pass for A 3, B 2, C 4, D 5, E 3: each node shows EST to EFT.
  • EFTEST + duration
  • ESTmaximum of the predecessors' EFTs

FF has duration 3 and predecessors CC (earliest finish 7) and DD (earliest finish 11). What is the EFT of FF?

The backward pass and float

Work back from the completion time: LFT is the smallest LST of the successors, and float shows the room to delay.

The backward pass starts at the minimum completion time. For the last activities LFT (latest finish time) is the completion time. For any other activity, the LFT is the minimum of the latest start times of its immediate successors.

The float of an activity is the time it can be delayed without delaying the project, equivalently LST −- EST. An activity with float 0 is critical.

A: 0-3B: 1-3C: 4-8D: 3-8E: 8-11
Backward pass: each node shows LST to LFT. C has float 1 and B has float 1.
  • LFTminimum of the successors' LST
  • LSTLFT −- duration
  • FloatLFT −- EST −- duration

An activity has duration 4. Its successors have latest start times 12 and 9. What are its LFT and LST?

Critical activities and paths

Critical activities have zero float, and a critical path is a chain of them with length equal to the minimum completion time.

A critical activity has zero float: any delay in it delays the whole project. A critical path runs from start to end through critical activities.

A project may have more than one critical path. Non-critical activities have positive float.

criticalcriticalA (float 0)B (float 1)C (float 1)D (float 0)E (float 0)
The critical path A, D, E (float 0, total 11 days); B and C have float 1.

Critical, float 0

  • A (0 to 3)
  • D (3 to 8)
  • E (8 to 11)

Not critical

  • B, float 1
  • C, float 1

Worked example

AA 3 (no predecessor), BB 2 (none), CC 4 (AA), DD 5 (AA, BB), EE 3 (CC, DD). Find the critical path and the floats.

An activity has EST 5, duration 3 and LFT 12. What is its float?

Refining the model

A delay to a critical activity delays the project, and shortening an activity helps only if it is on every critical path.

Real projects change, so the model is refined.

  • A delay to a critical activity delays the project by the same amount.
  • A delay to a non-critical activity delays the project only by the amount it exceeds the float.
  • Shortening an activity helps only if it lies on every critical path, and only until another path becomes critical.

If two critical paths each take 22 days, shortening an activity on one of them saves nothing, but shortening one common to both saves time. After any change, recalculate and describe the effect in context.

Path 1: 22 daysPath 2: 22 daysA (10)B (12)C (11)D (11)
Illustrative: two critical paths of 22 days. Shortening A alone saves nothing because C then D still takes 22 days.

Critical activity delayed

  • Project delayed by the same amount

Non-critical delayed

  • Project delayed only by the amount above the float

Activity shortened

  • Saves time only if on every critical path

Two critical paths each take 22 days. An activity on only one of them is shortened by 2 days. What is the new minimum completion time?

Try an exam question

A project has activities PP 4 days (no predecessor), QQ 6 days (none), RR 3 days (PP), SS 5 days (PP, QQ) and TT 2 days (RR, SS). Find the minimum completion time and the critical path.

[4 marks]

That's the notes covered.

Carry on to the next subtopic.

Try a question

What is the earliest start time of activity FF?

1 mark, marked against the mark scheme

Revision notes