Critical path analysis maps out every task in a project along with its dependencies to find the longest chain of dependent tasks — the sequence that determines the earliest possible finish date.
The idea
Not every task in a project is equally urgent. Some tasks have slack — they can slip a few days without delaying the overall project — while others sit on the “critical path”: if any one of them is delayed, the whole project’s end date slips. Identifying the critical path tells you exactly where schedule risk lives and where extra effort or resources actually shorten delivery time.
When to use it
- Planning a project with many interdependent tasks
- Deciding where to add resources when a deadline is tight
- Explaining to stakeholders why some delays matter and others don’t
How to apply it
- List every task and its dependencies (which tasks must finish before this one starts).
- Estimate the duration of each task.
- Map out all possible paths through the task network from start to finish.
- The longest path in total duration is the critical path; tasks on it have zero slack.
- Focus schedule protection and resource allocation on critical-path tasks.
Watch out for
- Task duration estimates are often optimistic, which understates real project risk
- The critical path can shift as tasks slip — it needs to be recalculated, not set once
- Optimizing non-critical tasks doesn’t shorten the project at all
Related models
- Bottleneck — a related idea about the single constraint limiting throughput in a system.
- Waterfall — the sequential project model in which critical path analysis is most commonly applied.
Sources
The critical path method was developed in the 1950s at DuPont and Remington Rand, credited to Morgan Walker and James Kelley, and is now standard in project management literature (e.g. the Project Management Institute’s PMBOK Guide).