PERT vs CPM: When Each Wins

Most write-ups of PERT vs CPM present them as two competing scheduling methods you have to pick between. They aren't competitors. CPM finds the longest chain of dependent tasks in your schedule and tells you which ones have zero room to slip; PERT gives you a way to estimate a task's duration when you genuinely don't know it yet. One is a network calculation, the other is an estimating technique, and most professional schedules run both at the same time without anyone framing it as a choice.

PERT vs CPM: The Comparison Table

Dimension	CPM	PERT
Primary purpose	Find the longest dependent task chain and the float on every other task	Estimate a single task's duration under real uncertainty
Input per task	One duration	Three durations: optimistic, most likely, pessimistic
Treatment of uncertainty	Assumes durations are known and fixed	Explicitly models a range and produces a standard deviation
The math	Forward pass (ES, EF) and backward pass (LS, LF), float = LS − ES	E = (O + 4M + P) / 6, SD = (P − O) / 6
Output	A critical path, a project duration, and a float value per task	An expected duration and a confidence range per task
Best suited to	Repeatable work with known durations: construction phases, standard deployments, most business projects	Novel work with genuine unknowns: R&D, first-of-kind builds, unproven vendors
Origin	DuPont and Remington Rand, late 1950s, for industrial and chemical plant projects	US Navy Special Projects Office, 1958, for the Polaris submarine missile program
Visual representation	Usually a Gantt chart with the critical path highlighted	Originally a PERT network diagram; rarely drawn separately in modern tools

What CPM Actually Calculates

CPM takes a network of tasks with dependencies and durations and runs a forward pass and a backward pass to find earliest and latest start and finish dates for every task. The longest path through that network, in duration, not task count, is the critical path: the tasks with zero float that set the minimum possible project length. Every other task has some float, meaning it can slip a certain number of days without moving the finish date.

CPM's entire mechanism assumes you already have a duration for each task and trusts that number completely. It says nothing about how confident you should be in any individual estimate; it just calculates the consequences of the durations you feed it. That's a strength when durations really are well understood, construction sequencing, a deployment runbook you've executed a dozen times, and a blind spot the moment a task's duration is a guess dressed up as a fact.

What PERT Actually Calculates

PERT exists for the opposite case: a task where nobody can honestly give you one number. Instead of a single guess, PERT asks for three: optimistic (best case), most likely (the realistic case), and pessimistic (the realistic bad case, not a catastrophe). Those three combine into an expected duration, E = (O + 4M + P) / 6, weighted four times toward the most likely case, plus a standard deviation, SD = (P − O) / 6, that tells you how much to trust the number.

The three-point estimation guide walks through the full formula, a worked example, and how to roll variances up across a chain of tasks without making the common arithmetic mistake of summing standard deviations directly. This post assumes that math and focuses on the decision PERT and CPM actually force: which technique applies to which part of your schedule.

The diagram below places the two techniques on the same schedule: PERT feeding an uncertain task's estimate in, CPM taking every task's duration and calculating the critical path out.

The Honest Verdict: Most Schedules Run Both

Framing PERT vs CPM as a choice misreads what each technique actually does. A real schedule has some tasks with well-known durations (a deployment you've run a dozen times, a standard onboarding step) and some tasks that are genuinely novel (an unproven integration, first-of-kind vendor work). The correct approach is not picking one methodology for the whole schedule; it's applying PERT's three-point estimating specifically to the uncertain tasks, feeding the resulting expected durations into an otherwise ordinary CPM forward and backward pass, and letting the critical path calculation run exactly the way it would with single-point estimates.

This is also why "PERT chart" and "critical path diagram" have mostly merged in practice. Modern PM tools calculate the critical path on a standard Gantt chart rather than drawing a separate PERT-style network diagram; the estimating technique and the scheduling calculation live in the same tool, even though they're solving different problems.

Which Project Types Suit Which Technique

Projects with mostly repeatable work, construction phases, standard IT deployments, routine compliance filings, get most of their value from CPM alone: durations are well understood, so the critical path calculation is trustworthy without extra estimating overhead. Projects with genuine research and development risk, a first-of-kind build, an unproven vendor relationship, an unfamiliar regulatory process, need PERT's three-point estimating on those specific tasks before CPM's output means anything. Applying three-point estimation to a task the team has done fifty times identically just adds process without changing the schedule.

For the mechanics of the forward and backward pass itself, including a full worked network with float calculated task by task, see the critical path worked example. For building the task list PERT and CPM both operate on in the first place, the work breakdown structure guide covers decomposing a project down to schedulable activities.

Onplana's Gantt chart with critical path calculates the critical path automatically from your dependency graph, so the CPM math never has to be done by hand; pair it with three-point estimates on the tasks you're genuinely unsure about and the rest of the schedule follows the same calculation either way. All three posts sit in the broader scheduling fundamentals library if you're working through dependencies, estimation, and the critical path end to end.