PERT and CPM Network Analysis: A Simple Explanation
PERT and CPM are network analysis techniques for planning and controlling large projects. They break a project into activities, show their dependencies as a network diagram, and identify which activities control the project's finish date.
They matter because big projects — building a bridge, launching a product — involve hundreds of tasks. PERT/CPM reveal the critical path: the chain of tasks where any delay delays the whole project, so managers know exactly where to focus.
Key Concepts
- Activity: a task with a duration, drawn as an arrow; event (node): a milestone, drawn as a circle.
- CPM (Critical Path Method): uses one fixed duration per activity; finds the longest path — the critical path.
- PERT: uses three time estimates per activity to handle uncertainty.
- Optimistic (o), most likely (m), pessimistic (p): the three PERT estimates.
- Slack (float): how much a non-critical activity can slip without delaying the project.
- Crash: shortening an activity's duration by spending extra money.
Formulas
- Expected time: tₑ = (o + 4m + p)/6
- Variance: σ² = ((p − o)/6)²
- Earliest start (ES): the earliest an activity can begin, from a forward pass through the network.
- Latest start (LS): the latest it can begin without delaying the project, from a backward pass.
- Slack = LS − ES; activities with zero slack are critical.
- Project completion probability uses Z = (due date − expected project time)/√(sum of critical variances).
Assumptions: activity durations are independent; the beta distribution behind the (o + 4m + p)/6 weighting; unlimited resources unless resource-levelling is added.
Worked Example
A project has activities: A (2 days) → B (3 days) → D (2 days), and A → C (5 days) → D.
- Paths: A–B–D = 2 + 3 + 2 = 7 days; A–C–D = 2 + 5 + 2 = 9 days.
- Critical path: A–C–D (longest, 9 days). Project duration = 9 days.
- Slack of B: latest it can finish is day 7 (to start D), earliest finish is day 5 → slack = 7 − 5 = 2 days.
- PERT estimate example: activity with o = 4, m = 6, p = 14: tₑ = (4 + 24 + 14)/6 = 42/6 = 7 days; variance = ((14 − 4)/6)² = (10/6)² ≈ 2.78.
Common Misconceptions
- "All tasks are equally urgent." Only critical-path tasks affect the deadline; others have slack.
- "Shortening any task shortens the project." Crashing a non-critical activity wastes money with no effect on the finish date.
- "PERT and CPM are the same." PERT handles uncertain durations with three estimates; CPM uses single fixed durations.
Real-World Applications
- Construction firms schedule skyscraper and highway projects with CPM networks.
- Software teams map release dependencies to find launch-blocking tasks.
- Event planners use PERT to coordinate weddings and conferences with uncertain setup times.
PERT and CPM turn a tangled project into a network where the critical path stands out clearly. By focusing management attention — and crash budgets — on that path, they keep complex projects on schedule.
Related blogs
- Linear Programming Simplex Method: A Complete Guide
- Big M and Two Phase Methods: Explained with Examples
- Duality Theory: Explained with Examples, Notes and FAQs
- Dual Simplex Method: Concepts, Formulas and Examples
- Sensitivity Analysis: Methods, Types, and Applications
- Transportation Problem: Formulation and Solution Methods