3.1 Project Scheduling with CPM and PERT: Critical Path, Float, Probability & Crashing

Key Takeaways

  • The forward pass sets each activity's earliest start as the largest earliest finish of its predecessors; the backward pass sets latest finish as the smallest latest start of its successors.

  • Total float equals LS − ES (or LF − EF); activities with zero total float form the critical path, which is the longest path through the network.

  • PERT uses te = (a + 4m + b) ÷ 6 and variance ((b − a) ÷ 6)²; project variance is the sum of variances along the critical path, and completion probability uses z = (T − Te) ÷ σ.

  • Crashing shortens the project at least cost by repeatedly buying time on the critical activity with the lowest cost slope, (crash cost − normal cost) ÷ (normal time − crash time).

  • When several paths become critical, a crash must shorten all of them at once, often by crashing an activity they share.

Last updated: October 2026

3.1 Project Scheduling with CPM and PERT

The specification names "PERT/CPM/CCPM: risk analysis, cost, scope, and time; Gantt charts" under project management. This section covers the time calculations (CPM, PERT, and crashing). The next section covers Gantt charts, critical chain, cost, scope, and risk.

CPM (Critical Path Method) was developed at DuPont in the late 1950s with single, deterministic activity durations and a focus on time-cost tradeoffs. PERT (Program Evaluation and Review Technique) was developed for the U.S. Navy's Polaris program at about the same time and uses three time estimates to model uncertainty.


1. The Example Project

Activities are drawn as nodes (activity-on-node) with arrows for precedence. The PERT estimates are optimistic (aa), most likely (mm), and pessimistic (bb), in weeks.

ActivityDescriptionPredecessorsaammbbtet_eVariance
ADesign cell layout—24640.444
BOrder robot—351362.778
CBuild fixturesA46860.444
DPrepare floorA23430.111
EInstall robotB, D341151.778
FTest and releaseC, E22220

te=a+4m+b6,σ2=(b−a6)2t_e = \frac{a + 4m + b}{6}, \qquad \sigma^2 = \left(\frac{b - a}{6}\right)^2

For activity B: te=(3+20+13)/6=6t_e = (3 + 20 + 13)/6 = 6 weeks and σ2=(10/6)2=2.778\sigma^2 = (10/6)^2 = 2.778. The long pessimistic tail (13 weeks) pulls the expected time above the most likely value of 5.

Loading diagram...

2. Forward and Backward Passes

Forward pass (earliest times): ESES = the largest EFEF of all predecessors (0 for start activities), and EF=ES+tEF = ES + t.

Backward pass (latest times): LFLF = the smallest LSLS of all successors (the project finish for end activities), and LS=LF−tLS = LF - t.

Floats:

  • Total float TF=LS−ES=LF−EFTF = LS - ES = LF - EF: how long an activity can slip without delaying the project.
  • Free float FF=min⁡(ES of successors)−EFFF = \min(ES \text{ of successors}) - EF: how long it can slip without delaying any successor.
ActivityttESEFLSLFTotal floatFree float
A4040400
B6061711
C641061222
D3474700
E571271200
F21214121400

Key steps: E cannot start until both B (EF 6) and D (EF 7) finish, so ESE=7ES_E = 7. F waits for C (EF 10) and E (EF 12), so ESF=12ES_F = 12 and the project takes 14 weeks. On the backward pass, A must finish by the earlier of LSC=6LS_C = 6 and LSD=4LS_D = 4, so LFA=4LF_A = 4.

The critical path is the zero-float chain A–D–E–F (4 + 3 + 5 + 2 = 14). The other paths are B–E–F (13 weeks) and A–C–F (12 weeks), so B has 1 week of float and C has 2.


3. PERT Completion Probability

PERT treats the project duration as approximately normal, with mean equal to the critical path length and variance equal to the sum of the critical activities' variances:

Te=14,σT2=0.444+0.111+1.778+0=2.333,σT=1.528 weeksT_e = 14, \quad \sigma_T^2 = 0.444 + 0.111 + 1.778 + 0 = 2.333, \quad \sigma_T = 1.528 \text{ weeks}

The probability of finishing within 16 weeks is:

z=16−141.528=1.31,P(T≤16)=Φ(1.31)≈0.905z = \frac{16 - 14}{1.528} = 1.31, \qquad P(T \le 16) = \Phi(1.31) \approx 0.905

The probability of finishing within 15 weeks is Φ(0.65)≈0.74\Phi(0.65) \approx 0.74.

Warning

Near-critical paths. Path B–E–F has a mean of only 13 weeks but a larger variance (2.778 + 1.778 = 4.556). PERT's single-path answer ignores such paths, so the true chance of finishing on time is somewhat lower than 90.5% ("merge bias"). When a near-critical path has high variance, check its probability too or use Monte Carlo simulation.


4. Crashing: Time–Cost Tradeoff

Crashing shortens activities by spending more (overtime, extra crews, expedited delivery). Each activity has a normal time and cost and a crash time and cost:

Cost slope=Crash cost−Normal costNormal time−Crash time\text{Cost slope} = \frac{\text{Crash cost} - \text{Normal cost}}{\text{Normal time} - \text{Crash time}}

ActivityNormal (wk, $)Crash (wk, $)Cost slope ($/wk)Max crash (wk)
A4, 4,0003, 5,0001,0001
B6, 2,0005, 3,0001,0001
C6, 5,0005, 5,8008001
D3, 3,0002, 4,5001,5001
E5, 6,0003, 9,0001,5002
F2, 1,5002, 1,500—0

Goal: finish in 12 weeks at minimum added cost.

  1. Only critical activities matter. Of A, D, E, and F, the cheapest is A at $1,000/week. Crash A by 1 week. Paths become A–D–E–F 13, B–E–F 13, and A–C–F 11. Two paths are now critical.
  2. Both critical paths must be shortened together. Options are E alone (shared by both, $1,500) or D plus B ($1,500 + $1,000 = $2,500). Crash E by 1 week for $1,500. Paths become 12, 12, and 11.

The total added cost is $2,500 to reach 12 weeks. C is the cheapest activity ($800) but crashing it is useless, because C is not on a critical path. If indirect costs (supervision, rented equipment, penalties) are $2,000 per week, each week saved is worth $2,000. Both weeks are worth buying: the first costs $1,000 and the second $1,500.

Tip

Stop crashing when the next week of crashing costs more than the indirect cost or penalty it saves. That point is the minimum total-cost duration.

Test Your Knowledge

In the six-activity project in this section, activity B (order robot) is delayed by 2 weeks. If nothing else changes, what is the new project duration?

A

14 weeks

B

16 weeks

C

15 weeks

D

13 weeks

Test Your Knowledge

A project's critical path has an expected duration of 30 days and a standard deviation of 2.5 days. Using PERT assumptions, what is the approximate probability of finishing within 33 days?

A

0.62

B

0.79

C

0.95

D

0.88

Test Your Knowledge

Two paths in a project are both critical at 20 days. Activity P is on path 1 only (cost slope $600 per day), activity Q is on path 2 only ($700 per day), and activity R is on both paths ($1,100 per day). What is the cheapest way to shorten the project by 1 day?

A

Crash R by 1 day for $1,100

B

Crash P by 1 day for $600

C

Crash P and Q by 1 day each for $1,300

D

Crash Q by 1 day for $700

Sections you finish are checked off in the contents.