Critical Path Method

Also known as: CPM

framework · engineering · formal-scientific

Network analysis technique identifying the longest sequence of dependent activities and the project duration they determine.

Critical Path Method (CPM) is the deterministic network-based project-scheduling technique developed in 1957 by Morgan R. Walker (DuPont) and James E. Kelley Jr. (Remington Rand) during a joint engineering-management research project to improve scheduling of DuPont chemical-plant maintenance shutdowns. The method represents a project as a directed acyclic graph of activities with their precedence relationships and single-point duration estimates, then computes the longest path through the network — the 'critical path' — which determines the minimum project duration. Forward-pass and backward-pass computations yield earliest and latest start and finish times for each activity, with float (slack) measuring schedule flexibility for non-critical activities. Activities on the critical path have zero float; any delay there delays the project. CPM was developed in parallel with the US Navy's PERT for the Polaris missile program, with the two techniques converging in subsequent practice. CPM remains the foundational scheduling technique embedded in PMBOK, PRINCE2, and most project-management software.

Originators

Morgan R. Walker (DuPont, foundational co-author); James E. Kelley Jr. (Remington Rand / Mauchly Associates, foundational co-author); Dr. John Mauchly's consulting firm Mauchly Associates facilitated the collaboration; intellectual antecedents in Henry Gantt's chart methodology (1910s), broader operations-research developments during World War II, and 1950s linear-programming tradition; subsequent extension and pedagogical consolidation through 1960s operations-research and project-management literature high

Year / Decade

1957 (foundational publication, Construction Engineering Conference); subsequent diffusion through 1960s operations-research literature high

Primary sources

Kelley, J.E. & Walker, M.R. (1959). 'Critical-Path Planning and Scheduling', Proceedings of the Eastern Joint Computer Conference (foundational publication), Kelley, J.E. (1961). 'Critical-Path Planning and Scheduling: Mathematical Basis', Operations Research, Moder, J.J. & Phillips, C.R. (1964). Project Management with CPM and PERT (foundational textbook), PMI (multiple editions). PMBOK Guide (institutional codification of CPM in project-management practice) high

Core components

Activity-on-arrow (AOA) and activity-on-node (AON) network representations
Single-point activity duration estimates (deterministic, in contrast to PERT's three-point stochastic estimates)
Precedence relationships: finish-to-start (most common), start-to-start, finish-to-finish, start-to-finish
Forward pass: compute earliest start (ES) and earliest finish (EF) for each activity from project start
Backward pass: compute latest finish (LF) and latest start (LS) for each activity from project end
Total float = LS − ES = LF − EF (schedule flexibility for the activity)
Free float: float available without delaying immediate successors
Critical path: sequence of activities with zero total float
longest path through the network
project duration
Resource leveling and resource smoothing as extensions
Lead and lag relationships
Crashing: shortening duration by adding resources
Implementation in project-management software: Microsoft Project, Primavera, Asta Powerproject, Smartsheet, Oracle products

Primary use case

Foundational scheduling technique embedded in virtually all project-management methodologies and software; construction project scheduling (commercial, infrastructure, industrial); engineering project scheduling (manufacturing plant shutdowns, plant turnarounds, capital projects); research-program scheduling; academic and professional reference in project management, operations research, and industrial engineering curricula; input to earned-value management (EVM), critical-chain scheduling extensions (CCPM), and broader schedule-and-cost integration.

Common criticisms

CPM's deterministic single-point duration estimates have been substantially critiqued — actual project activities have stochastic durations, and CPM's deterministic treatment systematically understates schedule risk and produces optimistic project completion estimates (documented across project-overrun research including Bent Flyvbjerg's megaproject work)
the critical-path concept assumes a single longest path that determines project duration, but in practice multiple near-critical paths produce schedule volatility that CPM does not represent — Eliyahu Goldratt's Critical Chain Project Management (1997) substantially critiqued CPM on this ground and proposed buffer-management alternatives
CPM's treatment of resource constraints is awkward — pure CPM computes critical path without considering resource availability, with resource leveling as post-hoc adjustment that can substantially change the critical path
multi-tasking and resource-sharing across activities are difficult to represent rigorously
Parkinson's law dynamics (work expands to fill time available) and student-syndrome behaviors are not addressed
the method's apparent precision (specific computed dates) can produce false confidence about schedule certainty that drives inappropriate management decisions
modern scheduling research has largely moved to probabilistic Monte Carlo simulation extending CPM with stochastic durations rather than treating CPM as complete in itself.

Lineage

Parent of: Critical Chain Project Management
Siblings: PERT, Gantt Chart Methodology