Study guide

10.2 Project Management: WBS, Critical Path Method (CPM), PERT, and Crashing

FE Industrial and Systems Study Guide Exam

Track your progress as you read

Finished sections get a check mark.

1 Chapter 1: Exam Overview, CBT Strategy & Handbook Navigation

1.1 FE Industrial Exam Structure, CBT Logistics, and Pacing 1.2 Using the NCEES FE Reference Handbook and Approved Calculators

2 Chapter 2: Mathematics for Industrial Engineers

2.1 Analytic Geometry, Coordinate Systems, and Trigonometry 2.2 Calculus: Differential, Integral, and Series Approximations 2.3 Linear Algebra: Matrix Operations, Systems of Equations, and Vectors

3 Chapter 3: Engineering Sciences Core

3.1 Thermodynamics Fundamentals and Fluid Flow Principles 3.2 Statics, Dynamics, and Mechanics of Materials Core 3.3 Electrical Circuits, DC/AC Analysis, and Power in Industrial Systems

4 Chapter 4: Ethics and Professional Practice

4.1 NCEES Model Rules of Professional Conduct and Technical Society Ethics 4.2 Engineering Licensure, Public Welfare, and Professional Liability 4.3 Engineering Contracts, Intellectual Property, and Conflicts of Interest

5 Chapter 5: Engineering Economics

5.1 Time Value of Money, Discount Factors, and Equivalence 5.2 Evaluating Alternatives: Present Worth, Equivalent Annual Cost, and IRR 5.3 Incremental Rate of Return, Replacement Analysis, and Break-Even 5.4 Depreciation Methods, MACRS, Income Taxes, and Inflation

6 Chapter 6: Probability Foundations & Distributions

6.1 Basic Probability Concepts, Conditional Probability, and Bayes' Theorem 6.2 Discrete Probability Distributions 6.3 Continuous Probability Distributions

7 Chapter 7: Statistical Inference, Regression & Design of Experiments

7.1 Sampling Distributions, Central Limit Theorem, and Confidence Intervals 7.2 Hypothesis Testing: Means, Proportions, and Variances 7.3 Linear Regression, Correlation Analysis, and Design of Experiments (ANOVA)

8 Chapter 8: Data, Logic, Modeling & Linear Programming

8.1 Optimization Modeling: Decision Variables, Objectives, and Constraints 8.2 Linear Programming: Graphical Solutions and Simplex Fundamentals 8.3 Duality, Sensitivity Analysis, and Integer Linear Programming 8.4 Data, Logic Development, and Analytics

9 Chapter 9: Stochastic Models & Simulation

9.1 Queuing Theory: Little's Law, M/M/1, and Multi-Server Systems 9.2 Discrete-Time Markov Chains: Transition Matrices and Steady-State Probabilities 9.3 Discrete-Event Simulation Principles and Monte Carlo Modeling

10 Chapter 10: Engineering Management, Project Planning & Performance Measurement

10.1 Organizational Structure, Leadership, and Worker Motivation Theories 10.2 Project Management: WBS, Critical Path Method (CPM), PERT, and Crashing 10.3 Earned Value Management (EVM), Decision Trees, and Risk Preference 10.4 Performance Measurement: Productivity, KPIs, Wage Systems, and the Balanced Scorecard

11 Chapter 11: Manufacturing & Production Systems

11.1 Manufacturing Processes, Material Processing, and Tolerancing 11.2 Assembly Line Balancing, Takt Time, Cycle Time, and Throughput 11.3 Sustainable Manufacturing, Waste Minimization, and Life-Cycle Assessment

12 Chapter 12: Production Planning, Inventory Control & Sequencing

12.1 Demand Forecasting Methods and Forecast Error Tracking 12.2 Aggregate Planning, Master Production Scheduling (MPS), and MRP 12.3 Deterministic Inventory Models: EOQ, EPQ, and Safety Stock 12.4 Job Sequencing, Dispatching Rules, and Flow Shop Scheduling

13 Chapter 13: Lean Systems & Theory of Constraints

13.1 Lean Foundations: Value Stream Mapping, Seven Wastes, and 5S 13.2 Pull Systems, Kanban, Just-In-Time (JIT), and SMED Setup Reduction 13.3 Theory of Constraints: Bottleneck Identification and Drum-Buffer-Rope

14 Chapter 14: Facilities Planning & Material Handling

14.1 Facility Location Analysis: Qualitative Factor Rating and Centroid Method 14.2 Facility Layout Design and Flow Analysis 14.3 Material Handling Equipment, Warehousing, and AS/RS

15 Chapter 15: Supply Chain Design & Logistics

15.1 Supply Chain Network Architecture and Transportation Modes 15.2 Distribution Strategies, Cross-Docking, and Vehicle Routing 15.3 The Bullwhip Effect, Risk Pooling, and Supply Chain Coordination

16 Chapter 16: Human Factors & Cognitive Ergonomics

16.1 Cognitive Engineering, Human-Machine Interface, Displays, and Controls 16.2 Anthropometric Principles, Percentile Design, and Biomechanical Posture 16.3 Environmental Ergonomics: Industrial Noise, Lighting, and Heat Stress

17 Chapter 17: Physical Ergonomics & Workplace Safety

17.1 Physical Ergonomics: The NIOSH Manual Lifting Equation 17.2 Cumulative Trauma Disorders and Postural Assessment 17.3 Workplace Safety: OSHA Standards, Hazard Analysis, and Control Hierarchy

18 Chapter 18: Work Design & Measurement

18.1 Methods Engineering, Process Charting, and Principles of Motion Economy 18.2 Direct Stopwatch Time Study: Observed Time, Performance Rating, and Allowances 18.3 Predetermined Time Systems, Work Sampling, and Learning Curves

19 Chapter 19: Quality Management, Six Sigma & Analytical Tools

19.1 Quality Philosophies, Total Quality Management, and Cost of Quality 19.2 Six Sigma DMAIC Methodology and Quality Function Deployment 19.3 The Seven Basic Quality Tools, Root Cause Analysis, and Taguchi Loss Function

20 Chapter 20: Statistical Process Control

20.1 Statistical Process Control Principles, Variation, and Run Rules 20.2 Variable Control Charts: X-bar & R, X-bar & S, and Individual-Moving Range 20.3 Attribute Control Charts: Defectives (p, np) and Defects (c, u)

21 Chapter 21: Process Capability & Acceptance Sampling

21.1 Process Capability Indices and Defect Levels 21.2 Acceptance Sampling Concepts and Operating Characteristic Curves 21.3 Sampling Risks, AQL, LTPD, and Standard Sampling Plans

22 Chapter 22: Systems Engineering & Life-Cycle Management

22.1 The Systems Engineering V-Model, Stakeholder Requirements, and Functional Architecture 22.2 Configuration Management, Interface Control, and Verification & Validation 22.3 Life-Cycle Costing, Maintainability, and System Availability

23 Chapter 23: Reliability Engineering & Risk Analysis

23.1 Reliability Mathematics, Hazard Rates, and the Bathtub Curve 23.2 System Reliability Configurations: Series, Parallel, and k-out-of-n Systems 23.3 Failure Modes and Effects Analysis and Fault Tree Analysis

10.2 Project Management: WBS, Critical Path Method (CPM), PERT, and Crashing

Key Takeaways Explain This Topic AI

The Work Breakdown Structure (WBS) enforces the 100% Rule, mandating that the decomposition captures 100% of the project scope with zero omissions and zero extraneous scope.

In Critical Path Method (CPM) networks, Total Float is calculated as TF = LS - ES = LF - EF, whereas Free Float is the slack available without delaying any immediate successor: FF = min(ES_successors) - EF.

The critical path is the longest duration path through the project network; any delay in a critical path activity directly postpones project completion, and critical activities have Total Float equal to zero (assuming target deadline equals early finish).

PERT uses a beta distribution approximation to calculate expected activity duration as t_e = (a + 4m + b) / 6 and activity variance as σ^2 = ((b - a) / 6)^2; project variance is obtained by summing variances strictly along the critical path.

Project crashing optimizes duration reduction by crashing critical path activities with the lowest cost slope: Cost Slope = (Crash Cost - Normal Cost) / (Normal Time - Crash Time).

Last updated: September 2026

10.2 Project Management: WBS, Critical Path Method (CPM), PERT, and Crashing

Project management in industrial and systems engineering demands rigorous mathematical methodologies to translate high-level deliverable requirements into executable activity networks. Whether launching an automated manufacturing facility, deploying supply chain software, or conducting lean re-engineering, engineers rely on the Work Breakdown Structure (WBS), Critical Path Method (CPM), Program Evaluation and Review Technique (PERT), and time-cost crashing optimization.

  • 1. Work Breakdown Structure (WBS) & Network Representations
  • The Work Breakdown Structure (WBS)

A Work Breakdown Structure (WBS) is a hierarchical, deliverable-oriented decomposition of the total scope of work to be carried out by the project team.

The 100% Rule : The WBS must encompass exactly 100% of the work defined by the project scope, accounting for all internal, external, and project management deliverables. The sum of the work at each subordinate level must roll up to exactly 100% of the parent element, with no overlapping scope and no orphaned activities.

Work Packages : The lowest decomposition level in the WBS is termed a work package . A work package represents an identifiable, independent unit of work that can be reliably scheduled, assigned to an individual owner or control account manager, budgeted with distinct direct costs, and quantitatively monitored.

Activity Network Conventions: AON vs. AOA

Once work packages are decomposed into discrete sequential activities, precedence logic is represented via project networks: Activity Network Conventions

  • Activity-on-Node (AON / PDM) Activity-on-Arrow (AOA / ADM)
  • ┌───────────┐ (Event i) ──Activity A──> (Event j)
  • │ Activity │ \ /
  • │ Node │ \ (Dummy) /
  • └───────────┘ \- - - - - - - >
  • Nodes = Activities / Tasks Arrows = Activities
  • Arrows = Precedence Dependencies Nodes = Milestone Events (Requires Dummies)

Activity-on-Node (AON / Precedence Diagramming Method - PDM) : Nodes represent the activities, and directed arrows represent precedence relationships. AON is the universal standard in modern project scheduling. It natively supports four dependency types:

Finish-to-Start (FS) : Activity B cannot start until Activity A finishes (most common).

Start-to-Start (SS) : Activity B cannot start until Activity A starts.

Finish-to-Finish (FF) : Activity B cannot finish until Activity A finishes.

Start-to-Finish (SF) : Activity B cannot finish until Activity A starts.

Activity-on-Arrow (AOA / Arrow Diagramming Method - ADM) : Arrows represent activities, and circular nodes represent milestone events (the start or completion of activities). AOA networks only model Finish-to-Start logic and frequently require dummy activities (represented as dashed arrows with zero duration and zero cost) to maintain unique node numbering and prevent ambiguous logical precedence.

2. Critical Path Method (CPM): Forward Pass, Backward Pass, and Float

The Critical Path Method is a deterministic scheduling algorithm that calculates the earliest and latest dates each activity can proceed without delaying the overall project.

Standard AON Node Convention

On the NCEES FE exam, an activity node is structured with the following standard six-box layout: ┌──────────────┬───────────────────┬──────────────┐

  • │ Early Start │ Duration │ Early Finish │
  • │ (ES) │ (t) │ (EF) │
  • ├──────────────┼───────────────────┼──────────────┤
  • │ Late Start │ Total Float / Slack│ Late Finish │
  • │ (LS) │ (TF) │ (LF) │
  • └──────────────┴───────────────────┴──────────────┘
  • The Forward Pass (Early Dates: E S ES ES and E F EF EF )

The forward pass moves from project start to project completion to determine the earliest possible start and finish times for each activity:

Initialize project start: For initial activities with no predecessors, set E S = 0 ES = 0 ES = 0 .

For any activity i i i with duration t i t_i t i ​ : E F i = E S i + t i EF_i = ES_i + t_i E F i ​ = E S i ​ + t i ​

For any subsequent activity j j j that has multiple immediate predecessors: E S j = max ⁡ p ∈ Pred ( j ) { E F p } ES_j = \max_{p \in \text{Pred}(j)} \{ EF_p \} E S j ​ = p ∈ Pred ( j ) max ​ { E F p ​ } Rule : An activity cannot begin until all of its immediate predecessor activities have finished.

The Backward Pass (Late Dates: L S LS L S and L F LF L F )

The backward pass moves from project completion back to project start to determine the latest possible times activities can occur without delaying the target project completion date:

For the terminal activity (or project deadline T project T_{\text{project}} T project ​ ): L F terminal = E F terminal LF_{\text{terminal}} = EF_{\text{terminal}} L F terminal ​ = E F terminal ​

For any activity i i i with duration t i t_i t i ​ : L S i = L F i − t i LS_i = LF_i - t_i L S i ​ = L F i ​ − t i ​

For any activity i i i that has multiple immediate successors: L F i = min ⁡ s ∈ Succ ( i ) { L S s } LF_i = \min_{s \in \text{Succ}(i)} \{ LS_s \} L F i ​ = s ∈ Succ ( i ) min ​ { L S s ​ } Rule : An activity must finish in time to accommodate the earliest late start among all its succeeding tasks.

Float (Slack) Formulations

Float represents the scheduling flexibility of an activity.

Total Float ( T F TF TF )

Total Float (or Total Slack) is the maximum time an activity can be delayed from its early start date without delaying the overall project completion date: T F i = L S i − E S i = L F i − E F i TF_i = LS_i - ES_i = LF_i - EF_i T F i ​ = L S i ​ − E S i ​ = L F i ​ − E F i ​

Free Float ( F F FF FF )

Free Float (or Free Slack) is the maximum time an activity can be delayed without delaying the Early Start ( E S ES ES ) of any immediate successor activity: F F i = min ⁡ s ∈ Succ ( i ) { E S s } − E F i FF_i = \min_{s \in \text{Succ}(i)} \{ ES_s \} - EF_i F F i ​ = s ∈ Succ ( i ) min ​ { E S s ​ } − E F i ​

Fundamental Float Axiom : Free Float is always less than or equal to Total Float ( F F i ≤ T F i FF_i \le TF_i F F i ​ ≤ T F i ​ ). If an activity has zero Total Float, its Free Float must also be zero ( T F i = 0 ⟹ F F i = 0 TF_i = 0 \implies FF_i = 0 T F i ​ = 0 ⟹ F F i ​ = 0 ).

Critical Path Identification

The critical path is the sequence of dependent activities from network start to finish that possesses the longest cumulative duration. Key characteristics:

It establishes the absolute minimum calendar duration required to complete the project.

Activities on the critical path have zero Total Float ( T F = 0 TF = 0 TF = 0 ), assuming the project target completion time equals the early finish of the terminal activity.

Any delay to a critical path activity results in a one-for-one day delay to final project completion.

A project network may contain multiple concurrent critical paths.

3. Program Evaluation and Review Technique (PERT)

In complex, first-of-a-kind engineering projects (such as advanced aerospace development or novel automated systems), activity durations cannot be known deterministically. PERT models duration uncertainty using a three-point estimation framework governed by a beta distribution .

The Three-Point Duration Estimates

For each activity, three estimates are assessed:

Optimistic duration ( a a a ) : The minimum time required if execution proceeds exceptionally well with zero anomalies (typically 1-in-100 probability).

Most likely duration ( m m m ) : The modal duration observed under ordinary operating conditions.

Pessimistic duration ( b b b ) : The maximum time required if severe adverse conditions, material delays, and technical roadblocks occur (typically 1-in-100 probability).

Activity Expected Value and Variance Formulas

Based on the standard PERT beta distribution approximation:

Expected Activity Duration ( t e t_e t e ​ ) : t e = a + 4 m + b 6 t_e = \frac{a + 4m + b}{6} t e ​ = 6 a + 4 m + b ​

Activity Standard Deviation ( σ \sigma σ ) : σ = b − a 6 \sigma = \frac{b - a}{6} σ = 6 b − a ​

Activity Variance ( σ 2 \sigma^2 σ 2 ) : σ 2 = ( b − a 6 ) 2 = ( b − a ) 2 36 \sigma^2 = \left(\frac{b - a}{6}\right)^2 = \frac{(b - a)^2}{36} σ 2 = ( 6 b − a ​ ) 2 = 36 ( b − a ) 2 ​

Project-Level Parameters (Summation Along the Critical Path)

By invoking the Central Limit Theorem (CLT) , if a critical path consists of numerous independent sequential activities, the distribution of the total project duration ( T T T ) approaches a Normal Distribution : T ∼ N ( T e , σ P 2 ) T \sim \mathcal{N}(T_e, \sigma_P^2) T ∼ N ( T e ​ , σ P 2 ​ )

Expected Project Completion Time ( T e T_e T e ​ ) : T e = ∑ i ∈ C P t e , i T_e = \sum_{i \in CP} t_{e,i} T e ​ = i ∈ CP ∑ ​ t e , i ​

Total Project Variance ( σ P 2 \sigma_P^2 σ P 2 ​ ) : σ P 2 = ∑ i ∈ C P σ i 2 \sigma_P^2 = \sum_{i \in CP} \sigma_i^2 σ P 2 ​ = i ∈ CP ∑ ​ σ i 2 ​

Total Project Standard Deviation ( σ P \sigma_P σ P ​ ) : σ P = σ P 2 = ∑ i ∈ C P σ i 2 \sigma_P = \sqrt{\sigma_P^2} = \sqrt{\sum_{i \in CP} \sigma_i^2} σ P ​ = σ P 2 ​ ​ = i ∈ CP ∑ ​ σ i 2 ​ ​

CRITICAL NCEES EXAM RULE : Variances are additive; standard deviations are NEVER additive! σ P ≠ ∑ i ∈ C P σ i ⟺ σ P = ∑ i ∈ C P σ i 2 \sigma_P \ne \sum_{i \in CP} \sigma_i \quad \Longleftrightarrow \quad \sigma_P = \sqrt{\sum_{i \in CP} \sigma_i^2} σ P ​  = ∑ i ∈ CP ​ σ i ​ ⟺ σ P ​ = ∑ i ∈ CP ​ σ i 2 ​ ​

Probability of Project Completion by Target Date ( T d T_d T d ​ )

To determine the probability that the project will finish on or before a specified due date T d T_d T d ​ , compute the standard normal test statistic ( Z Z Z ) and reference the unit normal distribution table Φ ( Z ) \Phi(Z) Φ ( Z ) : Z = T d − T e σ P = T d − T e ∑ i ∈ C P σ i 2 Z = \frac{T_d - T_e}{\sigma_P} = \frac{T_d - T_e}{\sqrt{\sum_{i \in CP} \sigma_i^2}} Z = σ P ​ T d ​ − T e ​ ​ = ∑ i ∈ CP ​ σ i 2 ​ ​ T d ​ − T e ​ ​ P ( T ≤ T d ) = Φ ( Z ) P(T \le T_d) = \Phi(Z) P ( T ≤ T d ​ ) = Φ ( Z )

4. Project Crashing (Time-Cost Optimization)

Project crashing is the systematic procedure of compressing total project duration for the lowest additional direct cost. Crashing involves deploying additional resources—such as assigning overtime, adding second shifts, hiring subcontractors, or renting larger machinery.

Crashing Parameters

For each project activity:

Normal Time ( N T NT NT ) and Normal Cost ( N C NC NC ) : Standard operational execution.

Crash Time ( C T CT CT ) and Crash Cost ( C C CC CC ) : Maximum possible acceleration limit and its corresponding total cost.

Maximum Time Reduction ( Δ t max ⁡ \Delta t_{\max} Δ t m a x ​ ) : Δ t max ⁡ = N T − C T \Delta t_{\max} = NT - CT Δ t m a x ​ = NT − CT .

Cost Slope (Crash Cost per Unit Time)

Assuming a linear relationship between time reduction and direct cost increase: Cost Slope = Δ Cost Δ Time = C C − N C N T − C T \text{Cost Slope} = \frac{\Delta \text{Cost}}{\Delta \text{Time}} = \frac{CC - NC}{NT - CT} Cost Slope = Δ Time Δ Cost ​ = NT − CT CC − NC ​ Crash Cost per Period = Crash Cost − Normal Cost Normal Duration − Crash Duration \text{Crash Cost per Period} = \frac{\text{Crash Cost} - \text{Normal Cost}}{\text{Normal Duration} - \text{Crash Duration}} Crash Cost per Period = Normal Duration − Crash Duration Crash Cost − Normal Cost ​

Systematic Least-Cost Crashing Algorithm

Identify the Critical Path(s) : Calculate early and late dates for the entire network to identify all critical paths.

Identify Candidate Activities : Only activities located on the critical path can reduce project duration. (Crashing a non-critical activity incurs cost without shortening project completion).

Select Minimum Cost Slope : Among the critical activities that can still be crashed, select the activity with the lowest cost slope .

Determine Crashing Increment : Shorten the selected activity by the minimum of:

The activity's remaining crash capacity ( N T − C T NT - CT NT − CT ).

The amount of time reduction that causes a parallel non-critical path to become critical.

The remaining duration needed to meet the project objective.

Handle Multiple Critical Paths : If multiple parallel critical paths exist, you must shorten all critical paths simultaneously by the same amount. This is achieved either by crashing a common shared critical activity or by crashing a combination of activities across paths whose sum of cost slopes is minimal.

Iterate : Recalculate network float and repeat until the target project duration is reached or all critical activities are crashed to their limits.

  • 5. Step-by-Step Worked Engineering Calculations
  • Worked Example 10.2.1: Full CPM Forward/Backward Pass with Total and Free Float

Problem : An industrial engineering workcell integration project has the activities, durations, and precedence constraints shown in the table below. Determine the critical path, project completion time, and the Total Float ( T F TF TF ) and Free Float ( F F FF FF ) for all activities.

  • Activity Predecessors Duration ( t t t , days)
  • A None 5
  • B None 6
  • C A 4
  • D A, B 7
  • E C, D 5
  • F D 3

Solution :

Forward Pass ( E S , E F = E S + t ES, EF = ES + t ES , EF = ES + t ) :

Activity A: No pred ⟹ E S A = 0 , E F A = 0 + 5 = 5 \implies ES_A = 0, EF_A = 0 + 5 = 5 ⟹ E S A ​ = 0 , E F A ​ = 0 + 5 = 5 .

Activity B: No pred ⟹ E S B = 0 , E F B = 0 + 6 = 6 \implies ES_B = 0, EF_B = 0 + 6 = 6 ⟹ E S B ​ = 0 , E F B ​ = 0 + 6 = 6 .

Activity C: Pred A ⟹ E S C = E F A = 5 , E F C = 5 + 4 = 9 \implies ES_C = EF_A = 5, EF_C = 5 + 4 = 9 ⟹ E S C ​ = E F A ​ = 5 , E F C ​ = 5 + 4 = 9 .

Activity D: Preds A, B ⟹ E S D = max ⁡ ( E F A , E F B ) = max ⁡ ( 5 , 6 ) = 6 , E F D = 6 + 7 = 13 \implies ES_D = \max(EF_A, EF_B) = \max(5, 6) = 6, EF_D = 6 + 7 = 13 ⟹ E S D ​ = max ( E F A ​ , E F B ​ ) = max ( 5 , 6 ) = 6 , E F D ​ = 6 + 7 = 13 .

Activity E: Preds C, D ⟹ E S E = max ⁡ ( E F C , E F D ) = max ⁡ ( 9 , 13 ) = 13 , E F E = 13 + 5 = 18 \implies ES_E = \max(EF_C, EF_D) = \max(9, 13) = 13, EF_E = 13 + 5 = 18 ⟹ E S E ​ = max ( E F C ​ , E F D ​ ) = max ( 9 , 13 ) = 13 , E F E ​ = 13 + 5 = 18 .

Activity F: Pred D ⟹ E S F = E F D = 13 , E F F = 13 + 3 = 16 \implies ES_F = EF_D = 13, EF_F = 13 + 3 = 16 ⟹ E S F ​ = E F D ​ = 13 , E F F ​ = 13 + 3 = 16 .

Project Completion Time : max ⁡ ( E F E , E F F ) = max ⁡ ( 18 , 16 ) = 18 days \max(EF_E, EF_F) = \max(18, 16) = 18\text{ days} max ( E F E ​ , E F F ​ ) = max ( 18 , 16 ) = 18 days .

Backward Pass ( L F , L S = L F − t LF, LS = LF - t L F , L S = L F − t ) :

Terminal activities are E and F ⟹ L F E = 18 , L F F = 18 \implies LF_E = 18, LF_F = 18 ⟹ L F E ​ = 18 , L F F ​ = 18 .

Activity E: L S E = 18 − 5 = 13 LS_E = 18 - 5 = 13 L S E ​ = 18 − 5 = 13 .

Activity F: L S F = 18 − 3 = 15 LS_F = 18 - 3 = 15 L S F ​ = 18 − 3 = 15 .

Activity D: Successors are E and F ⟹ L F D = min ⁡ ( L S E , L S F ) = min ⁡ ( 13 , 15 ) = 13 , L S D = 13 − 7 = 6 \implies LF_D = \min(LS_E, LS_F) = \min(13, 15) = 13, LS_D = 13 - 7 = 6 ⟹ L F D ​ = min ( L S E ​ , L S F ​ ) = min ( 13 , 15 ) = 13 , L S D ​ = 13 − 7 = 6 .

Activity C: Successor is E ⟹ L F C = L S E = 13 , L S C = 13 − 4 = 9 \implies LF_C = LS_E = 13, LS_C = 13 - 4 = 9 ⟹ L F C ​ = L S E ​ = 13 , L S C ​ = 13 − 4 = 9 .

Activity B: Successor is D ⟹ L F B = L S D = 6 , L S B = 6 − 6 = 0 \implies LF_B = LS_D = 6, LS_B = 6 - 6 = 0 ⟹ L F B ​ = L S D ​ = 6 , L S B ​ = 6 − 6 = 0 .

Activity A: Successors are C and D ⟹ L F A = min ⁡ ( L S C , L S D ) = min ⁡ ( 9 , 6 ) = 6 , L S A = 6 − 5 = 1 \implies LF_A = \min(LS_C, LS_D) = \min(9, 6) = 6, LS_A = 6 - 5 = 1 ⟹ L F A ​ = min ( L S C ​ , L S D ​ ) = min ( 9 , 6 ) = 6 , L S A ​ = 6 − 5 = 1 .

Float Calculations :

Activity A: T F = L S − E S = 1 − 0 = 1 TF = LS - ES = 1 - 0 = 1 TF = L S − ES = 1 − 0 = 1 . F F = min ⁡ ( E S C , E S D ) − E F A = min ⁡ ( 5 , 6 ) − 5 = 5 − 5 = 0 FF = \min(ES_C, ES_D) - EF_A = \min(5, 6) - 5 = 5 - 5 = 0 FF = min ( E S C ​ , E S D ​ ) − E F A ​ = min ( 5 , 6 ) − 5 = 5 − 5 = 0 .

Activity B: T F = 0 − 0 = 0 TF = 0 - 0 = 0 TF = 0 − 0 = 0 . F F = E S D − E F B = 6 − 6 = 0 FF = ES_D - EF_B = 6 - 6 = 0 FF = E S D ​ − E F B ​ = 6 − 6 = 0 . ( Critical )

Activity C: T F = 9 − 5 = 4 TF = 9 - 5 = 4 TF = 9 − 5 = 4 . F F = E S E − E F C = 13 − 9 = 4 FF = ES_E - EF_C = 13 - 9 = 4 FF = E S E ​ − E F C ​ = 13 − 9 = 4 .

Activity D: T F = 6 − 6 = 0 TF = 6 - 6 = 0 TF = 6 − 6 = 0 . F F = min ⁡ ( E S E , E S F ) − E F D = min ⁡ ( 13 , 13 ) − 13 = 0 FF = \min(ES_E, ES_F) - EF_D = \min(13, 13) - 13 = 0 FF = min ( E S E ​ , E S F ​ ) − E F D ​ = min ( 13 , 13 ) − 13 = 0 . ( Critical )

Activity E: T F = 13 − 13 = 0 TF = 13 - 13 = 0 TF = 13 − 13 = 0 . F F = 18 − 18 = 0 FF = 18 - 18 = 0 FF = 18 − 18 = 0 . ( Critical )

Activity F: T F = 15 − 13 = 2 TF = 15 - 13 = 2 TF = 15 − 13 = 2 . F F = 18 − 16 = 2 FF = 18 - 16 = 2 FF = 18 − 16 = 2 .

Engineering Conclusion : The critical path is B → \to → D → \to → E with a total project duration of 18 days .

Worked Example 10.2.2: PERT Project Variance and Deadline Probability

Problem : A supply chain automation project has an identified critical path comprising three sequential activities: X, Y, and Z. The 3-point time estimates in weeks are:

  • Activity X: a = 4 , m = 7 , b = 16 a = 4, m = 7, b = 16 a = 4 , m = 7 , b = 16
  • Activity Y: a = 6 , m = 11 , b = 22 a = 6, m = 11, b = 22 a = 6 , m = 11 , b = 22
  • Activity Z: a = 5 , m = 8 , b = 17 a = 5, m = 8, b = 17 a = 5 , m = 8 , b = 17

Calculate:

The expected duration ( t e t_e t e ​ ) and variance ( σ 2 \sigma^2 σ 2 ) for each activity.

The total expected project duration ( T e T_e T e ​ ) and project standard deviation ( σ P \sigma_P σ P ​ ).

The probability that the project finishes within 34 weeks ( T d = 34 T_d = 34 T d ​ = 34 ).

Solution :

Evaluate individual activity parameters:

Activity X: t e , X = 4 + 4 ( 7 ) + 16 6 = 4 + 28 + 16 6 = 48 6 = 8.0 weeks t_{e,X} = \frac{4 + 4(7) + 16}{6} = \frac{4 + 28 + 16}{6} = \frac{48}{6} = 8.0\text{ weeks} t e , X ​ = 6 4 + 4 ( 7 ) + 16 ​ = 6 4 + 28 + 16 ​ = 6 48 ​ = 8.0 weeks σ X = 16 − 4 6 = 2.0 ⟹ σ X 2 = 2.0 2 = 4.00 weeks 2 \sigma_X = \frac{16 - 4}{6} = 2.0 \implies \sigma_X^2 = 2.0^2 = 4.00\text{ weeks}^2 σ X ​ = 6 16 − 4 ​ = 2.0 ⟹ σ X 2 ​ = 2. 0 2 = 4.00 weeks 2

Activity Y: t e , Y = 6 + 4 ( 11 ) + 22 6 = 6 + 44 + 22 6 = 72 6 = 12.0 weeks t_{e,Y} = \frac{6 + 4(11) + 22}{6} = \frac{6 + 44 + 22}{6} = \frac{72}{6} = 12.0\text{ weeks} t e , Y ​ = 6 6 + 4 ( 11 ) + 22 ​ = 6 6 + 44 + 22 ​ = 6 72 ​ = 12.0 weeks σ Y = 22 − 6 6 = 16 6 = 2.667 ⟹ σ Y 2 = ( 16 6 ) 2 = 7.111 weeks 2 \sigma_Y = \frac{22 - 6}{6} = \frac{16}{6} = 2.667 \implies \sigma_Y^2 = \left(\frac{16}{6}\right)^2 = 7.111\text{ weeks}^2 σ Y ​ = 6 22 − 6 ​ = 6 16 ​ = 2.667 ⟹ σ Y 2 ​ = ( 6 16 ​ ) 2 = 7.111 weeks 2

Activity Z: t e , Z = 5 + 4 ( 8 ) + 17 6 = 5 + 32 + 17 6 = 54 6 = 9.0 weeks t_{e,Z} = \frac{5 + 4(8) + 17}{6} = \frac{5 + 32 + 17}{6} = \frac{54}{6} = 9.0\text{ weeks} t e , Z ​ = 6 5 + 4 ( 8 ) + 17 ​ = 6 5 + 32 + 17 ​ = 6 54 ​ = 9.0 weeks σ Z = 17 − 5 6 = 2.0 ⟹ σ Z 2 = 2.0 2 = 4.00 weeks 2 \sigma_Z = \frac{17 - 5}{6} = 2.0 \implies \sigma_Z^2 = 2.0^2 = 4.00\text{ weeks}^2 σ Z ​ = 6 17 − 5 ​ = 2.0 ⟹ σ Z 2 ​ = 2. 0 2 = 4.00 weeks 2

Compute project-level parameters: T e = ∑ t e , i = 8.0 + 12.0 + 9.0 = 29.0 weeks T_e = \sum t_{e,i} = 8.0 + 12.0 + 9.0 = 29.0\text{ weeks} T e ​ = ∑ t e , i ​ = 8.0 + 12.0 + 9.0 = 29.0 weeks σ P 2 = ∑ σ i 2 = 4.00 + 7.111 + 4.00 = 15.111 weeks 2 \sigma_P^2 = \sum \sigma_i^2 = 4.00 + 7.111 + 4.00 = 15.111\text{ weeks}^2 σ P 2 ​ = ∑ σ i 2 ​ = 4.00 + 7.111 + 4.00 = 15.111 weeks 2 σ P = 15.111 = 3.887 weeks \sigma_P = \sqrt{15.111} = 3.887\text{ weeks} σ P ​ = 15.111 ​ = 3.887 weeks

Determine probability of completion by T d = 34 T_d = 34 T d ​ = 34 weeks: Z = T d − T e σ P = 34 − 29.0 3.887 = 5.0 3.887 = + 1.286 ≈ 1.29 Z = \frac{T_d - T_e}{\sigma_P} = \frac{34 - 29.0}{3.887} = \frac{5.0}{3.887} = +1.286 \approx 1.29 Z = σ P ​ T d ​ − T e ​ ​ = 3.887 34 − 29.0 ​ = 3.887 5.0 ​ = + 1.286 ≈ 1.29

From the standard normal cumulative probability table: P ( T ≤ 34 ) = Φ ( 1.29 ) = 0.9015 = 90.15 % P(T \le 34) = \Phi(1.29) = 0.9015 = 90.15\% P ( T ≤ 34 ) = Φ ( 1.29 ) = 0.9015 = 90.15%

Engineering Conclusion : The project has a 90.15% probability of completing within 34 weeks.

Worked Example 10.2.3: Least-Cost Project Crashing Schedule

Problem : A plant upgrade network has two parallel paths: Path 1 is A → \to → C (Durations: A = 5 A = 5 A = 5 wks, C = 6 C = 6 C = 6 wks; Path length = 11 wks), and Path 2 is B → \to → D (Durations: B = 4 B = 4 B = 4 wks, D = 5 D = 5 D = 5 wks; Path length = 9 wks). Path 1 is currently the unique critical path (11 weeks). Activity data is given below:

  • Activity Normal Time Crash Time Normal Cost Crash Cost Available Crash
  • A 5 wks 3 wks $10,000 $16,000 2 wks
  • C 6 wks 4 wks $24,000 $34,000 2 wks
  • B 4 wks 2 wks $8,000 $12,000 2 wks
  • D 5 wks 3 wks $15,000 $21,000 2 wks

Executive leadership requires the project to be completed in 9 weeks (a 2-week reduction). What is the optimal sequence of activities to crash, and what is the minimum additional cost incurred?

Solution :

Calculate cost slopes for all activities:

Cost Slope A = 16 , 000 − 10 , 000 5 − 3 = 6 , 000 2 = $ 3 , 000 / wk \text{Cost Slope}_A = \frac{16,000 - 10,000}{5 - 3} = \frac{6,000}{2} = \text{\textdollar}3,000 / \text{wk} Cost Slope A ​ = 5 − 3 16 , 000 − 10 , 000 ​ = 2 6 , 000 ​ = $ 3 , 000/ wk

Cost Slope C = 34 , 000 − 24 , 000 6 − 4 = 10 , 000 2 = $ 5 , 000 / wk \text{Cost Slope}_C = \frac{34,000 - 24,000}{6 - 4} = \frac{10,000}{2} = \text{\textdollar}5,000 / \text{wk} Cost Slope C ​ = 6 − 4 34 , 000 − 24 , 000 ​ = 2 10 , 000 ​ = $ 5 , 000/ wk

Cost Slope B = 12 , 000 − 8 , 000 4 − 2 = 4 , 000 2 = $ 2 , 000 / wk \text{Cost Slope}_B = \frac{12,000 - 8,000}{4 - 2} = \frac{4,000}{2} = \text{\textdollar}2,000 / \text{wk} Cost Slope B ​ = 4 − 2 12 , 000 − 8 , 000 ​ = 2 4 , 000 ​ = $ 2 , 000/ wk

Cost Slope D = 21 , 000 − 15 , 000 5 − 3 = 6 , 000 2 = $ 3 , 000 / wk \text{Cost Slope}_D = \frac{21,000 - 15,000}{5 - 3} = \frac{6,000}{2} = \text{\textdollar}3,000 / \text{wk} Cost Slope D ​ = 5 − 3 21 , 000 − 15 , 000 ​ = 2 6 , 000 ​ = $ 3 , 000/ wk

Evaluate crashing from 11 weeks down to 9 weeks:

The critical path is Path 1 (A → \to → C, duration = 11 wks). Non-critical Path 2 (B → \to → D) has duration = 9 wks.

To reduce project duration, we must crash activities on the critical path. The candidates on Path 1 are Activity A ($3,000/wk) and Activity C ($5,000/wk).

Select Activity A because it has the lowest cost slope ($3,000/wk).

Activity A can be crashed by up to 2 weeks. Crashing Activity A by 2 weeks reduces Path 1 duration from 11 weeks to 9 weeks.

At 9 weeks, Path 1 (9 wks) and Path 2 (9 wks) both become critical simultaneously.

Total additional crashing cost: 2 weeks × $ 3 , 000 / week = $ 6 , 000 2\text{ weeks} \times \text{\textdollar}3,000 / \text{week} = \text{\textdollar}6,000 2 weeks × $ 3 , 000/ week = $ 6 , 000 .

Engineering Conclusion : Crash Activity A by 2 weeks for a total additional cost of $6,000 . Crashing Activity B or D is unnecessary because Path 2 was not critical.