7.2 CPM Scheduling: Critical Path, Float & Schedule Control

Scheduling Methodologies: Gantt Charts vs. Critical Path Method (CPM)

In commercial construction, time is a finite financial resource. Managing project time requires robust scheduling techniques capable of coordinating hundreds of interdependent trade activities, procurement deadlines, and regulatory inspections.

The Gantt / Bar Chart: Strengths and Structural Limitations

Developed by Henry Gantt during World War I, the Gantt Chart (Bar Chart) remains a common tool for visual project representation. Activities are listed along a vertical axis, with horizontal bars plotted across a calendar timeline representing each task's start date, duration, and finish date.

• Strengths: Intuitive, easily understood by field trades, subcontractors, and clients; excellent for executive summaries and two-week rolling look-ahead schedules.
• Fatal Flaws in Commercial Construction: Standard bar charts do not display mathematical interdependencies between activities. If an excavation activity slips by ten days, a basic Gantt chart cannot calculate whether the slip will delay foundation pours, framing, or the final ribbon-cutting. It fails to identify which specific tasks control the project completion date.

The Critical Path Method (CPM)

Developed in the late 1950s by DuPont and Remington Rand, the Critical Path Method (CPM) is a mathematical modeling technique that maps all project activities, their discrete durations, and their strict logical dependencies.

Modern commercial construction uses the Precedence Diagramming Method (PDM), also called Activity-on-Node (AON). In PDM, activities are represented by rectangular nodes, and dependencies are represented by connecting arrows.

Precedence Logic Relationships, Leads, and Lags

In a Precedence Diagramming network, arrows define the exact technological, physical, or contractual dependencies between an upstream activity (the predecessor) and a downstream activity (the successor).

The Four Precedence Logic Ties

Commercial networks utilize four distinct logic relationships:

1. FINISH-TO-START (FS) [Standard Construction Tie - 90%+ of all relationships]
   Activity A (Pour Concrete Footing) ======> Activity B (Erect Masonry Wall)
   Explanation: Activity B cannot begin until Activity A is 100% complete.

2. START-TO-START (SS) [Concurrent / Phased Operations]
   Activity A (Rough-in Metal Stud Framing) ===>
   Activity B (Rough-in Electrical Conduit) =====>
   Explanation: Activity B cannot start until Activity A has started (often with a lag).

3. FINISH-TO-FINISH (FF) [Concurrent Completion]
   Activity A (Install Exterior Sheathing) ======>
   Activity B (Install Weather Barrier) ==========>
   Explanation: Activity B cannot finish until Activity A has finished.

4. START-TO-FINISH (SF) [Extremely Rare in Construction]
   Activity A (Commission New Fire Alarm) ====> Activity B (Demolish Existing Alarm)
   Explanation: Activity B cannot finish until Activity A has started.

Lead Time and Lag Time

Logic relationships can be modified by introducing temporal offsets known as lags or leads:

• Lag Time (Positive Delay): A mandatory waiting period imposed between the finish (or start) of a predecessor and the start (or finish) of a successor.
  • Example: Curing Structural Concrete. After pouring an elevated post-tensioned deck (Activity A), a 7-day cure period is required before post-tensioning tendons can be stressed (Activity B). This is modeled as an FS + 7 days lag.
• Lead Time (Negative Lag / Acceleration): An overlap where the successor begins before the predecessor is fully finished.
  • Example: Drywall Installation. Taping and mudding begins 3 days before the entire drywall hanging scope finishes. This is modeled as an FS - 3 days lead (or more properly as an SS + lag relationship to maintain positive network logic).

CPM Mathematical Calculations: Forward and Backward Passes

To determine project duration, activity schedule windows, and float values, schedulers execute two mathematical sweeps through the network: the Forward Pass and the Backward Pass.

Activity Node Architecture

In standard Precedence Diagramming Method (PDM), each activity node contains six fundamental parameters:

+--------------------+--------------------+--------------------+
| EARLY START (ES)   | DURATION (D)       | EARLY FINISH (EF)  |
+--------------------+--------------------+--------------------+
|                    ACTIVITY NAME / ID                        |
+--------------------+--------------------+--------------------+
| LATE START (LS)    | TOTAL FLOAT (TF)   | LATE FINISH (LF)   |
+--------------------+--------------------+--------------------+

The Forward Pass (Determines Early Dates and Minimum Project Duration)

The Forward Pass calculates the earliest possible calendar dates that an activity can start and finish based on network logic and durations. It proceeds chronologically from left to right (start to project completion).

1. Initial Activity Start: The project begins at Day 0: ES = 0.
2. Early Finish Formula: For any activity: $$EF = ES + \text{Duration}$$
3. Multiple Predecessors Rule (The Maximum Rule): When an activity has two or more incoming predecessors connected via Finish-to-Start ties, its Early Start is governed by the latest finishing predecessor: $$ES_{\text{activity}} = \max(EF_{\text{predecessor 1}}, EF_{\text{predecessor 2}}, \dots, EF_{\text{predecessor } n})$$ Rationale: A successor cannot start until ALL prerequisite tasks are fully completed.

The Backward Pass (Determines Late Dates and Float Values)

The Backward Pass calculates the latest possible calendar dates that an activity can start and finish without delaying the overall project completion date. It proceeds in reverse from right to left (project completion to start).

1. Project Completion Late Finish: Set the Late Finish (LF) of the final terminal activity equal to its Early Finish (EF): $$LF_{\text{project}} = EF_{\text{project}}$$
2. Late Start Formula: For any activity: $$LS = LF - \text{Duration}$$
3. Multiple Successors Rule (The Minimum Rule): When an activity has two or more outgoing successors, its Late Finish is governed by the earliest late start among all immediate successors: $$LF_{\text{activity}} = \min(LS_{\text{successor 1}}, LS_{\text{successor 2}}, \dots, LS_{\text{successor } n})$$ Rationale: If the predecessor finishes any later than the earliest start required by a successor, that successor will be delayed, triggering a cascade that pushes project completion past the deadline.

Float Mechanics: Total Float, Free Float & Critical Path Dynamics

Float (also termed slack) represents schedule flexibility. Understanding the distinction between Total Float and Free Float is one of the most critical concepts on the contractor licensing examination.

1. Total Float (TF)

Total Float is the total amount of time that an activity can be delayed or expanded from its early start date without delaying the contractual completion date of the overall project.

The Crucial Doctrine of 'Shared Float': Total Float belongs to the path, not exclusively to an individual activity or subcontractor! If a site grading contractor has 10 days of Total Float along an excavation path and consumes all 10 days due to equipment breakdowns, the underground utility contractor downstream on that same path now has zero float remaining. The path has been converted into a critical path.

2. Free Float (FF)

Free Float is the amount of time that an activity can be delayed without delaying the Early Start date of any immediate successor activity.

• Free Float represents float that is strictly unique to that specific activity; consuming Free Float causes zero disruption or delay to any downstream trade.
• Mathematical Truth: Free Float can never be greater than Total Float (FF ≤ TF). If an activity has zero Total Float, its Free Float must also be zero.

3. The Critical Path Defined

The Critical Path is the continuous sequence of connected activities through the network from start to finish that possesses the longest total duration, or conversely, zero (or minimum) Total Float.

• Key Characteristics:
  • Determines the absolute shortest possible calendar duration required to complete the project.
  • Any delay to any activity on the critical path causes a direct, day-for-day delay to the project completion date.
  • A network may possess multiple critical paths if two parallel paths tie for the longest duration.
  • Near-Critical Paths: Paths with very low total float (e.g., 1 to 5 days). A minor delay can instantly transform a near-critical path into the primary critical path, surprising an unwary superintendent.

Worked CPM Network Calculation Example & Analysis Table

To master CPM scheduling mechanics, examine the following 6-activity commercial warehouse foundation and framing network.

Project Network Specifications

• Activity A: Site Excavation & Footings | Duration: 5 days | Predecessors: None
• Activity B: Concrete Foundation Walls | Duration: 6 days | Predecessor: A
• Activity C: Underground MEP Rough-in | Duration: 4 days | Predecessor: A
• Activity D: Slab-on-Grade Concrete Pour | Duration: 3 days | Predecessors: B and C
• Activity E: Structural Steel Framing | Duration: 8 days | Predecessor: D
• Activity F: Exterior Perimeter Grading & Paving | Duration: 7 days | Predecessor: A
• Project Completion: Converges at the finish of Activities E and F.

Step 1: Forward Pass Execution (Left to Right)

• Activity A: Starts at Day 0. ES = 0, EF = 0 + 5 = 5.
• Activity B: Predecessor A (EF = 5). ES = 5, EF = 5 + 6 = 11.
• Activity C: Predecessor A (EF = 5). ES = 5, EF = 5 + 4 = 9.
• Activity D: Predecessors B (EF = 11) and C (EF = 9). By the Maximum Rule: ES = max(11, 9) = 11. EF = 11 + 3 = 14.
• Activity E: Predecessor D (EF = 14). ES = 14, EF = 14 + 8 = 22.
• Activity F: Predecessor A (EF = 5). ES = 5, EF = 5 + 7 = 12.
• Project Early Finish: max(EF(E), EF(F)) = max(22, 12) = 22 days.

Step 2: Backward Pass Execution (Right to Left)

• Target Completion = 22 days. Set LF = 22 for terminal activities E and F.
• Activity E: LF = 22, LS = 22 − 8 = 14.
• Activity F: LF = 22, LS = 22 − 7 = 15.
• Activity D: Successor E (LS = 14). LF = 14, LS = 14 − 3 = 11.
• Activity B: Successor D (LS = 11). LF = 11, LS = 11 − 6 = 5.
• Activity C: Successor D (LS = 11). LF = 11, LS = 11 − 4 = 7.
• Activity A: Successors B (LS = 5), C (LS = 7), and F (LS = 15). By the Minimum Rule: LF = min(5, 7, 15) = 5. LS = 5 − 5 = 0.

Comprehensive Network Calculation Table

Key Takeaway from Analysis: The Critical Path runs strictly through A -> B -> D -> E, governing the 22-day project duration. Activity C has 2 days of Total and Free Float; it can slip 2 days without affecting Activity D or the project completion date. Activity F has 10 days of Total and Free Float; paving can slip 10 days without impacting project handover.

Schedule Control & Compression: Crashing vs. Fast-Tracking

When weather delays, unforeseen soil conditions, or owner scope changes threaten the contractual completion date, the general contractor must deploy schedule compression strategies.

+--------------------------------------------------------------------------------------------------+
|                             SCHEDULE COMPRESSION STRATEGY COMPARISON                             |
+------------------------------------+-------------------------------------------------------------+
| STRATEGY                           | OPERATIONAL MECHANISM, COSTS & RISKS                        |
+------------------------------------+-------------------------------------------------------------+
| SCHEDULE CRASHING                  | Adds direct labor, overtime, second shifts, or additional   |
|                                    | equipment to CRITICAL PATH activities.                      |
|                                    | - Impact: Shortens schedule at HIGHER DIRECT FINANCIAL COST.|
|                                    | - Rule: Only crash critical activities with lowest slope.   |
|                                    | - Risk: Decreasing worker productivity from overtime burn.  |
+------------------------------------+-------------------------------------------------------------+
| FAST-TRACKING                      | Reconfigures network logic to perform activities in         |
|                                    | PARALLEL that were originally scheduled SEQUENTIALLY.        |
|                                    | - Impact: Shortens schedule with MINIMAL DIRECT ADDED COST. |
|                                    | - Rule: Overlap design/procurement with early field scopes. |
|                                    | - Risk: High probability of trade CLASHES, REWORK, & CLAIMS.|
+------------------------------------+-------------------------------------------------------------+

The Mathematical Law of Schedule Crashing

To crash a project efficiently without squandering capital, the project manager must calculate the Crash Cost Slope for every activity on the critical path:

Crashing Rules for the Contractor Exam

1. Rule 1: Only Crash Critical Path Activities. Crashing an activity with positive float (such as Activity F with 10 days of float) expends capital without accelerating project completion by a single hour.
2. Rule 2: Crash the Activity with the Lowest Cost Slope First. If Activity B costs $1,000 per day saved and Activity E costs $3,500 per day saved, the contractor must crash Activity B to its crash limit before expending funds on Activity E.
3. Rule 3: Beware of Emerging Parallel Critical Paths. As a critical path is shortened, parallel non-critical paths will lose float and may become critical. Once two parallel paths are both critical, shortening the project requires crashing activities on both critical paths simultaneously.