5.3 Critical Path Method and Network Analysis

Critical Path Method (CPM) and Network Analysis

Why this topic matters for the PE Construction exam: CPM analysis is arguably the most important scheduling topic on the exam. You will be expected to calculate early and late dates, determine float, identify the critical path, and understand how changes in activity durations affect the overall project timeline.

The Critical Path Method (CPM) is a mathematical algorithm used to schedule a set of project activities. It is the industry standard for planning and executing construction projects. The foundation of CPM is the Precedence Diagramming Method (PDM), which represents activities as boxes (nodes) linked by arrows showing logical dependencies. This is also known as Activity-on-Node (AON).

Anatomy of a Node

To perform a network analysis, each activity node must track six key pieces of data:

1. Activity Name / ID
2. Duration (D)
3. Early Start (ES): The earliest possible time the activity can begin.
4. Early Finish (EF): The earliest possible time the activity can end ($ES + D$).
5. Late Start (LS): The latest time the activity can begin without delaying the project.
6. Late Finish (LF): The latest time the activity can end without delaying the project ($LS + D$).

A common node layout is a 3x2 grid:

(Note: There are different conventions for Node layouts, but the mathematical relationships remain identical).

The Forward Pass: Calculating Early Dates

The Forward Pass determines the shortest possible project duration by calculating the ES and EF for every activity, moving from the start of the project to the end.

Rules for the Forward Pass:

1. The first activity's Early Start (ES) is usually 0 (or day 1, depending on convention). For the PE exam, standard convention usually uses end-of-day 0, so start at 0.
2. Calculate Early Finish: $EF = ES + \text{Duration}$
3. The Early Start (ES) of a successor activity is equal to the Early Finish (EF) of its predecessor.
4. Merge Rule: If an activity has multiple predecessors, its ES is the maximum (largest) EF of those predecessors. It must wait for all prior work to finish.

The Backward Pass: Calculating Late Dates

The Backward Pass calculates the Late Start (LS) and Late Finish (LF) for every activity, moving backward from the end of the project to the start.

Rules for the Backward Pass:

1. Set the Late Finish (LF) of the final activity equal to its Early Finish (EF). This establishes the project completion date.
2. Calculate Late Start: $LS = LF - \text{Duration}$
3. The Late Finish (LF) of a predecessor activity is equal to the Late Start (LS) of its successor.
4. Burst Rule: If an activity has multiple successors, its LF is the minimum (smallest) LS of those successors. It must finish in time so as not to delay the most critical following task.

Float (Slack) Calculations

Float, also known as slack, represents scheduling flexibility.

Total Float (TF)

The amount of time an activity can be delayed without delaying the overall project completion date. Formula: $TF = LS - ES$ (or $TF = LF - EF$)

Free Float (FF)

The amount of time an activity can be delayed without delaying the Early Start of any immediate successor activity. Formula: $FF = (\text{Minimum ES of all successors}) - EF$

[!TIP] Exam Strategy: If you only need to find the critical path, you only need to calculate the Forward Pass. The path with the longest total duration is the critical path. However, calculating the Backward Pass is necessary to find the exact Total Float of non-critical activities.

Identifying the Critical Path

The Critical Path is defined as the sequence of activities that dictates the overall project duration. It is the longest continuous path through the network.

• Activities on the critical path have a Total Float of zero ($TF = 0$).
• Any delay to a critical path activity will result in a day-for-day delay to the overall project finish date.
• A project can have multiple critical paths if several paths share the exact same longest duration.

Worked Example: Network Analysis

Consider the following simplified project:

Step 1: Forward Pass (Early Dates)

• Activity A: Starts at day 0. $ES = 0$. $EF = 0 + 3 = 3$.
• Activity B: Follows A. $ES = 3$. $EF = 3 + 4 = 7$.
• Activity C: Follows A. $ES = 3$. $EF = 3 + 6 = 9$.
• Activity D: Follows B and C. Merge Rule: Max(EF_B, EF_C) = Max(7, 9) = 9. $ES = 9$. $EF = 9 + 2 = 11$.
• Project Duration: 11 days.

Step 2: Backward Pass (Late Dates)

• Activity D: $LF = 11$. $LS = 11 - 2 = 9$.
• Activity C: Precedes D. $LF = 9$. $LS = 9 - 6 = 3$.
• Activity B: Precedes D. $LF = 9$. $LS = 9 - 4 = 5$.
• Activity A: Precedes B and C. Burst Rule: Min(LS_B, LS_C) = Min(5, 3) = 3. $LF = 3$. $LS = 3 - 3 = 0$.

Step 3: Calculate Total Float and Critical Path

• A: $TF = 0 - 0 = 0$
• B: $TF = 5 - 3 = 2$
• C: $TF = 3 - 3 = 0$
• D: $TF = 9 - 9 = 0$

Conclusion: The Critical Path is A $\rightarrow$ C $\rightarrow$ D (11 days). Activity B has 2 days of Total Float, meaning it can be delayed by up to 2 days without impacting the 11-day project duration.