Critical Path Method Calculations

Introduction

The Critical Path Method (CPM) is a deterministic scheduling technique used to calculate the duration of a project, identify activities that control the completion date, and determine the amount of scheduling flexibility available for noncritical activities. Although CPM is often introduced as a computational procedure, its managerial value lies in interpreting the results: a project manager can distinguish activities requiring close control from those that can absorb delay without immediately affecting the project completion date.

CPM is based on a logically connected network of activities. Each activity has a defined duration, and precedence relationships specify which activities must be completed before others can begin. The principal calculations are the forward pass, which determines early dates, and the backward pass, which determines late dates. Comparing these dates yields float, identifies critical activities and paths, and establishes the minimum theoretically achievable project duration under the stated assumptions.

The method is deterministic: each activity duration is treated as a single estimate. Consequently, CPM is most appropriate when durations are sufficiently predictable or when management requires a baseline schedule for planning and control. Where substantial duration uncertainty exists, CPM may be complemented by probabilistic methods such as PERT, simulation, or Monte Carlo analysis.

Learning Objectives

By the end of this chapter, the reader should be able to:

1. Explain the logic and terminology of activity-on-node project networks.
2. Perform forward-pass calculations for early start and early finish dates.
3. Perform backward-pass calculations for late start and late finish dates.
4. Calculate total float and identify critical and near-critical paths.
5. Interpret project duration and assess the managerial significance of critical-path information.
6. Recognize the assumptions, limitations and governance implications of CPM calculations.

1. Network Logic and Scheduling Conventions

In the commonly used activity-on-node (AON) convention, each node or box represents an activity, while arrows represent precedence relationships. For example, if activity A must finish before activity B can begin, the relationship is written A → B. Unless otherwise stated, this chapter uses a finish-to-start relationship with zero lag.

Important terms include:

• Predecessor: an activity that must occur before another activity.
• Successor: an activity that follows another activity.
• Duration (d): the planned time required to perform an activity, measured in consistent units such as working days.
• Path: a sequence of connected activities through the network.
• Critical path: a continuous path with the greatest total duration and, under the standard CPM assumptions, zero total float.
• Float or slack: scheduling flexibility available to an activity without violating a specified scheduling constraint.
• Milestone: a zero-duration event used to mark a significant point, such as approval or completion.
• Near-critical path: a path with small positive float and therefore significant risk of becoming critical.

A valid network should have clear start and finish points, unambiguous precedence logic, and no circular relationships. A circular relationship, such as A requiring B and B requiring A, makes the schedule logically impossible.

Scheduling conventions

Two common conventions are used for the time origin:

1. Zero-based convention: the project starts at time 0. An activity of duration 5 beginning at time 0 finishes at time 5.
2. One-based period convention: the first working period is labelled 1. In this convention, an activity’s finish period may be calculated as ES + duration − 1.

This chapter uses the zero-based convention because it makes elapsed-time calculations transparent. If an organisation uses period labels, the underlying logic remains the same, but the displayed dates must be converted consistently.

2. Forward Pass: Calculating Early Dates

The forward pass proceeds from the beginning of the network toward the finish. It calculates the earliest feasible times at which activities can start and finish, assuming that all predecessors occur as planned and that resources are available when required.

The principal variables are:

For an activity with no predecessor, the standard initial condition is:

For every activity, the early finish is:

For an activity with one or more predecessors, its early start is the largest early finish among its immediate predecessors:

The maximum is required because the activity cannot begin until all predecessors have finished. The predecessor finishing last controls the earliest possible start.

Forward-pass procedure

1. Begin with the first activity or activities.
2. Set ES to zero, unless a different project start constraint is specified.
3. Add the duration to ES to obtain EF.
4. Move forward through the network.
5. For each activity with multiple predecessors, select the largest predecessor EF as its ES.
6. Continue until the final activity is reached.
7. The largest EF at the project finish represents the earliest project completion time, provided all terminal activities are connected to the project finish.

The calculation assumes that the activity can start immediately when its predecessors have finished. It does not automatically account for resource limitations, calendars, mandatory waiting periods, or external constraints.

3. Backward Pass: Calculating Late Dates

The backward pass proceeds from the end of the network toward the beginning. It determines the latest times activities can occur without extending the calculated project completion date.

The principal variables are:

For a final activity, its late finish is normally set equal to the project duration:

Late start is calculated as:

For an activity with one or more immediate successors, its late finish is the smallest late start among those successors:

The minimum is required because the activity must finish in time for every successor to begin by its latest allowable start. The successor with the earliest LS imposes the strongest restriction.

Backward-pass procedure

1. Determine the project duration T from the forward pass.
2. Set the LF of each terminal activity to T, or apply a specified finish constraint.
3. Calculate LS = LF − duration.
4. Move backward through the network.
5. For each activity with multiple successors, select the smallest successor LS as its LF.
6. Continue until the initial activity or activities are reached.

A schedule is internally consistent when each activity’s late dates respect the logic of its successors and the project completion constraint.

4. Float, Critical Activities and Critical Paths

The most commonly used measure is total float, the amount of time an activity can be delayed without delaying the project completion date, assuming the remainder of the schedule is managed according to the CPM dates.

Total float can be calculated in either of two equivalent ways:

or

The two expressions should produce the same result when the network and calculations are consistent. Because LS and ES, and LF and EF, are measured in the same time units, total float also has units of time.

An activity is conventionally classified as critical when:

A critical path is a continuous start-to-finish path composed of critical activities. Its duration equals the project duration. There may be more than one critical path. Multiple critical paths increase schedule risk because delay on any one of them may delay the project.

In practice, a small rounding tolerance may be used. For example, if calculations involving fractional days produce a float of 0.01 days, the scheduling system may treat it as zero. The tolerance must be documented rather than applied informally.

Near-critical paths

A near-critical path has positive but small float. There is no universal threshold: a project team may define near-critical as a path with less than five days of float, less than 10% of project duration, or another risk-based criterion. Near-critical paths deserve active monitoring because modest duration growth, resource disruption, or logic changes can consume their float.

Free float

Where required, free float measures the delay possible for an activity without delaying the early start of any immediate successor. For an activity with successors:

For a terminal activity, free float depends on the project finish constraint. Free float cannot exceed total float under the standard CPM network conditions. Total float is generally the more important measure for project completion control.

5. Complete Worked Example

Consider the following illustrative project network. Durations are in working days, and the project starts at time 0.

The principal paths are A–B–D–F–H and A–B–E–F–H, while G joins the network through E and converges at H.

Forward pass

The earliest project completion is therefore 22 working days.

Backward pass

Set LF(H) = 22. Then calculate backward:

Float analysis

The critical activities are A, B, E, F and H. Thus, the critical path is:

A → B → E → F → H

Its duration is 4 + 6 + 4 + 5 + 3 = 22 working days. The path A–B–D–F–H has duration 21 days and one day of float, so it is near-critical. Activity C also has one day of total float, while G has three days. A one-day delay in C or D would consume its available float; a further delay could affect project completion. A two-day increase in D, for example, would make the alternative path critical unless other activities changed.

6. Interpreting Results for Project Control

CPM outputs are not merely calendar dates. They support several management decisions.

Prioritising monitoring

Critical activities require close attention because their delay has no calculated schedule protection. However, focusing exclusively on current critical activities is poor practice. Near-critical activities may become critical as durations change, and the critical path can shift during execution.

Allocating management attention and resources

When resources are constrained, managers may consider assigning additional resources to critical activities. This is known as crashing when extra resources are used to shorten duration. Crashing is not automatically beneficial: the manager must compare the incremental cost with the value of earlier completion and assess whether shortening one activity creates a different critical path.

Fast tracking overlaps activities that were originally planned sequentially. It can reduce duration but may increase rework, coordination risk and quality exposure. Neither crashing nor fast tracking should be applied without validating technical feasibility and revised logic.

Understanding schedule flexibility

Float is not an entitlement to delay work. A team may consume float for legitimate reasons, but doing so reduces resilience. Float can also be shared across a chain of activities, and activity-level float should not be interpreted without considering the path and resource plan.

Baseline and actual schedule comparison

A baseline CPM schedule expresses the approved plan. During execution, actual start and finish dates, remaining durations, approved changes and revised logic should be entered into the schedule. The resulting forecast critical path may differ from the baseline critical path. Schedule control therefore requires periodic recalculation rather than reliance on the original critical path.

7. Assumptions and Limitations

Standard CPM calculations rely on several assumptions:

1. Activity durations are sufficiently reliable to be represented by single values.
2. Precedence relationships are complete and logically correct.
3. Activities can begin when their predecessors and other constraints permit.
4. The resource supply is adequate, or resource constraints are handled separately.
5. Calendars, lags, leads and external dates are correctly represented.
6. The network has a defined start and finish and contains no circular logic.

These assumptions limit interpretation. A purely logical CPM network may produce an apparently feasible schedule that cannot be executed because the same specialist is assigned simultaneously to several activities. Resource-constrained scheduling is therefore a separate but related analysis. Likewise, uncertainty in estimates means that a zero-float path is not necessarily the path most likely to finish last. A path with uncertain activities may deserve greater risk attention than a deterministic critical path.

Other limitations include:

• Estimate sensitivity: small changes in duration can shift the critical path.
• Logic quality: missing dependencies produce misleading float.
• Calendar complexity: working calendars, holidays and time zones can alter date calculations.
• Multiple constraints: contractual dates or imposed deadlines can create negative float.
• Scope change: approved changes can invalidate earlier calculations.
• Overconfidence: CPM indicates mathematical schedule flexibility, not certainty of delivery.

Negative total float occurs when an imposed completion requirement is earlier than the earliest date permitted by the current network. It is a warning that the schedule cannot meet the constraint without changing scope, logic, resources, durations or the required date.

8. Technology, Data Quality and Governance

Modern project-management information systems automatically perform forward and backward passes, display float, and highlight critical paths. Some tools also provide schedule health checks, baseline comparisons and scenario analysis. Artificial intelligence can assist with anomaly detection, duration forecasting and identification of missing dependencies, but it should not replace professional validation. An algorithm trained on historical data may reproduce biased estimates or conceal unusual project conditions.

Good governance requires:

• documented duration-estimation methods;
• traceable sources for activity logic and constraints;
• controlled baseline changes;
• version history and approval records;
• explicit treatment of assumptions and calendars;
• independent review of high-impact schedule changes; and
• transparent communication of uncertainty.

A schedule should not be manipulated to show a desired completion date. Compressing durations without evidence, hiding dependencies, or redefining milestones to avoid reporting delay undermines decision quality and may breach contractual or professional obligations. Schedule data should be treated as an important management record, particularly in regulated, safety-critical or publicly funded projects.

9. Illustrative Case: Hospital Diagnostic-Unit Upgrade

Background

A hospital plans to upgrade a diagnostic unit while maintaining essential services. The work includes requirements confirmation, equipment procurement, room modification, software configuration, integration testing and regulatory acceptance. The project sponsor requires a reliable forecast because the unit must be operational before a seasonal demand increase.

Problem

The initial schedule shows a 30-day project duration and identifies equipment procurement as critical. During review, the team discovers that software configuration and room modification both precede integration testing, while regulatory acceptance follows testing. The original network omitted the room-modification dependency and therefore overstated available float.

Analysis

The project team reconstructs the AON network, verifies each relationship with the clinical, facilities and supplier teams, and standardises all durations to working days. A forward pass identifies the earliest completion. A backward pass is then performed from the sponsor’s required completion date. The analysis reveals two paths with only one day of float. Although procurement remains on the longest path, facilities work is near-critical and has a higher uncertainty because access to the room depends on hospital operations.

Approach and solution

The team establishes weekly reviews for both critical and near-critical paths, obtains a confirmed room-access window, and creates a contingency for software integration. Rather than simply shortening procurement, the team protects the facilities activity through an approved access plan. Any use of float requires notification because it may remove the project’s limited schedule resilience.

Outcome

The revised schedule provides a more credible completion forecast and makes the principal risk visible to the sponsor. The project finishes within the required window, but the team records that the critical path shifted after a supplier delivery changed. This reinforces the need to recalculate the network whenever actual performance or approved logic changes.

Learning points

1. Critical-path results are only as reliable as the network logic and estimates.
2. Near-critical work can be operationally more important than a currently critical activity.
3. Stakeholder validation is essential when dependencies cross organisational boundaries.
4. CPM supports decisions, but it does not eliminate uncertainty or resource risk.

Best-Practice Checklist

Before relying on CPM results, a project manager should:

1. Confirm that every activity has a clear scope and duration.
2. Validate predecessors and successors with subject-matter experts.
3. Check for missing, redundant or circular logic.
4. Use consistent calendars and time units.
5. Complete both forward and backward passes.
6. Reconcile ES + duration with EF and LF − duration with LS.
7. Identify all critical and near-critical paths.
8. Review resource feasibility and external constraints.
9. Document assumptions, float thresholds and baseline changes.
10. Recalculate after significant actual progress, approved change or risk occurrence.

Chapter Summary

The Critical Path Method calculates the earliest and latest feasible dates for project activities. The forward pass moves from start to finish and uses the maximum predecessor EF to determine each activity’s ES. The backward pass moves from finish to start and uses the minimum successor LS to determine each activity’s LF. Early finish equals early start plus duration, while late start equals late finish minus duration.

Total float is calculated as LS − ES or LF − EF. Activities with zero float form one or more critical paths, whose duration establishes the project’s earliest completion under the stated assumptions. Activities with small positive float are near-critical and require monitoring because modest delay may make them critical. CPM results depend on accurate durations, complete logic, consistent calendars and appropriate constraints. They must therefore be interpreted alongside resource availability, uncertainty, risk and governance requirements.

Key Terms

Critical Path Method: A deterministic technique for analysing activity sequences and project duration.

Activity-on-node: A network convention in which activities are represented by nodes and relationships by arrows.

Activity: A defined item of project work with a duration and logical relationships.

Predecessor: An activity that must occur before another activity.

Successor: An activity that follows another activity.

Duration: The planned elapsed working time required for an activity.

Forward pass: A start-to-finish calculation of early dates.

Backward pass: A finish-to-start calculation of late dates.

Early Start (ES): The earliest feasible start time for an activity.

Early Finish (EF): The earliest feasible finish time for an activity.

Late Start (LS): The latest start time that avoids violating the project completion constraint.

Late Finish (LF): The latest finish time that avoids violating the project completion constraint.

Total float: Delay available without delaying the specified project completion date.

Free float: Delay available without delaying the early start of an immediate successor.

Critical activity: An activity with zero total float under the adopted convention.

Critical path: A start-to-finish path composed of critical activities.

Near-critical path: A path with small positive float and significant risk of becoming critical.

Crashing: Adding resources or cost to shorten activity duration.

Fast tracking: Overlapping activities that were originally planned sequentially.

Negative float: A condition showing that an imposed completion date cannot be met by the current schedule.

Review Questions

Short Answer Questions

1. What is the purpose of the forward pass in CPM?
2. Why is the maximum predecessor EF used to calculate an activity’s ES?
3. Define total float and provide its two standard formulas.
4. What distinguishes a near-critical path from a critical path?
5. State two limitations of deterministic CPM.

Long Answer Questions

1. Explain the complete forward-pass and backward-pass procedures, including the assumptions behind each calculation.
2. Discuss how critical-path information can support resource allocation and schedule compression decisions.
3. Explain why a project may have multiple critical paths and describe the managerial consequences.
4. Critically evaluate the effects of incomplete network logic and inaccurate durations on CPM results.
5. Discuss the governance controls required to maintain a credible project schedule baseline.

Analytical / Application Questions

1. Construct a forward-pass and backward-pass table for a project containing at least six activities and identify its critical path and near-critical paths.
2. In the worked example, analyse the effect of increasing activity D’s duration by two working days. Recalculate the relevant path durations and explain whether the critical path changes.
3. A project has a required completion date earlier than its CPM earliest completion date. Explain what negative float means and recommend three feasible management responses.

Multiple Choice Questions with Answers

Question 1

In a forward pass, the ES of an activity with multiple predecessors is normally based on which value?

A. The smallest predecessor EF

B. The average predecessor EF

C. The largest predecessor EF

D. The successor LS

Correct Answer: C. The largest predecessor EF

Question 2

If an activity has ES = 7 and duration = 5 working days under the zero-based convention, what is its EF?

A. 2

B. 5

C. 12

D. 35

Correct Answer: C. 12

Question 3

During a backward pass, the LF of an activity with multiple successors is normally based on which value?

A. The largest successor LS

B. The smallest successor LS

C. The activity’s ES

D. The project start time

Correct Answer: B. The smallest successor LS

Question 4

Which expression correctly calculates total float?

A. ES − LS

B. EF + LF

C. LS − ES

D. Duration − EF

Correct Answer: C. LS − ES

Question 5

Under standard CPM assumptions, an activity with zero total float is classified as:

A. A milestone only

B. A critical activity

C. A resource-free activity

D. A lag activity

Correct Answer: B. A critical activity

Question 6

In the worked example, what is the calculated project duration?

A. 19 working days

B. 20 working days

C. 21 working days

D. 22 working days

Correct Answer: D. 22 working days

Question 7

Which path in the worked example is near-critical because it has one day of float?

A. A–B–D–F–H

B. A–C–E–G–H

C. A–B–E–F–H

D. B–C–D–G

Correct Answer: A. A–B–D–F–H

Question 8

What does negative float generally indicate?

A. The project is ahead of schedule

B. The imposed completion date cannot be met by the current schedule

C. All activities have excess resources

D. The network contains no dependencies

Correct Answer: B. The imposed completion date cannot be met by the current schedule

Question 9

Which action is most directly associated with adding resources to shorten an activity?

A. Crashing

B. Fast tracking

C. Baseline deletion

D. Lagging

Correct Answer: A. Crashing

Question 10

Why should near-critical paths be monitored?

A. They always have zero duration

B. They cannot affect project completion

C. Small delays may consume their limited float and make them critical

D. They are excluded from the backward pass

Correct Answer: C. Small delays may consume their limited float and make them critical