Identifying the Critical Path
The longest chain through the network is the one that matters: the critical path sets the shortest possible finish, and every activity on it has zero float. Forward and backward passes, total vs free float, and what quietly distorts it. Built on AACE 49R-06.
What the critical path is
It sounds backwards that the longest path gives the shortest possible duration — but that's exactly it: you can't finish until the longest chain of must-happen-in-order work is done. Every other path is shorter and therefore has slack. The critical path is the project's binding constraint on time.
The forward and backward pass
The CPM finds the critical path with two sweeps through the network. You don't have to do this by hand — the software does — but understanding it is what separates a planner from a button-pusher.
- Forward pass → work left to right. Compute each activity's Early Start (ES) and Early Finish (EF) — the soonest it can happen. EF = ES + duration; the next activity's ES is the latest EF of its predecessors. The largest EF at the end = the project duration.
- ← Backward pass work right to left from the end date. Compute each activity's Late Finish (LF) and Late Start (LS) — the latest it can happen without delaying the project. LS = LF − duration.
Float — the difference between paths
Off the critical path, activities have float (slack): time they can slip before causing a problem. Two kinds matter:
| Float type | How much an activity can slip before… |
|---|---|
| Total float | …delaying the project finish. (LS − ES.) Zero on the critical path. |
| Free float | …delaying the next activity's early start. Always ≤ total float. |
Find the critical path
Critical path
Try it yourselfPath A = A1 + A2, Path B = B1 + B2. The longer path is critical and sets the project duration; the shorter carries float. Drag the durations and watch the critical path switch.
What distorts the critical path
The CPM only finds the true critical path if the network is honest. Several things quietly corrupt it:
- Constraints — hard date constraints override the calculated path and can hide the real critical chain.
- Open ends — missing predecessors/successors break float calculations, so criticality is wrong.
- Excessive lags — long lags can sit on the critical path as invisible, unmanageable "work."
- Multiple calendars — mixing calendars can make float values look odd; understand why before trusting them.
Ten things to remember
- The critical path is the longest chain — and its length is the shortest possible project duration.
- Delay anything on it and the finish slips — everything else has slack.
- Forward pass gives Early Start/Finish; backward pass gives Late Start/Finish.
- Total Float = LS − ES = LF − EF — zero float marks the critical path.
- Total float = slack before the project slips; free float = before the next activity slips.
- "Critical" means zero float — not important or expensive.
- The critical path can move — re-check it after any duration or logic change.
- Constraints, open ends, big lags, and mixed calendars distort it — keep the network clean.
- Watch near-critical paths too — a small slip turns them critical.
- The critical path is the spine of delay analysis — Track 6 lives or dies on it.
Glossary
- Backward pass
- Right-to-left calculation of Late Start / Late Finish.
- CPM
- Critical Path Method — the technique that computes dates, float, and the critical path.
- Critical path
- The longest path through the network; sets the shortest project duration.
- ES/EF/LS/LF
- Early/Late Start and Finish dates from the two passes.
- Forward pass
- Left-to-right calculation of Early Start / Early Finish.
- Free float
- Time an activity can slip without delaying its successor's early start.
- Near-critical path
- A path with little float — close to becoming critical.
- Total float
- Time an activity can slip without delaying project finish (LS − ES).