5.1 Network Scheduling, Critical Path Method (CPM), and Float Calculations

Effective construction project management transforms a set of contract drawings and specifications into a coordinated sequence of field operations delivered on time, within budget, and in strict compliance with quality and safety standards. On the Tennessee Business and Law examination, scheduling questions test both conceptual comparisons between scheduling methods and hands-on arithmetic using the Critical Path Method (CPM).

Work Breakdown Structure (WBS) and Scheduling Fundamentals

Before a project manager can draw a schedule or assign dates to field crews, the contract scope must be organized into a Work Breakdown Structure (WBS). A WBS is a hierarchical decomposition of the total project scope into progressively smaller, manageable components:

1. Level 1 — Total Project: The complete facility under contract (for example, a $3,500,000 municipal fire station).
2. Level 2 — Major Project Phases / Systems: Broad construction divisions such as Sitework and Utilities, Concrete Substructure, Structural Steel Superstructure, Exterior Envelope, MEP (Mechanical, Electrical, and Plumbing) Rough-In, Interior Finishes, and Commissioning/Closeout.
3. Level 3 — Work Packages: Deliverable-oriented groupings of work within a phase (such as cast-in-place footings, slab-on-grade, or underground storm drainage) that can be assigned to a specific trade crew or subcontractor with a defined budget and cost code.
4. Level 4 — Schedule Activities: Discrete, measurable tasks required to complete each work package (for example, Excavate Footings, Set Reinforcing Steel, Inspect Footings, and Pour Footing Concrete), each assigned an estimated duration (in working days), required labor/equipment resources, and logical predecessors.

Once activities and durations are defined through the WBS, contractors select an appropriate scheduling methodology—typically a Bar Chart (Gantt Chart), a Critical Path Method (CPM) Network Diagram, or a software schedule combining both views.

---

Bar Charts (Gantt Charts) vs. CPM Network Diagrams

Bar Charts (Gantt Charts)

Developed by industrial engineer Henry Gantt in the early twentieth century, a Bar Chart (Gantt Chart) lists construction activities vertically down the left column and plots each activity's scheduled duration as a horizontal bar along a calendar timeline across the top.

• Primary Advantages: Bar charts are simple to prepare, easy to read at a glance, and universally understood by field superintendents, trade foremen, subcontractors, and project owners. They effectively communicate planned start dates, finish dates, overall phase overlap, and actual percentage of completion (often shaded inside each bar).
• Primary Limitations: A traditional bar chart does not explicitly display the logical interdependencies between activities. If a key material delivery or structural trade falls five days behind schedule, a static bar chart cannot automatically determine whether that five-day delay will push back the final project completion date or merely consume available slack time. For that reason, bar charts alone are inadequate for managing complex projects or proving delay claims in construction disputes.

Critical Path Method (CPM) Network Diagrams

Developed in the late 1950s to manage complex engineering and industrial construction projects, the Critical Path Method (CPM) is a mathematical network analysis technique that models both activity durations and explicit logical dependencies (predecessor and successor relationships). Two classic diagramming notations are used to draw CPM networks:

• Activity-on-Node (AON) / Precedence Diagramming Method (PDM): Each rectangular box (node) represents a construction activity (containing its ID, description, duration, and calculated start/finish dates), while directional arrows connecting the boxes represent the logical sequence between activities. Modern construction scheduling software (such as Oracle Primavera P6 and Microsoft Project) uses AON/PDM almost exclusively because it supports all four precedence dependency types without needing artificial dummy arrows.
• Activity-on-Arrow (AOA) / Arrow Diagramming Method (ADM): Directional arrows represent the activities themselves, and circular nodes at the tail and head of each arrow represent milestone events (the start or completion of an activity). AOA networks only support Finish-to-Start logic and frequently require dummy activities—dashed arrows with zero duration and zero resource consumption—inserted solely to preserve accurate dependency logic when two parallel chains share some, but not all, predecessor constraints.

---

Precedence Dependency Relationships, Leads, and Lags

In a Precedence Diagramming Method (PDM / AON) schedule, every logical link between a predecessor (the driving upstream activity) and a successor (the dependent downstream activity) falls into one of four relationship types:

1. Finish-to-Start (FS): The predecessor activity must completely finish before the successor activity is allowed to start. Finish-to-Start is by far the most common logical relationship in construction scheduling. Example: Concrete wall forms and rebar must finish being erected and inspected before pouring concrete can start.
2. Start-to-Start (SS): The successor activity cannot start until the predecessor activity has started. Start-to-Start logic is widely used when trades work in staggered waves along linear or multi-zone projects. Example: Once trench excavation starts on a 2,000-foot sewer main, pipe bedding and laying can start two days later without waiting for the entire 2,000-foot trench to be excavated.
3. Finish-to-Finish (FF): The successor activity cannot finish until the predecessor activity has finished. Example: Mechanical equipment installation and startup testing cannot finish until permanent electrical power hookup finishes.
4. Start-to-Finish (SF): The successor activity cannot finish until the predecessor activity starts. Start-to-Finish is the rarest dependency in construction, occasionally used for continuous power switchovers or temporary shoring removal (for example, temporary structural shoring cannot finish being removed until permanent steel columns start carrying the load).

Lead Time vs. Lag Time

Schedulers refine precedence relationships by adding Leads or Lags:

• Lead Time (Negative Lag): An intentional acceleration or overlap in which a successor activity starts before its predecessor is 100% finished. In scheduling notation, a 3-day lead on a Finish-to-Start link is written $\text{FS} - 3\text{ days}$ (for example, starting drywall hanging on lower floors 3 days before metal stud framing finishes on the top floor).
• Lag Time (Positive Offset): A mandatory waiting period or delay inserted between two activities during which no field labor or cost is expended on that link. A 7-day lag on a Finish-to-Start link is written $\text{FS} + 7\text{ days}$ (for example, a mandatory 7-day concrete curing period after pouring a structural deck before stripping shoring forms).

---

Forward Pass, Backward Pass, and the Critical Path

To determine the total duration of a project and identify which activities control the completion date, a CPM scheduler performs two mathematical passes through the network.

1. The Forward Pass (Left to Right)

The Forward Pass starts at the beginning of the network (Day 0 under standard zero-based CPM convention) and moves left to right from start to finish to calculate the earliest dates each activity can begin and end:

$$\text{Early Finish (EF)} = \text{Early Start (ES)} + \text{Duration}$$

• Single Predecessor: An activity's Early Start ($\text{ES}$) equals the Early Finish ($\text{EF}$) of its immediate Finish-to-Start predecessor.
• Merge Point Rule (TAKE THE MAXIMUM): When two or more predecessor paths converge (merge) into a single successor activity, that successor cannot start until every required predecessor is finished. Therefore, at any merge point, the successor's Early Start equals the MAXIMUM (highest) Early Finish among all of its immediate predecessors:

$$\text{ES}_{\text{successor}} = \max(\text{EF}_{\text{all immediate predecessors}})$$

The highest Early Finish at the final activity of the network establishes the minimum total duration required to complete the project.

2. The Backward Pass (Right to Left)

The Backward Pass starts at the final project completion milestone (setting the terminal activity's Late Finish equal to the project completion day found in the Forward Pass) and moves right to left backward toward project start to calculate the latest dates each activity can finish and start without delaying overall project completion:

$$\text{Late Start (LS)} = \text{Late Finish (LF)} - \text{Duration}$$

• Single Successor: An activity's Late Finish ($\text{LF}$) equals the Late Start ($\text{LS}$) of its single immediate Finish-to-Start successor.
• Burst Point Rule (TAKE THE MINIMUM): When a single predecessor activity branches out (bursts) into two or more immediate successor activities, the predecessor must finish early enough not to delay any of its dependent successors. Therefore, at any burst point, the predecessor's Late Finish equals the MINIMUM (lowest) Late Start among all of its immediate successors:

$$\text{LF}_{\text{predecessor}} = \min(\text{LS}_{\text{all immediate successors}})$$

3. Defining the Critical Path

The Critical Path is the longest continuous chain of activities through the network from start to finish. Because every path in the network must be completed before the building is finished, the longest path determines the shortest possible total calendar time in which the entire project can be completed.

• Every activity on the Critical Path has zero Total Float ($\text{TF} = 0$), meaning its Early Start equals its Late Start ($\text{ES} = \text{LS}$) and its Early Finish equals its Late Finish ($\text{EF} = \text{LF}$).
• If any activity on the Critical Path is delayed by $X$ days, the entire project completion date is delayed by $X$ days unless the contractor compresses remaining critical activities.
• A network always has at least one Critical Path, and it can have multiple parallel Critical Paths if two or more chains tie for the longest total duration.

---

Total Float vs. Free Float Formulas and Worked Network Example

Float (also called slack) measures scheduling flexibility on non-critical paths. Construction schedulers distinguish between two types of float:

$$\text{Total Float (TF)} = \text{LS} - \text{ES} = \text{LF} - \text{EF}$$ $$\text{Free Float (FF)} = \min(\text{ES}_{\text{immediate successors}}) - \text{EF}$$

• Total Float ($\text{TF}$): The maximum number of days an activity can be delayed from its Early Start without delaying the overall project completion date. Total Float is shared across an entire chain of non-critical activities; if an earlier activity on that chain uses up 4 days of Total Float, every downstream activity on that same chain has 4 fewer days of Total Float remaining.
• Free Float ($\text{FF}$): The maximum number of days an activity can be delayed from its Early Start without delaying the Early Start of any immediately following successor activity. Free Float is never greater than Total Float ($\text{FF} \le \text{TF}$). Along a multi-activity non-critical chain, early activities typically have positive Total Float but zero Free Float (because delaying them immediately pushes back the Early Start of the next activity in the chain), while the final activity in the non-critical chain—right where it merges back into the Critical Path—has Free Float equal to its Total Float.

Worked Numeric Example: Six-Activity Construction CPM Network

Suppose a Tennessee utility contractor is constructing an underground concrete electrical vault and feeder system consisting of six activities (A through F). All relationships are Finish-to-Start (FS):

• Path 1 (A -> B -> D -> F): $\text{Duration} = 4 + 6 + 5 + 3 = 18\text{ days}$
• Path 2 (A -> C -> E -> F): $\text{Duration} = 4 + 10 + 7 + 3 = 24\text{ days}$ (Critical Path)

Let us verify the Forward Pass, Backward Pass, Total Float, and Free Float for every activity:

Examine the difference between Activity B and Activity D on the non-critical branch (B -> D):

• Activity B finishes at Day 10 ($\text{EF}_B = 10$), and its immediate successor Activity D has an Early Start of Day 10 ($\text{ES}_D = 10$). Activity B has $\text{TF}_B = 10 - 4 = 6\text{ days}$ (if B takes 12 days instead of 6, the project still finishes on Day 24), but Activity B has $\text{FF}_B = \text{ES}_D - \text{EF}_B = 10 - 10 = 0\text{ days}$ because delaying B by even 1 day delays the Early Start of Activity D from Day 10 to Day 11.
• Activity D finishes at Day 15 ($\text{EF}_D = 15$), while its only immediate successor Activity F cannot start until Day 21 ($\text{ES}_F = \max(\text{EF}_D, \text{EF}_E) = \max(15, 21) = 21$) because F must wait on critical Activity E. Therefore, Activity D has both $\text{TF}_D = 16 - 10 = 6\text{ days}$ and $\text{FF}_D = \text{ES}_F - \text{EF}_D = 21 - 15 = 6\text{ days}$.

The worked network assumes finish-to-start links with zero lag, one consistent working-day calendar, fixed durations, and no external date or resource constraints. Calendar dates need holidays and weekends added separately. Different calendars or constraints can change float even when the activity durations are unchanged.