8.2 Critical Path Analysis, Dependencies, and Float

8.2 Critical Path Analysis, Dependencies, and Float

Definition (APM BoK7 glossary): Critical path analysis is an activity-based scheduling technique that determines the overall duration of the identified work based on estimates and logical dependencies. The method of determining the critical path. The critical path itself is a sequence of activities through a precedence network from start to finish, the sum of whose durations determines the overall duration.

AC 6.2 only asks you to state the purpose of critical path analysis — it determines the overall duration of the work — and the PFQ syllabus states plainly that "exam questions do not require you to perform calculations." The forward and backward pass worked below is here so the technique makes sense, not because you will be asked to compute one. BoK7 makes the same point from the practitioner side: critical path analysis "is now almost exclusively performed using desktop scheduling software, although it is a key skill for project professionals to understand how this is done so they can verify that the project schedule is built on complete and defensible logic".

While a Gantt chart provides an accessible timeline for stakeholder communication, it does not reveal the underlying mathematical dynamics of a complex project. If an activity slips by three days, will the overall project finish three days late? Or can the project absorb the delay without any impact on the agreed delivery date?

To answer this question, project managers rely on Critical Path Analysis (CPA)—often referred to as the Critical Path Method (CPM). CPA models the project as an interconnected logical network, uncovering the mathematical "spine" of the project and identifying exactly where managerial oversight, resources, and risk mitigations must be concentrated.

---

Activity-on-Node (AON) Network Diagrams

In modern project management, CPA is performed using the Precedence Diagramming Method (PDM), commonly represented as an Activity-on-Node (AON) network diagram.

In an AON network diagram:

• Nodes (Boxes): Represent discrete project activities.
• Arrows (Lines): Represent the logical precedence dependencies (primarily Finish-to-Start relationships) dictating the flow of work from project start to project completion.

Anatomy of an Activity Node

Each node in an AON network diagram is partitioned into standardized cells displaying key scheduling parameters:

+-------------------------------------------------------------+
|  Early Start (ES)   |    Duration (D)     | Early Finish (EF)|
|---------------------+---------------------+-----------------|
|                     Activity Name / ID                      |
|---------------------+---------------------+-----------------|
|   Late Start (LS)   |   Total Float (TF)  | Late Finish (LF)|
+-------------------------------------------------------------+

• Early Start (ES): The earliest possible calendar point an activity can begin, based on network logic and predecessor completion.
• Duration (D): The estimated working time required to execute the activity.
• Early Finish (EF): The earliest possible calendar point an activity can complete ($EF = ES + D$).
• Late Finish (LF): The latest possible calendar point an activity can finish without delaying the final project completion date.
• Late Start (LS): The latest possible calendar point an activity can begin without delaying the final project completion date ($LS = LF - D$).
• Total Float (TF): The amount of schedule flexibility or buffer available to the activity ($TF = LS - ES = LF - EF$).

---

The Mechanics of Network Calculation

Critical Path Analysis requires two sequential mathematical sweeps through the network diagram: the Forward Pass and the Backward Pass.

FORWARD PASS  (Left to Right)  ===> Calculates Earliest Dates (ES, EF) & Project Duration
BACKWARD PASS (Right to Left)  <=== Calculates Latest Dates (LF, LS) & Total Float

Step 1: The Forward Pass (Calculating Early Dates)

The forward pass moves chronologically from the project start node (left) to the project completion node (right):

1. Starting Point: The initial activity begins at Day 0 (or Day 1 depending on calendar conventions; standard APM mathematical analysis uses Day 0 as time zero): $ES_{initial} = 0$.
2. Calculating Early Finish: For any activity, its Early Finish is calculated by adding its duration to its Early Start: $EF = ES + Duration$
3. Successor Early Start: Under a standard Finish-to-Start dependency, the Early Start of a successor activity equals the Early Finish of its predecessor: $ES_{successor} = EF_{predecessor}$.
4. Merge Point Rule (Critical Logic): When two or more predecessor activities converge (merge) into a single successor activity, the successor's Early Start is governed by the MAXIMUM (latest) Early Finish of all immediate predecessors: $ES_{successor} = \max(EF_{predecessors})$ Rationale: A successor cannot begin until all of its prerequisite tasks have completed. The slowest predecessor dictates when the successor can start.
5. Project Duration: The highest Early Finish among the final activities at the conclusion of the forward pass represents the minimum possible total duration of the project.

Step 2: The Backward Pass (Calculating Late Dates)

The backward pass moves in reverse chronological order from the project completion node (right) back to the project start node (left):

1. Starting Point: The Late Finish (LF) of the final project activity is set equal to its Early Finish (EF) established by the forward pass (or a contractual target completion date): $LF_{final} = EF_{final}$.
2. Calculating Late Start: For any activity, its Late Start is calculated by subtracting its duration from its Late Finish: $LS = LF - Duration$
3. Predecessor Late Finish: Under a standard Finish-to-Start dependency, the Late Finish of a predecessor equals the Late Start of its successor: $LF_{predecessor} = LS_{successor}$.
4. Burst / Divergence Point Rule (Critical Logic): When an activity is followed by two or more successor activities (a burst point), the predecessor's Late Finish is governed by the MINIMUM (earliest) Late Start of all immediate successors: $LF_{predecessor} = \min(LS_{successors})$ Rationale: If the predecessor finished any later than the earliest start required by any of its dependent successors, that successor would be delayed, triggering a cascade of delays that pushes out the project completion date.

---

The Critical Path Defined

With both passes complete, the project manager can identify the Critical Path.

Fundamental Characteristics of the Critical Path:

• Longest Duration, Shortest Time: The Critical Path is the continuous sequence of dependent activities through the network that possesses the longest cumulative duration. Paradoxically, this longest sequence represents the shortest possible time in which the overall project can be completed.
• Zero Total Float: Every activity located on the critical path has ZERO total float ($Total\ Float = 0$). That is, $ES = LS$ and $EF = LF$.
• Direct Impact on Project Finish: Any delay—even by a single hour or day—to any activity on the critical path will cause an identical, day-for-day delay to the overall project completion date, unless immediate corrective schedule compression is enacted.
• Multiple Critical Paths: A project network can have more than one critical path simultaneously if two or more parallel paths share the identical longest duration. Having multiple critical paths dramatically increases delivery risk because disruptions on any of the parallel paths will delay the project, requiring management to monitor multiple fronts at once.

---

Float Analysis: Total Float vs Free Float

Float (frequently referred to as slack) represents schedule flexibility—the degree of leeway an activity possesses before its delay impacts other activities or the project deadline.

1. Total Float (TF)

• Definition: The total amount of time that an activity can be delayed from its Early Start date without delaying the project completion date.
• Governing Formulas: $Total\ Float = Late\ Start - Early\ Start$ $Total\ Float = Late\ Finish - Early\ Finish$
• Path-Shared Asset: Total float is a shared asset belonging to the entire network path, not exclusively to a single activity. If an upstream task on a path consumes three days of total float, those three days are permanently gone for all subsequent activities on that path. Downstream activities will find their available total float reduced accordingly.

2. Free Float (FF)

• Definition: The amount of time that an activity can be delayed from its Early Start date without delaying the Early Start of any immediate successor activity.
• Governing Formula: $Free\ Float = \min(Early\ Start_{successors}) - Early\ Finish_{activity}$
• Activity-Specific Asset: Free float belongs exclusively to that specific activity. Consuming free float has zero impact on downstream activities; successors can still commence at their planned earliest start dates.

Detailed Comparison: Total Float vs Free Float vs Critical Path

---

Monitoring the Critical Path and the Danger of Near-Critical Paths

Effective schedule control requires more than simply identifying the critical path at the start of a project; it demands dynamic, continuous surveillance.

Relentless Focus on Critical Activities

Because critical path activities dictate the delivery date, the project manager must:

• Assign the most dependable, experienced team members and subcontractors to critical path work.
• Prioritize critical path tasks during daily stand-ups, progress meetings, and procurement expedited reviews.
• Actively resolve blockers or technical queries on the critical path ahead of non-critical work.

The Hazard of "Near-Critical Paths"

A near-critical path is a sequence of activities whose total duration is only marginally shorter than the critical path, meaning it has very low total float (e.g., 1 or 2 days of float on a multi-month project).

In real-world delivery, unexpected events (e.g., equipment breakdowns, minor vendor delays, or technical bugs) can easily consume 1 or 2 days of buffer. When this occurs:

1. The available float on the near-critical path is completely exhausted.
2. The near-critical path becomes a new critical path (a phenomenon known as a critical path shift).
3. Project managers who focused 100% of their attention on the original critical path are blindsided by delays originating from a supposedly "safe" path.

Best Practice: The project manager must establish a surveillance threshold, actively tracking all near-critical paths alongside the primary critical path to prevent unexpected schedule failure.