Study guide

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

PE Industrial and Systems Exam

Track your progress as you read

Finished sections get a check mark.

1 Exam Overview, Strategy & Systems Foundations

1.1 PE Industrial Exam Format, Official Specification & Reference Handbook Strategy 1.2 System Analysis Tools, Process Definition, Requirements Engineering & QFD 1.3 Performance Measures: Output, Productivity, OEE, Cost & Environmental Sustainability 1.4 Process Types (Discrete, Continuous, Manufacturing, Service) & Value Analysis/Engineering

2 Optimization, Queueing, Simulation, Networks & Markov Chains

2.1 Linear Programming Formulation, Graphical Solutions & Sensitivity Analysis 2.2 Queueing Theory Models (M/M/1, M/M/s) & Little's Law Applications 2.3 Discrete-Event Simulation, Random Variates & Model Validation 2.4 Graph Theory & Network Models: Shortest Path, Minimal Spanning Tree & Maximum Flow 2.5 Markov Chains: Transition Matrices, Steady-State Probabilities & Absorbing States 2.6 Decision Trees, Expected Value & Bottleneck Analysis (Theory of Constraints)

3 Project Management & Planning

3.1 Project Scheduling with CPM and PERT: Critical Path, Float, Probability & Crashing 3.2 Project Planning & Control: Scope and WBS, Gantt Charts, Critical Chain (CCPM), Risk & Earned Value

4 Facility Layout, Space, Capacity & Material Handling

4.1 Systematic Layout Planning (SLP) & Activity Relationship (REL) Analysis 4.2 Workstation Design, Aisle Sizing & Space Requirements Planning 4.3 Capacity Analysis: Machine Requirements, Scrap Allowances & Personnel Requirements 4.4 Material Handling Equipment Selection, Unit Loads & Handling Principles

5 Site Location, Warehousing & Facility Economics

5.1 Facility Location Models: Center of Gravity & Minisum / Minimax Distance 5.2 Warehousing Systems, Storage Assignment & Order Picking Operations 5.3 Facility Life-Cycle Economics, Replacement Analysis & Rearrangement Costs

6 Demand Forecasting, Production Planning, MRP & JIT

6.1 Demand Forecasting Methods: Moving Averages, Exponential Smoothing & Error Metrics 6.2 Aggregate Planning Strategies & Master Production Scheduling (MPS) 6.3 Material Requirements Planning (MRP), Bill of Materials & Capacity Planning 6.4 Just-in-Time & Lean Production Planning: Pull Systems, Kanban Sizing, Heijunka & SMED

7 Inventory Systems, Scheduling, Logistics & Transportation Modes

7.1 Deterministic Inventory Control: Classical EOQ, EPQ & Quantity Discounts 7.2 Stochastic Inventory Management: Safety Stock, Continuous / Periodic Review & Newsvendor 7.3 Production Sequencing, Dispatching Rules & Johnson's Algorithm 7.4 Supply Chain Logistics, Transportation Simplex & Distribution Network Design 7.5 Transportation Modes, Freight Economics & the Transshipment Model

8 Engineering Economics, Break-Even Analysis & Costing Systems

8.1 Equivalence, Cash Flow Analysis & Discounted Cash Flow Metrics (PW, FW, EAC) 8.2 Rate of Return Analysis (IRR, Incremental IRR) & Benefit-Cost (B/C) Ratios 8.3 Asset Depreciation (MACRS, Straight-Line), Tax Effects & Replacement Decisions 8.4 Break-Even Analysis, Technical Capability Assessment & Costing Systems (Traditional, ABC & Standard Costs)

9 Methods Engineering, Work Measurement, Learning Curves, Line Balancing & Process Planning

9.1 Methods Analysis, Process Charting & Motion Study (Therbligs, 5S) 9.2 Worker–Machine (Man–Machine) Charts, Multiple Activity Analysis & Synchronous Servicing 9.3 Time Study Fundamentals, Performance Rating & Allowance Factors 9.4 Predetermined Motion Time Systems (PMTS, MTM, MOST) & Work Sampling 9.5 Learning Curves: Unit and Cumulative-Average Models, Learning Rates & Applications 9.6 Assembly Line Balancing, Precedence Constraints & Efficiency Heuristics 9.7 Manufacturing & Service Process Planning: Operation Selection, Sequencing, Route Sheets, Fixturing & Mistake Proofing

10 Ergonomics, Human Capacity, Occupational Safety & DART Rates

10.1 Anthropometry, Percentile Design, Workstation Ergonomics & Link Analysis 10.2 Industrial Biomechanics, the NIOSH Lifting Equation & Lifting Aids 10.3 Limits of Human Capacity & Risk-Factor Tools: Work Physiology, Strength, Range of Motion, Vision, RULA & Slip Resistance 10.4 Environmental Ergonomics (Noise, Heat, Illumination), Human-Machine Systems & OSHA Safety 10.5 Safety Codes, Standards & Voluntary Guidelines (OSHA, ANSI, NIOSH, MIL-STD) and DART Rate Calculations

11 Statistical Process Control & Process Capability

11.1 Statistical Process Control for Variables (X-bar/R and X-bar/s Charts) 11.2 Statistical Process Control for Attributes (p, np, c, and u Charts) 11.3 Process Capability Indices (Cp, Cpk, Cpm, Pp, Ppk) & Sigma Levels

12 Design of Experiments, Acceptance Sampling & Quality Systems

12.1 Design of Experiments: 2^k Factorials, ANOVA & Taguchi Robust Design 12.2 Acceptance Sampling: OC Curves, AQL, LTPD, AOQL, Z1.4/MIL-STD-105E & Dodge-Romig 12.3 Quality Systems (Deming, TQM, ISO 9000, Benchmarking), Root Cause Analysis & DMAIC

13 Reliability Engineering & Maintenance Systems

13.1 Reliability Modeling, Failure Rates (lambda) & Life Distributions (Exponential, Weibull) 13.2 System Reliability Architecture: Series, Parallel, k-out-of-n & Redundancy 13.3 Equipment Maintenance Engineering, Availability (A), MTBF/MTTR & RCM

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

Key Takeaways Explain This Topic AI

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 ( a a a ), most likely ( m m m ), and pessimistic ( b b b ), in weeks.

  • Activity Description Predecessors a a a m m m b b b t e t_e t e ​ Variance
  • A Design cell layout — 2 4 6 4 0.444
  • B Order robot — 3 5 13 6 2.778
  • C Build fixtures A 4 6 8 6 0.444
  • D Prepare floor A 2 3 4 3 0.111
  • E Install robot B, D 3 4 11 5 1.778
  • F Test and release C, E 2 2 2 2 0

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

For activity B: t e = ( 3 + 20 + 13 ) / 6 = 6 t_e = (3 + 20 + 13)/6 = 6 t e ​ = ( 3 + 20 + 13 ) /6 = 6 weeks and σ 2 = ( 10 / 6 ) 2 = 2.778 \sigma^2 = (10/6)^2 = 2.778 σ 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): E S ES ES = the largest E F EF EF of all predecessors (0 for start activities), and E F = E S + t EF = ES + t EF = ES + t .

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

Floats:

Total float T F = L S − E S = L F − E F TF = LS - ES = LF - EF TF = L S − ES = L F − EF : how long an activity can slip without delaying the project.

Free float F F = min ⁡ ( E S of successors ) − E F FF = \min(ES \text{ of successors}) - EF FF = min ( ES of successors ) − EF : how long it can slip without delaying any successor.

  • Activity t t t ES EF LS LF Total float Free float
  • A 4 0 4 0 4 0 0
  • B 6 0 6 1 7 1 1
  • C 6 4 10 6 12 2 2
  • D 3 4 7 4 7 0 0
  • E 5 7 12 7 12 0 0
  • F 2 12 14 12 14 0 0

Key steps: E cannot start until both B (EF 6) and D (EF 7) finish, so E S E = 7 ES_E = 7 E S E ​ = 7 . F waits for C (EF 10) and E (EF 12), so E S F = 12 ES_F = 12 E S F ​ = 12 and the project takes 14 weeks . On the backward pass, A must finish by the earlier of L S C = 6 LS_C = 6 L S C ​ = 6 and L S D = 4 LS_D = 4 L S D ​ = 4 , so L F A = 4 LF_A = 4 L F 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:

T e = 14 , σ T 2 = 0.444 + 0.111 + 1.778 + 0 = 2.333 , σ T = 1.528 weeks T_e = 14, \quad \sigma_T^2 = 0.444 + 0.111 + 1.778 + 0 = 2.333, \quad \sigma_T = 1.528 \text{ weeks} T e ​ = 14 , σ T 2 ​ = 0.444 + 0.111 + 1.778 + 0 = 2.333 , σ T ​ = 1.528 weeks

The probability of finishing within 16 weeks is:

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

The probability of finishing within 15 weeks is Φ ( 0.65 ) ≈ 0.74 \Phi(0.65) \approx 0.74 Φ ( 0.65 ) ≈ 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 cost Normal time − Crash time \text{Cost slope} = \frac{\text{Crash cost} - \text{Normal cost}}{\text{Normal time} - \text{Crash time}} Cost slope = Normal time − Crash time Crash cost − Normal cost ​

  • Activity Normal (wk, $) Crash (wk, $) Cost slope ($/wk) Max crash (wk)
  • A 4, 4,000 3, 5,000 1,000 1
  • B 6, 2,000 5, 3,000 1,000 1
  • C 6, 5,000 5, 5,800 800 1
  • D 3, 3,000 2, 4,500 1,500 1
  • E 5, 6,000 3, 9,000 1,500 2
  • F 2, 1,500 2, 1,500 — 0

Goal: finish in 12 weeks at minimum added cost.

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.

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.