
Project Programming & the Critical Path Method
Activities, events, dummies — and the forward and backward pass.
Replace the bar chart with a network that carries logic. Learn its elements — the activity, the event, and the zero-duration dummy that shows dependency without consuming time; the rules of construction and Fulkerson's numbering; AOA vs AON and the WBS behind them; and the heart of the course — CPM time analysis. Run the forward and backward pass, compute total, free and independent float, and find the critical path. Try the live CPM network explorer.
Learning objectives
By the end of this lesson, you will be able to — mapped to the course outcomes for Project Management:
Identify network elements — activity, event, dummy — and the rules of network logic.
Number events by Fulkerson's rule and build AOA / AON networks from a WBS.
Run the forward and backward pass to find earliest and latest times.
Compute total, free and independent float and identify the critical path.
The network and its rules
An activity consumes time, an event marks an instant, and a dummy carries logic alone — drawn under rules (one start, one end, no loops) that make the diagram an honest map of what must precede what.[1]
The three elements
In an AOA (activity-on-arrow) network an ACTIVITY is a time- and resource-consuming task, drawn as an ARROW; an EVENT (node) is an instantaneous point in time — the start or finish of activities — drawn as a CIRCLE, consuming no time. A DUMMY is a dotted, ZERO-duration, ZERO-resource arrow used only to show a logical dependency or to keep two parallel activities uniquely identified. MISCONCEPTION→correct: 'a dummy activity consumes time or resources' — it does not; it carries logic alone.[1]
CPM time analysis
The forward pass finds earliest times, the backward pass the latest; the difference is float — total, free and independent — and zero float marks the critical path.[1, 3]
Earliest times
The FORWARD PASS finds how early things can happen. Start at time 0: an activity's EARLIEST START (EST) = the latest EARLIEST FINISH of its predecessors; its EARLIEST FINISH (EFT) = EST + duration. Carry the maxima forward through the network; the largest EFT at the end event is the PROJECT DURATION. In the worked example the forward pass gives a 20-day project.[1]
The worked network
A seven-activity build gives a 20-day project with the critical path B → D → F → G; A, C and E carry float and can slip without delaying handover.
Compute the critical path
Edit each activity's duration; the explorer reruns the forward and backward pass, lists every activity's float, and re-traces the critical path live. Stretch a floating activity past its float and watch the critical path shift.
CPM network · edit the durations
Dependencies are fixed (A,B → … → G); only durations change.
| Act | EST | EFT | LST | LFT | TF |
|---|---|---|---|---|---|
| A | 0 | 4 | 2 | 6 | 2 |
| B | 0 | 6 | 0 | 6 | 0 |
| C | 4 | 7 | 11 | 14 | 7 |
| D | 6 | 11 | 6 | 11 | 0 |
| E | 7 | 11 | 14 | 18 | 7 |
| F | 11 | 18 | 11 | 18 | 0 |
| G | 18 | 20 | 18 | 20 | 0 |
Activities with TF = 0 (orange) are critical. Stretch a floating activity and watch the critical path shift.
At a glance
| Aspect | AOA | AON |
|---|---|---|
| Activity shown as | AOA: an arrow | AON: a node / box |
| Dummies needed? | AOA: yes (for logic/identity) | AON: no |
| Events / nodes | AOA: numbered circles (Fulkerson) | AON: the activity boxes themselves |
| Used by | AOA: classic hand methods | AON: MS Project, Primavera (PDM) |
| Float = 0 means | Both: critical activity | On the critical path |
Key terms
A time-consuming task (arrow in AOA) / an instant in time (node).
A zero-duration, zero-resource arrow that only shows a logical dependency.
Event-numbering so every arrow runs from a lower to a higher number.
Computes earliest (EST/EFT) and latest (LST/LFT) times.
LFT − EST − duration: slack before the PROJECT end is affected.
The continuous zero-float, longest path fixing the project duration.
Studio task
For the seven-activity network in this lesson (A 4, B 6, C 3, D 5, E 4, F 7, G 2; C after A, D after A and B, E after C, F after D, G after E and F), compute EST, EFT, LST and LFT for every activity by hand, then the total float of each. State the critical path and the project duration, and confirm your answer against the explorer. Which activity has the largest float, and is it free or interfering?
Self-assessment
1. A dummy activity in an AOA network —
2. Total float of an activity is —
3. The critical path is —
Recap
References & further reading
- [1]B.C. Punmia & K.K. Khandelwal, Project Planning and Control with PERT and CPM — networks, Fulkerson's rule, floats, critical path.
- [2]PMI, PMBOK Guide & Practice Standard for Scheduling — WBS, precedence diagramming (AON/PDM).
- [3]J.D. Wiest & F.K. Levy, A Management Guide to PERT/CPM — critical-path computation and interpretation.
- [4]K.K. Chitkara, Construction Project Management — network analysis in Indian construction practice.
Further reading
- B.C. Punmia & K.K. Khandelwal — Project Planning and Control with PERT and CPM.
- J.D. Wiest & F.K. Levy — A Management Guide to PERT/CPM.
- K.K. Chitkara — Construction Project Management.
Sources gathered and fact-checked June 2026. Published values vary by source, sample and method — treat as indicative and confirm against the cited standard before structural use.
