Study guide

9.1 Project Scheduling, Network Analysis & Resource Management

CPA Program — Strategic Management Accounting Exam

Track your progress as you read

Finished sections get a check mark.

1 Chapter 1: Role of Strategic Management Accounting & Value Creation

1.1 Evolution & Role of the Strategic Management Accountant 1.2 Defining & Creating Multi-Stakeholder Value 1.3 The Strategic Management Process & Strategy Formation

2 Chapter 2: Strategic Analysis, Environmental Scanning & Professional Ethics

2.1 External Environmental Scanning: PESTEL & Porter's Five Forces 2.2 Internal Capability Analysis, VRIO & Core Competencies 2.3 Professional Ethics, Governance & Risk in Strategic Management Accounting

3 Chapter 3: Information Architecture, Systems & Behavioral Biases

3.1 Data, Information & Knowledge Architecture 3.2 Management Information Systems, ERP & Digital Technologies 3.3 Decision-Making Needs & Cognitive Biases 3.4 Stakeholder Communication, Sources & Information Integration 3.5 Assessing Information-System Deficiencies & Replacement Needs 3.6 Evaluating, Implementing & Reviewing Information Solutions

4 Chapter 4: Relevant Information, Tactical Decisions & Limiting Factors

4.1 Relevant Cost Analysis & Differential Decision-Making 4.2 Short-Term Tactical Decision Scenarios 4.3 Limiting Factors, Theory of Constraints & Throughput Accounting

5 Chapter 5: Strategic Planning, Master Budgets & Budgetary Control

5.1 Master Budget Architecture & Process 5.2 Financial Budgets & Cash Flow Forecasting 5.3 Budgetary Control & Flexible Budgeting 5.4 Service, Not-for-Profit & Departmental Budgets

6 Chapter 6: Modern Budgeting Methodologies & Behavioral Dynamics

6.1 Alternative Budgeting Systems: ZBB, ABB & Rolling Budgets 6.2 Beyond Budgeting Principles & Dynamic Forecasting 6.3 Behavioral Dimensions of Budgeting

7 Chapter 7: Standard Costing & Comprehensive Variance Analysis

7.1 Standard Cost Setting & Direct Cost Variances 7.2 Overhead Variance Analysis 7.3 Sales Variances: Price, Volume, Mix & Quantity 7.4 Planning vs Operational Variances & Variance Investigation

8 Chapter 8: Project Selection, Governance & Financial Appraisal

8.1 Project Fundamentals, Governance & Life Cycle 8.2 Project Selection & Strategic Alignment 8.3 Capital Investment Appraisal Techniques 8.4 Project Structures, Teams, Supplier Contracts & Probity

9 Chapter 9: Project Scheduling, Earned Value Management & Risk

9.1 Project Scheduling, Network Analysis & Resource Management 9.2 Earned Value Management (EVM) & Project Control 9.3 Project Risk Management, Methodologies & Post-Completion Review 9.4 Completion Decisions, Acceptance, Financial Closure & Knowledge

10 Chapter 10: Performance Management Systems & Responsibility Centers

10.1 Management Control Systems & Simons' Levers of Control 10.2 Responsibility Accounting & Organizational Design 10.3 Designing Effective Key Performance Indicators (KPIs)

11 Chapter 11: Divisional Financial Performance & Transfer Pricing

11.1 Return on Investment (ROI) & Residual Income (RI) 11.2 Economic Value Added (EVA) 11.3 Transfer Pricing in Decentralized Organizations

12 Chapter 12: Strategic Performance Frameworks & Executive Incentives

12.1 The Balanced Scorecard Framework 12.2 Strategy Maps & Causal Linkages 12.3 Multidimensional Performance Frameworks 12.4 Executive Compensation, Incentive Systems & Agency Theory

13 Chapter 13: Strategic Cost Management, Value Chains & Activity-Based Costing

13.1 Strategic Cost Management & Value Chain Analysis 13.2 Activity-Based Costing (ABC) Mechanics 13.3 Activity-Based Management (ABM) & Time-Driven ABC

14 Chapter 14: Strategic Pricing, Target Costing & Life-Cycle Costing

14.1 Strategic Pricing Decisions & Policies 14.2 Target Costing & Kaizen Costing 14.3 Life-Cycle Costing & Environmental Management Accounting

15 Chapter 15: Customer Profitability, Lean Supply Chains & Quality Costs

15.1 Customer Profitability Analysis & Cost-to-Serve 15.2 Supply Chain Management & Lean Operations 15.3 Cost of Quality (COQ) Framework & Total Quality Management 15.4 Outsourcing, Offshoring & Downsizing Decisions

9.1 Project Scheduling, Network Analysis & Resource Management

Key Takeaways Explain This Topic AI

The Work Breakdown Structure (WBS) enforces the 100% rule by decomposing the complete project scope into hierarchical, mutually exclusive work packages and control accounts.

The Critical Path Method (CPM) identifies the longest path of dependent activities through forward and backward pass algorithms; critical activities possess zero total float and dictate overall project duration.

Total Float measures scheduling flexibility without delaying final project completion, whereas Free Float measures delay tolerance without impacting the early start of any immediate successor activity.

Program Evaluation and Review Technique (PERT) incorporates duration uncertainty using 3-point beta estimates to compute expected activity times, critical path variances, and milestone completion probabilities via the Central Limit Theorem.

Resource optimization balances activity schedules against capacity limits: resource leveling shifts non-critical activities within float to smooth peaks, while project crashing accelerates critical activities with the lowest cost-time slope.

Last updated: October 2026

Project Scheduling, Network Analysis & Resource Management

Capital expenditure projects and strategic transformations—such as enterprise software deployments, production line automations, and corporate reorganizations—represent major commitments of enterprise capital. For the strategic management accountant, project governance extends far beyond passive cost logging. It requires active participation in scheduling, network dependency analysis, critical path determination, and resource optimization to safeguard return on invested capital.

Flawed scheduling leads to schedule slippage, penalty clauses, opportunity costs from delayed commercial launches, and budget blowouts. Management accountants must therefore understand the quantitative tools that govern project duration, identify operational bottlenecks, and evaluate the financial trade-offs between project time and total cost.

The Work Breakdown Structure (WBS)

The foundation of all project scheduling, budgeting, and control is the Work Breakdown Structure (WBS) . The WBS is a deliverable-oriented hierarchical decomposition of the total scope of work to be carried out by the project team to accomplish project objectives and create required deliverables.

The 100% Rule

A foundational axiom of WBS design is the 100% Rule , which stipulates that the WBS must capture 100% of the scope defined by the project charter and approved specifications—including project management, testing, and regulatory documentation—and nothing more. The sum of work at each subordinate level must roll up precisely to 100% of the parent deliverable without overlap or omission.

Key Structural Components

Control Accounts: Management control points positioned above work packages where scope, budget (Planned Value), and actual costs are integrated and compared against earned value for performance measurement.

Work Packages: The lowest level of the WBS hierarchy. A work package represents a discrete deliverable with an identifiable owner, an estimated duration, and an assignable cost budget. As a standard rule of thumb, work packages should follow the "8/80 rule" (requiring no fewer than 8 hours and no more than 80 hours of effort) to ensure governance without micromanagement.

WBS Dictionary: A detailed repository providing operational descriptions of each work package, including milestone dates, resource requirements, quality acceptance criteria, prerequisites, and cost account codes.

Project Scheduling Tools: Gantt Charts vs Network Diagrams

Once work packages are decomposed into discrete activities, project controllers construct scheduling models using two primary visual and analytical tools:

Scheduling Tool Structural Representation Primary Strengths Strategic Limitations

Gantt Chart Horizontal bar chart mapped against a calendar timeline Intuitive visual clarity; outstanding for communicating milestones and operational schedules to senior executives and non-technical stakeholders Obscures intricate interdependencies in complex multi-tier projects; fails to show how a delay in a non-critical activity shifts secondary paths

Network Diagram (AON / CPM) Directed graph where nodes represent activities and arrows depict logical dependencies Mathematically models sequential dependencies; calculates critical paths, earliest/latest timings, and float buffers Visually abstract; lacks direct calendar mapping without dedicated scheduling software overlay

Critical Path Method (CPM) and Activity-on-Node (AON) Analysis

The Critical Path Method (CPM) is a deterministic scheduling algorithm that identifies the sequence of dependent activities determining the absolute minimum total project duration. In contemporary project management, CPM is modeled using the Activity-on-Node (AON) convention, where each node displays six fundamental scheduling values:

Early Start ( E S ES ES ): The earliest calendar point an activity can commence, given predecessor completions.

Early Finish ( E F EF EF ): The earliest calendar point an activity can complete ( E F = E S + Duration EF = ES + \text{Duration} EF = ES + Duration ).

Late Start ( L S LS L S ): The latest calendar point an activity can commence without delaying the total project deadline.

Late Finish ( L F LF L F ): The latest calendar point an activity can complete without delaying the total project deadline ( L S = L F − Duration LS = LF - \text{Duration} L S = L F − Duration ).

Activity Duration ( D D D ): Estimated working time required.

Total Float ( T F TF TF ): Permissible delay buffer.

Forward Pass Algorithm (Earliest Times)

The forward pass moves from project start to finish to establish the earliest possible timings:

For the initial activity: E S = 0 ES = 0 ES = 0 .

For all subsequent activities: E S = max ⁡ ( E F immediate predecessors ) ES = \max(EF_{\text{immediate predecessors}}) ES = max ( E F immediate predecessors ​ ) .

For every activity: E F = E S + D EF = ES + D EF = ES + D .

Backward Pass Algorithm (Latest Times)

The backward pass moves from project completion back to the start to determine latest permissible timings:

For the final activity: L F = E F project completion LF = EF_{\text{project completion}} L F = E F project completion ​ .

For all preceding activities: L F = min ⁡ ( L S immediate successors ) LF = \min(LS_{\text{immediate successors}}) L F = min ( L S immediate successors ​ ) .

For every activity: L S = L F − D LS = LF - D L S = L F − D .

The Critical Path

The Critical Path is the continuous chain of dependent activities connecting project initiation to completion that has the longest aggregate duration. Crucially:

Activities on the critical path possess zero Total Float ( T F = 0 TF = 0 TF = 0 ).

Any delay in a critical path activity causes a day-for-day delay in final project completion.

A project may have multiple critical paths of equal duration, which increases exposure to delay across more activities.

Float Analysis: Total Float vs Free Float

Float (or slack) represents the scheduling flexibility inherent in non-critical activities. Strategic management accountants distinguish rigorously between two types of float: 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) = min ⁡ ( E S immediate successors ) − E F \text{Free Float (FF)} = \min(ES_{\text{immediate successors}}) - EF Free Float (FF) = min ( E S immediate successors ​ ) − EF

Attribute Total Float ( T F TF TF ) Free Float ( F F FF FF )

Definition The time an activity can slip without delaying the final project completion date The time an activity can slip without delaying the Early Start of any immediate successor activity

Calculation Formula T F = L S − E S TF = LS - ES TF = L S − ES or L F − E F LF - EF L F − EF F F = min ⁡ ( E S successors ) − E F FF = \min(ES_{\text{successors}}) - EF FF = min ( E S successors ​ ) − EF

Ownership / Sharing Shared across all activities along a continuous non-critical path Exclusively owned by the specific individual activity

Consequence of Exceeding Delays the final project deadline, pushing the project past its scheduled completion Delays successor activities into their own float, but does not immediately threaten final completion

Managerial Action Monitor closely; consuming total float turns non-critical paths into new critical paths Reallocate resources from high free-float tasks to critical path activities without schedule disruption

Program Evaluation and Review Technique (PERT)

While CPM is deterministic (assuming fixed durations), capital projects frequently face high technological or operational uncertainty. The Program Evaluation and Review Technique (PERT) addresses this by adopting a three-point probabilistic beta distribution for activity durations:

Optimistic Time ( o o o ): Minimum duration under ideal conditions.

Most Likely Time ( m m m ): Best estimate under normal operating circumstances.

Pessimistic Time ( p p p ): Maximum duration under adverse conditions (excluding extraordinary catastrophes).

Expected Duration and Variance Formulas μ = o + 4 m + p 6 \mu = \frac{o + 4m + p}{6} μ = 6 o + 4 m + p ​ σ = p − o 6 \sigma = \frac{p - o}{6} σ = 6 p − o ​ σ 2 = ( p − o 6 ) 2 \sigma^2 = \left(\frac{p - o}{6}\right)^2 σ 2 = ( 6 p − o ​ ) 2

Critical Path Aggregation & Central Limit Theorem

Under a simplifying approximation with independent activity durations and a fixed controlling path, the sum of expected durations along the critical path approximates a normal distribution. The overall project expected duration ( μ proj \mu_{\text{proj}} μ proj ​ ) and variance ( σ proj 2 \sigma_{\text{proj}}^2 σ proj 2 ​ ) equal the sum of critical path values: μ proj = ∑ i ∈ Critical μ i \mu_{\text{proj}} = \sum_{i \in \text{Critical}} \mu_i μ proj ​ = i ∈ Critical ∑ ​ μ i ​ σ proj 2 = ∑ i ∈ Critical σ i 2 \sigma_{\text{proj}}^2 = \sum_{i \in \text{Critical}} \sigma_i^2 σ proj 2 ​ = i ∈ Critical ∑ ​ σ i 2 ​ σ proj = σ proj 2 \sigma_{\text{proj}} = \sqrt{\sigma_{\text{proj}}^2} σ proj ​ = σ proj 2 ​ ​

To calculate the probability of completing the project within a target deadline ( T T T ), compute the standard normal Z-score: Z = T − μ proj σ proj Z = \frac{T - \mu_{\text{proj}}}{\sigma_{\text{proj}}} Z = σ proj ​ T − μ proj ​ ​

Resource Optimization: Leveling vs Crashing

Project managers must reconcile CPM network logic with finite labor, equipment, and cash resources.

Resource Loading and Resource Leveling

Resource Loading: Tabulating the required quantities of specific labor, machinery, or technical skills across each calendar time period.

Resource Smoothing and Leveling: Smoothing shifts activities within available float while preserving the completion date. Leveling changes activity dates to respect resource limits and may extend completion or change the critical path.

Project Crashing Economics

When commercial pressures dictate accelerating a project, management evaluates project crashing —shortening critical activity durations by deploying additional capital, overtime, or secondary equipment. Strategic management accounting evaluates crashing strictly through incremental cost-benefit analysis: Crash Cost per Unit Time = Crash Cost − Normal Cost Normal Time − Crash Time \text{Crash Cost per Unit Time} = \frac{\text{Crash Cost} - \text{Normal Cost}}{\text{Normal Time} - \text{Crash Time}} Crash Cost per Unit Time = Normal Time − Crash Time Crash Cost − Normal Cost ​

Economic Crashing Principles:

Crash only critical path activities. Shortening a non-critical activity spends capital without reducing project duration.

Select the critical activity with the lowest crash cost per unit time.

Monitor secondary critical paths. As the critical path is compressed, non-critical paths will eventually become critical, requiring simultaneous crashing across multiple parallel paths.

Fast-Tracking Alternative: Overlapping sequential activities (e.g., commencing software coding before design sign-off). Fast-tracking may avoid the planned extra resource cost of crashing, but can add coordination costs and rework risk; it is not guaranteed to be free.

Corporate Application: Australasian Supply Chains Ltd (ASC)

Australasian Supply Chains Ltd (ASC) is constructing an automated regional fulfillment center with an approved baseline deadline of 28 weeks. The strategic management accountant evaluated the following 7 activities:

Activity Description Predecessor Normal Duration ( D D D ) Normal Cost Crash Duration Crash Cost Cost per Week Saved

  • A Site Prep & Power Retrofit None 4 weeks $40,000 3 weeks $55,000 $15,000
  • B Robotics Hardware Fab A 6 weeks $90,000 4 weeks $130,000 $20,000
  • C Cloud WMS Architecture A 8 weeks $120,000 6 weeks $160,000 $20,000
  • D Conveyor Line Setup B 5 weeks $50,000 3 weeks $80,000 $15,000
  • E API & Database Integration C 7 weeks $90,000 5 weeks $114,000 $12,000
  • F Systems Integration D, E 4 weeks $60,000 3 weeks $85,000 $25,000
  • G Commissioning & UAT F 3 weeks $30,000 2 weeks $50,000 $20,000
  • Forward and Backward Pass Network Computation

Path 1 (Hardware): A → \rightarrow → B → \rightarrow → D → \rightarrow → F → \rightarrow → G = 4 + 6 + 5 + 4 + 3 = 22 4 + 6 + 5 + 4 + 3 = 22 4 + 6 + 5 + 4 + 3 = 22 weeks.

Path 2 (Software): A → \rightarrow → C → \rightarrow → E → \rightarrow → F → \rightarrow → G = 4 + 8 + 7 + 4 + 3 = 26 4 + 8 + 7 + 4 + 3 = 26 4 + 8 + 7 + 4 + 3 = 26 weeks.

The Critical Path is Path 2 (A → \rightarrow → C → \rightarrow → E → \rightarrow → F → \rightarrow → G) with a project duration of 26 weeks .

Activity E S ES ES E F EF EF L S LS L S L F LF L F Total Float ( T F TF TF ) Free Float ( F F FF FF ) Critical Status

  • A 0 4 0 4 0 0 Critical
  • B 4 10 8 14 4 0 Non-critical
  • C 4 12 4 12 0 0 Critical
  • D 10 15 14 19 4 4 Non-critical
  • E 12 19 12 19 0 0 Critical
  • F 19 23 19 23 0 0 Critical
  • G 23 26 23 26 0 0 Critical

Float Diagnostic: Notice Activity B has T F = 4 TF = 4 TF = 4 weeks, but F F = 0 FF = 0 FF = 0 weeks ( E S D − E F B = 10 − 10 = 0 ES_D - EF_B = 10 - 10 = 0 E S D ​ − E F B ​ = 10 − 10 = 0 ). If Activity B slips by 2 weeks, it will not delay the 26-week project deadline, but it will immediately push Activity D's start date from week 10 to week 12.

PERT Probability Analysis

For the critical path activities, engineering supplied three-point estimates:

Activity A: o = 2 , m = 4 , p = 6 → μ A = 4.0 , σ A 2 = ( ( 6 − 2 ) / 6 ) 2 = 0.444 o=2, m=4, p=6 \rightarrow \mu_A = 4.0, \sigma_A^2 = ((6-2)/6)^2 = 0.444 o = 2 , m = 4 , p = 6 → μ A ​ = 4.0 , σ A 2 ​ = (( 6 − 2 ) /6 ) 2 = 0.444

Activity C: o = 5 , m = 8 , p = 11 → μ C = 8.0 , σ C 2 = ( ( 11 − 5 ) / 6 ) 2 = 1.000 o=5, m=8, p=11 \rightarrow \mu_C = 8.0, \sigma_C^2 = ((11-5)/6)^2 = 1.000 o = 5 , m = 8 , p = 11 → μ C ​ = 8.0 , σ C 2 ​ = (( 11 − 5 ) /6 ) 2 = 1.000

Activity E: o = 4 , m = 7 , p = 10 → μ E = 7.0 , σ E 2 = ( ( 10 − 4 ) / 6 ) 2 = 1.000 o=4, m=7, p=10 \rightarrow \mu_E = 7.0, \sigma_E^2 = ((10-4)/6)^2 = 1.000 o = 4 , m = 7 , p = 10 → μ E ​ = 7.0 , σ E 2 ​ = (( 10 − 4 ) /6 ) 2 = 1.000

Activity F: o = 2.5 , m = 4 , p = 5.5 → μ F = 4.0 , σ F 2 = ( ( 5.5 − 2.5 ) / 6 ) 2 = 0.250 o=2.5, m=4, p=5.5 \rightarrow \mu_F = 4.0, \sigma_F^2 = ((5.5-2.5)/6)^2 = 0.250 o = 2.5 , m = 4 , p = 5.5 → μ F ​ = 4.0 , σ F 2 ​ = (( 5.5 − 2.5 ) /6 ) 2 = 0.250

Activity G: o = 1.5 , m = 3 , p = 4.5 → μ G = 3.0 , σ G 2 = ( ( 4.5 − 1.5 ) / 6 ) 2 = 0.250 o=1.5, m=3, p=4.5 \rightarrow \mu_G = 3.0, \sigma_G^2 = ((4.5-1.5)/6)^2 = 0.250 o = 1.5 , m = 3 , p = 4.5 → μ G ​ = 3.0 , σ G 2 ​ = (( 4.5 − 1.5 ) /6 ) 2 = 0.250 μ proj = 4.0 + 8.0 + 7.0 + 4.0 + 3.0 = 26.0 weeks \mu_{\text{proj}} = 4.0 + 8.0 + 7.0 + 4.0 + 3.0 = 26.0 \text{ weeks} μ proj ​ = 4.0 + 8.0 + 7.0 + 4.0 + 3.0 = 26.0 weeks σ proj 2 = 0.444 + 1.000 + 1.000 + 0.250 + 0.250 = 2.944 weeks 2 \sigma_{\text{proj}}^2 = 0.444 + 1.000 + 1.000 + 0.250 + 0.250 = 2.944 \text{ weeks}^2 σ proj 2 ​ = 0.444 + 1.000 + 1.000 + 0.250 + 0.250 = 2.944 weeks 2 σ proj = 2.944 = 1.716 weeks \sigma_{\text{proj}} = \sqrt{2.944} = 1.716 \text{ weeks} σ proj ​ = 2.944 ​ = 1.716 weeks

Probability of completing before the contract penalty deadline of 28.0 weeks: Z = 28.0 − 26.0 1.716 = + 1.166 Z = \frac{28.0 - 26.0}{1.716} = +1.166 Z = 1.716 28.0 − 26.0 ​ = + 1.166

Consulting standard normal probability tables, P ( Z ≤ 1.17 ) ≈ 87.9 % P(Z \le 1.17) \approx 87.9\% P ( Z ≤ 1.17 ) ≈ 87.9% . The fixed-path normal approximation estimates about 87.9% on-time completion. Correlated durations and a different path becoming critical can change the result; simulation is useful where those effects matter.

Project Crashing Decision

If a retail tenant offers a $40,000 bonus to complete in 24 weeks (compressing 2 weeks):

Critical path options: A ($15k/wk), C ($20k/wk), E ($12k/wk), F ($25k/wk), G ($20k/wk).

Activity E has the lowest crash cost per week ($12,000) and can be crashed by up to 2 weeks.

Crashing Activity E by 2 weeks reduces project duration to 24 weeks at an incremental cost of 2 × $12,000 = $24,000.

The non-critical hardware path is 22 weeks, so Path 2 remains the critical path at 24 weeks.

Net financial gain: $40,000 bonus - $24,000 crash cost = +$16,000.

Exam Traps to Avoid

Warning

Common Exam Trap 1: Conflating Total Float with Free Float. An activity can have substantial Total Float while having zero Free Float. Delaying an activity with zero Free Float immediately delays downstream activities, which can create acute operational bottlenecks on shared resources even if the project deadline is technically preserved.

Note

Common Exam Trap 2: Adding non-critical activity variances into the PERT project variance. In the fixed-path independent-activity approximation, sum only variances on that path. This is not an exact rule for an uncertain network: other paths can become controlling, and correlations require covariance terms.

Loading diagram... Activity-on-Node Network Diagram & Critical Path