Study guide

9.2 Project Scheduling, Critical Path Method (CPM) & PERT

ISM CPSM Exam 2 — Supply Management Integration Exam

Track your progress as you read

Finished sections get a check mark.

1 Chapter 1: Category Management Strategy & Spend Analysis

1.1 Category Strategy Development & Stakeholder Alignment 1.2 Spend Analysis, Data Categorization & Spend Trees 1.3 Supply Market Intelligence & Porter's Five Forces 1.4 Category Segmentation & Kraljic Portfolio Matrix

2 Chapter 2: Strategic Sourcing Waves & Supplier Relationship Management

2.1 7-Step Sourcing Wave Execution & RFx Process 2.2 Total Cost of Ownership (TCO) & Landed Cost Modeling 2.3 Supplier Evaluation, Weighted Scoring & Award Strategy 2.4 Supplier Relationship Management (SRM) & KPI Scorecards

3 Chapter 3: Supply Chain Network Strategy & Resilience

3.1 Supply Chain Network Design & Facility Location 3.2 Make-or-Buy & Insourcing vs Outsourcing Analysis 3.3 Supply Chain Risk Management, Resilience & Continuity 3.4 Sustainable, Ethical & Diverse Supply Chain Integration 3.5 Global Sourcing Footprint, Regionalization & Trade-Policy Strategy

4 Chapter 4: Supply Chain Strategy & Digital Transformation

4.1 Functional Alignment, SCOR Model & Value Chain Strategy 4.2 Agile vs Lean Supply Chains & Postponement Strategies 4.3 Digital Supply Chain Systems: ERP, WMS, TMS & AI

5 Chapter 5: Logistics & Transportation Management

5.1 Transportation Modes, Selection Analysis & Trade-offs 5.2 Freight Rating, Carrier Contracting & 3PL/4PL Management 5.3 Incoterms® 2020 Rules, Customs & Global Trade Compliance 5.4 Logistics Fundamentals, Customer Service & Total Logistics Cost 5.5 International Freight Operations: Ocean, Air, Intermodal & Forwarders 5.6 Export Controls, Trade Security Programs & Shipping Documentation

6 Chapter 6: Warehousing, Distribution & Reverse Logistics

6.1 Warehouse Operations, Layout & Slotting Optimization 6.2 Distribution Network Models, Cross-Docking & Hubs 6.3 Reverse Logistics, Remanufacturing & Circular Supply Chains 6.4 Materials Handling, Packaging & Unitization 6.5 Warehouse & Logistics Technology: WMS, TMS, Auto-ID & Automation 6.6 Logistics Performance Measurement, KPIs & Carrier Scorecards

7 Chapter 7: Demand Forecasting & Sales and Operations Planning (S&OP)

7.1 Demand Forecasting Principles & Quantitative Models 7.2 Sales and Operations Planning (S&OP) & CPFR 7.3 Demand Management, Volatility & Bullwhip Effect Mitigation 7.4 Aggregate Planning, Capacity Balancing & Master Scheduling

8 Chapter 8: Inventory Management & Control Policy

8.1 Inventory Types, Carrying Costs & Working Capital 8.2 Inventory Control Models: EOQ, Reorder Point & Safety Stock 8.3 ABC Analysis, VMI, Consignment Inventory & JIT Systems 8.4 MRP, Bills of Material & Distribution Requirements Planning 8.5 Inventory Positioning, Risk Pooling & Multi-Echelon Policy 8.6 Inventory Record Accuracy, Cycle Counting & Excess Disposition

9 Chapter 9: Project Management Integration & Governance

9.1 Project Charter, Scope Management & Work Breakdown Structure 9.2 Project Scheduling, Critical Path Method (CPM) & PERT 9.3 Project Risk Management, Earned Value Management (EVM) & RACI

10 Chapter 10: Forecasting Methods, Models & Accuracy

10.1 Forecast Horizons, Hierarchy & the Aggregation Principle 10.2 Seasonality, Decomposition & Seasonal Index Forecasting 10.3 Applied Causal Forecasting: Regression, Correlation & Leading Indicators 10.4 Managing Forecast Accuracy: Bias, Weighted Error & Forecast Value Added 10.5 Demand Sensing, Downstream Data & Machine-Learning Forecasting 10.6 New-Product Forecasting: Analogs, Attributes & Diffusion Models 10.7 Supply-Side Forecasting: Lead Time, Commodity Price & Capacity

11 Chapter 11: Product & Service Development in S&OP

11.1 New Product & Service Development and the Stage-Gate Process 11.2 Early Supplier Involvement, Co-Design & Supplier-Led Innovation 11.3 Specifications, Statements of Work & Standardization 11.4 Value Analysis, Value Engineering & Design for Manufacturability 11.5 Product Life Cycle, Phase-In/Phase-Out & Obsolescence Management

12 Chapter 12: Quality Management & Continuous Improvement

12.1 Quality Fundamentals, Cost of Quality & the Quality Philosophies 12.2 Quality Management Systems, ISO Standards & Registration 12.3 TQM, Six Sigma, Lean & Continuous Improvement Methods 12.4 Statistical Process Control, Process Capability & Acceptance Sampling 12.5 Supplier Quality Management, Certification Levels & the Quality Tools

9.2 Project Scheduling, Critical Path Method (CPM) & PERT

Key Takeaways Explain This Topic AI

The Critical Path Method (CPM) identifies the longest continuous path of dependent activities through a project network diagram, representing the absolute minimum project duration and having zero Total Float.

Forward Pass calculations determine Early Start (ES) and Early Finish (EF), while Backward Pass calculations determine Late Finish (LF) and Late Start (LS).

Total Float (TF = LS - ES = LF - EF) indicates how long an activity can be delayed without extending the project completion date, whereas Free Float (FF = ES_successor - EF) indicates allowable delay without impacting immediate successors.

PERT 3-Point Estimates incorporate schedule uncertainty using weighted averages (E = (O + 4M + P)/6) and variance calculations (σ² = ((P-O)/6)²).

Schedule compression techniques include Crashing (adding resources to critical activities at minimum cost) and Fast-Tracking (overlapping sequential activities, which increases rework risk).

Last updated: August 2026

Project Scheduling, Critical Path Method (CPM) & PERT

Building robust project schedules is essential for coordinating complex supply chain operations, such as facility relocations, new supplier onboarding, and global technology rollouts. Project scheduling translates scope deliverables into sequenced activities with estimated durations, logical dependencies, and assigned resources. Supply chain managers must master quantitative scheduling tools—specifically the Critical Path Method (CPM) and the Program Evaluation and Review Technique (PERT) —to manage schedule risk and make data-driven trade-offs.

1. Network Diagrams & Activity Logic Dependencies

Project schedules are modeled graphically using Activity-on-Node (AON) network diagrams, where nodes represent activities and arrows depict precedence relationships. The logical dependencies between activities dictate execution sequence:

Finish-to-Start (FS): The successor activity cannot start until the predecessor activity finishes (e.g., Supplier Audit must finish before Contract Award can start). This is the most common dependency.

Start-to-Start (SS): The successor activity cannot start until the predecessor activity starts (e.g., System User Training can start once System Software Testing starts).

Finish-to-Finish (FF): The successor activity cannot finish until the predecessor activity finishes (e.g., Equipment Documentation cannot finish until Equipment Installation finishes).

Start-to-Finish (SF): The successor activity cannot finish until the predecessor activity starts (rare in supply chain projects).

Leads and Lags: A Lead allows an acceleration of the successor activity (overlapping work), while a Lag imposes a mandatory delay between activities (e.g., 5-day lag for concrete curing before building warehouse racks).

2. Critical Path Method (CPM) Mechanics

The Critical Path Method (CPM) is a deterministic technique used to determine the longest path of dependent activities through a network diagram and identify the minimum total duration required to complete the project.

Forward Pass & Backward Pass Step-by-Step Rules

Forward Pass (Early Dates): Moves from project start to finish to calculate Early Start (ES) and Early Finish (EF) .

E F = E S + Duration EF = ES + \text{Duration} EF = ES + Duration

For activities with multiple predecessors, E S = max ⁡ ( E F predecessors ) ES = \max(EF_{\text{predecessors}}) ES = max ( E F predecessors ​ ) .

Backward Pass (Late Dates): Moves from project finish to start to calculate Late Finish (LF) and Late Start (LS) .

L S = L F − Duration LS = LF - \text{Duration} L S = L F − Duration

For activities with multiple successors, L F = min ⁡ ( L S successors ) LF = \min(LS_{\text{successors}}) L F = min ( L S successors ​ ) .

Step-by-Step Worked CPM Numerical Example

Consider a supply chain network setup project with 6 activities (Durations in business days):

  • Activity Description Predecessor Duration (Days)
  • A Finalize Vendor Contract None 3
  • B Audit Supplier Quality A 5
  • C Facility Site Prep A 4
  • D Tooling Setup & Delivery B 6
  • E Initial Inventory Build C 3
  • F System Integration & Go-Live D, E 2
  • Step 1: Forward Pass Calculations

Activity A: E S = 0 ES = 0 ES = 0 , E F = 0 + 3 = 3 EF = 0 + 3 = 3 EF = 0 + 3 = 3 .

Activity B: Predecessor A. E S = 3 ES = 3 ES = 3 , E F = 3 + 5 = 8 EF = 3 + 5 = 8 EF = 3 + 5 = 8 .

Activity C: Predecessor A. E S = 3 ES = 3 ES = 3 , E F = 3 + 4 = 7 EF = 3 + 4 = 7 EF = 3 + 4 = 7 .

Activity D: Predecessor B. E S = 8 ES = 8 ES = 8 , E F = 8 + 6 = 14 EF = 8 + 6 = 14 EF = 8 + 6 = 14 .

Activity E: Predecessor C. E S = 7 ES = 7 ES = 7 , E F = 7 + 3 = 10 EF = 7 + 3 = 10 EF = 7 + 3 = 10 .

Activity F: Predecessors D ( E F = 14 EF = 14 EF = 14 ) and E ( E F = 10 EF = 10 EF = 10 ). Merge node rule: E S = max ⁡ ( 14 , 10 ) = 14 ES = \max(14, 10) = 14 ES = max ( 14 , 10 ) = 14 . E F = 14 + 2 = 16 EF = 14 + 2 = 16 EF = 14 + 2 = 16 .

Total Project Duration = 16 Days .

Step 2: Backward Pass Calculations

Set L F LF L F of final Activity F equal to total project duration: L F F = 16 LF_F = 16 L F F ​ = 16 .

Activity F: L F = 16 LF = 16 L F = 16 , L S = 16 − 2 = 14 LS = 16 - 2 = 14 L S = 16 − 2 = 14 .

Activity D: Successor F. L F = 14 LF = 14 L F = 14 , L S = 14 − 6 = 8 LS = 14 - 6 = 8 L S = 14 − 6 = 8 .

Activity E: Successor F. L F = 14 LF = 14 L F = 14 , L S = 14 − 3 = 11 LS = 14 - 3 = 11 L S = 14 − 3 = 11 .

Activity B: Successor D. L F = 8 LF = 8 L F = 8 , L S = 8 − 5 = 3 LS = 8 - 5 = 3 L S = 8 − 5 = 3 .

Activity C: Successor E. L F = 11 LF = 11 L F = 11 , L S = 11 − 4 = 7 LS = 11 - 4 = 7 L S = 11 − 4 = 7 .

Activity A: Successors B ( L S = 3 LS = 3 L S = 3 ) and C ( L S = 7 LS = 7 L S = 7 ). Burst node rule: L F = min ⁡ ( 3 , 7 ) = 3 LF = \min(3, 7) = 3 L F = min ( 3 , 7 ) = 3 . L S = 3 − 3 = 0 LS = 3 - 3 = 0 L S = 3 − 3 = 0 .

3. Float (Slack) Analysis: Total Float vs. Free Float

Float represents schedule flexibility. Supply chain managers analyze float to allocate resources effectively and identify non-critical activities that can absorb delays without disrupting final milestones.

Total Float (TF): The amount of time an activity can be delayed from its early start date without delaying the overall project finish date. Total Float (TF) = L S − E S = L F − E F \text{Total Float (TF)} = LS - ES = LF - EF Total Float (TF) = L S − ES = L F − EF

Free Float (FF): The amount of time an activity can be delayed without delaying the early start date of any immediate successor activity. Free Float (FF) = E S immediate successor − E F \text{Free Float (FF)} = ES_{\text{immediate successor}} - EF Free Float (FF) = E S immediate successor ​ − EF

Comprehensive CPM & Float Analysis Table

Activity Duration ES EF LS LF Total Float ( L S − E S LS - ES L S − ES ) Free Float ( E S succ − E F ES_{\text{succ}} - EF E S succ ​ − EF ) Critical Path?

  • A 3 0 3 0 3 0 0 YES
  • B 5 3 8 3 8 0 0 YES
  • C 4 3 7 7 11 4 0 ( E S E − E F C = 7 − 7 ES_E - EF_C = 7 - 7 E S E ​ − E F C ​ = 7 − 7 ) NO
  • D 6 8 14 8 14 0 0 YES
  • E 3 7 10 11 14 4 4 ( E S F − E F E = 14 − 10 ES_F - EF_E = 14 - 10 E S F ​ − E F E ​ = 14 − 10 ) NO
  • F 2 14 16 14 16 0 0 YES

Critical Path Analysis: The path A → B → D → F has zero Total Float ( T F = 0 TF = 0 TF = 0 ) and a total duration of 16 days. Any delay in A, B, D, or F directly delays project completion. Conversely, Activity C has 4 days of Total Float; delaying Activity C by up to 4 days will consume float but will not delay project completion.

4. Program Evaluation and Review Technique (PERT)

When activity durations are uncertain due to external supply chain variability (e.g., international ocean freight transit times), PERT 3-Point Estimation provides a probabilistic estimate based on beta probability distributions.

PERT 3-Point Estimates & Formulas

Optimistic Duration ( O O O ): The minimum activity duration assuming best-case conditions.

Most Likely Duration ( M M M ): The most realistic activity duration under normal conditions.

Pessimistic Duration ( P P P ): The maximum activity duration assuming worst-case conditions. Expected Duration ( E ) = O + 4 M + P 6 \text{Expected Duration } (E) = \frac{O + 4M + P}{6} Expected Duration ( E ) = 6 O + 4 M + P ​ Activity Standard Deviation ( σ ) = P − O 6 \text{Activity Standard Deviation } (\sigma) = \frac{P - O}{6} Activity Standard Deviation ( σ ) = 6 P − O ​ Activity Variance ( σ 2 ) = ( P − O 6 ) 2 \text{Activity Variance } (\sigma^2) = \left(\frac{P - O}{6}\right)^2 Activity Variance ( σ 2 ) = ( 6 P − O ​ ) 2

Step-by-Step Worked PERT Numerical Example

Scenario: A procurement team estimates the lead time to import specialized automated sorting machinery:

  • Optimistic ( O O O ) = 8 business days
  • Most Likely ( M M M ) = 11 business days

Pessimistic ( P P P ) = 20 business days Expected Duration ( E ) = 8 + 4 ( 11 ) + 20 6 = 8 + 44 + 20 6 = 72 6 = 12.0 days \text{Expected Duration } (E) = \frac{8 + 4(11) + 20}{6} = \frac{8 + 44 + 20}{6} = \frac{72}{6} = \mathbf{12.0 \text{ days}} Expected Duration ( E ) = 6 8 + 4 ( 11 ) + 20 ​ = 6 8 + 44 + 20 ​ = 6 72 ​ = 12.0 days Standard Deviation ( σ ) = 20 − 8 6 = 12 6 = 2.0 days \text{Standard Deviation } (\sigma) = \frac{20 - 8}{6} = \frac{12}{6} = \mathbf{2.0 \text{ days}} Standard Deviation ( σ ) = 6 20 − 8 ​ = 6 12 ​ = 2.0 days Variance ( σ 2 ) = ( 2.0 ) 2 = 4.0 days 2 \text{Variance } (\sigma^2) = (2.0)^2 = \mathbf{4.0 \text{ days}^2} Variance ( σ 2 ) = ( 2.0 ) 2 = 4.0 days 2

5. Schedule Compression Techniques

When a project falls behind schedule or executive leadership demands an earlier go-live date, project managers apply two schedule compression techniques:

Crashing: Adding extra resources (e.g., authorizing contractor overtime, expediting air freight) to critical path activities at the lowest incremental cost. Trade-off: Increases total project cost.

Fast-Tracking: Executing sequential critical path activities in parallel or overlapping them. Trade-off: Increases project risk and rework potential.

Loading diagram... Activity-on-Node (AON) Critical Path Network Diagram