Critical Path Method — Definition, Formula & Example
The Critical Path Method is a scheduling technique that finds the longest chain of dependent tasks in a project. That chain sets the shortest possible time to finish the whole project.
Model a project as a directed acyclic graph. Each vertex is an activity with a nonnegative duration, and each directed edge means activity must finish before starts. A critical path is a maximum-weight path from a start activity to an end activity, where a path's weight is the sum of its durations. Its weight equals the minimum project duration. An activity has zero total float if and only if it lies on at least one critical path. A project can have more than one critical path.
Key Formula
Where:
- = duration of activity j
- = earliest start and earliest finish times
- = latest start and latest finish times that do not delay the project
- = total float (slack) of an activity
- = i is an immediate predecessor of j
How It Works
A forward pass through the graph gives each activity its earliest start (ES) and earliest finish (EF). A backward pass from the project's end gives its latest finish (LF) and latest start (LS). Total float is the difference between the latest and earliest start times. Any task with zero float lies on a critical path, so delaying it delays the whole project.
Worked Example
Problem: A project has four activities. A takes 3 days and has no predecessors. B takes 4 days and C takes 2 days, and each requires A. D takes 5 days and requires both B and C. Find the minimum project duration, the float of each activity, and the critical path.
Step 1: Forward pass. A: ES = 0, EF = 3. B: ES = 3, EF = 7. C: ES = 3, EF = 5. D must wait for both B and C, so it starts at the later of their finish times.
Step 2: Backward pass from the project end at day 12. D: LF = 12, LS = 7. B: LF = 7, LS = 3. C: LF = 7, LS = 5. A must finish before both B and C can start at their latest times, so its LF is the smaller of their LS values.
Step 3: Compute total float as LS minus ES. A, B, and D each have float 0. C has float 2.
Answer: The minimum project duration is 12 days. The critical path is A → B → D (3 + 4 + 5 = 12). Activity C has 2 days of float.
Why It Matters
CPM is a core tool in operations research and construction and engineering project management. It shows managers which tasks need extra resources to keep a deadline. It also shows which tasks can slip without consequence.
Common Mistakes
Mistake: Assuming that shortening a critical activity by k days always shortens the project by k days.
Correction: Another path can become critical. In the example, cutting B from 4 days to 1 day makes A → B → D take 9 days. But A → C → D still takes 10 days, so the project drops to 10 days, not 9. Recompute the passes after every change.
