Study guide
Critical Path Method (CPM) & Network Logic
ARE 5.0 Project Management PjM
Track your progress as you read
Finished sections get a check mark.
1 Exam Orientation
About the ARE 5.0 Project Management Exam Study Strategies & Case Study Mastery
2 Resources and Team Capacity
Staffing Plans & Project Team Assembly Financial Multipliers & Billing Rates Staff Utilization & Chargeable Ratios Consultant Selection & Fee Budgeting
3 Work Plans and Schedules
Project Work Plan Fundamentals Critical Path Method (CPM) & Network Logic Gantt Charts & Milestone Tracking Schedule Contingencies & External Constraints
4 Fee Planning and Communication
Fee Allocation Across Project Phases Earned Value Management (EVM) for Architects Project Communications & Documentation Protocols
5 Owner–Architect Services
AIA B101 Structure & Initial Information Standard of Care, Indemnification & Liability Architect's Basic Services (Article 3) Supplemental vs. Additional Services (Article 4)
6 Consultant Agreements and Integration
AIA C401 Architect-Consultant Agreement Integrating Owner-Retained Consultants
7 Construction Agreements
A101: Price, Time, and Payment Terms AIA A201 General Conditions for Project Managers Construction Manager Contracts: CMa vs. CMc
8 Compensation, Disputes, and Termination
Dispute Resolution Mechanisms & Claims Architectural Compensation & Reimbursables Termination, Suspension & Instruments of Service
9 Delivery Structures and Document Controls
Comparative Project Delivery Methods Bridged Design-Build & Public-Private Partnerships Document Controls by Delivery Method
10 Collaborative Delivery and Procurement
Integrated Project Delivery & Lean Construction Procurement, Bidding & Negotiation
11 Budget Monitoring and Scope Changes
Cost Estimating & Designing to Budget Managing Scope Creep & Construction Changes
12 Construction Administration and Approvals
Submittals, RFIs, Payments & Project Closeout Agency Approvals and Permit Workflow
13 Quality Reviews and Compliance
Quality Assurance vs. Quality Control Peer Reviews & Code Compliance Tracking
14 Coordinated Documents and Models
Interdisciplinary Coordination & Redicheck Specifications & CSI MasterFormat Organization BIM Management & Level of Development (LOD) Clash Detection & Model Coordination
15 Risk, Design Objectives, and Learning
Project Risk Identification & Risk Register Maintaining Design Objectives Through Delivery Knowledge Management & Post-Occupancy Evaluation
Critical Path Method (CPM) & Network Logic
Key Takeaways Explain This Topic AI
The worked network uses a day-zero origin, finish-to-start links, no lags, and no imposed finish constraint.
For those links, use the maximum predecessor finish in the forward pass and minimum successor start in the backward pass.
Total float equals LS − ES or LF − EF; zero float identifies the critical path in this unconstrained example, while imposed dates can create negative float.
Fast-tracking overlaps work and can add rework or cost; crashing adds resources and requires evaluation of actual duration and cost benefits.
Last updated: October 2026
Critical Path Method (CPM) & Network Logic
Quick Answer: The Critical Path Method (CPM) is a mathematical scheduling technique that models project activities as a deterministic network of dependent nodes. By executing a forward pass , the scheduler identifies the earliest possible start and finish dates for each task; a backward pass reveals the latest dates an activity can occur without extending project completion. The Critical Path is the longest continuous sequence of activities through the network and possesses zero total float . Any delay to an activity on the critical path directly delays the overall project completion date.
CPM Fundamentals & Precedence Network Logic
Modern AEC scheduling primarily utilizes the Precedence Diagramming Method (PDM) , also commonly termed Activity-on-Node (AON) . In an AON network, discrete project activities are represented by rectangular boxes (nodes), and logical dependencies are depicted by connecting arrows.
The Standard AON Node Layout
Each node in an AON network diagram contains six essential pieces of schedule data: +-----------------------+----------+-----------------------+
- | Early Start (ES) | Duration | Early Finish (EF) |
- +-----------------------+----------+-----------------------+
- | Activity Name & Description |
- +-----------------------+----------+-----------------------+
- | Late Start (LS) | Float | Late Finish (LF) |
- +-----------------------+----------+-----------------------+
- Logical Dependency Relationships
Dependencies define the sequential logic between predecessor and successor activities. In architectural production and construction scheduling, four precedence relationships exist:
Finish-to-Start (FS) : The successor activity cannot start until the predecessor activity finishes. This is by far the most common logic tie in architectural practice (e.g., the structural framing plans cannot start until the architectural column grid is finalized).
Start-to-Start (SS) : The successor activity cannot start until the predecessor activity has started. This allows overlapping workflows (e.g., mechanical duct modeling can start once architectural core modeling starts).
Finish-to-Finish (FF) : The successor activity cannot finish until the predecessor activity finishes (e.g., specification writing cannot finish until construction drawings finish).
Start-to-Finish (SF) : The successor activity cannot finish until the predecessor activity starts. This relationship is exceptionally rare in architectural practice and is generally avoided.
Dependencies may also incorporate Lead (negative lag that accelerates successor work by starting it prior to predecessor completion) or Lag (mandatory delay between activities, such as requiring a 7-day curing lag after pouring concrete before structural steel erection commences).
Mathematical Mechanics: Forward and Backward Passes
Determining project duration and critical path requires executing two sequential mathematical sweeps through the network: the forward pass and the backward pass.
1. The Forward Pass (Early Dates)
The forward pass moves chronologically from the project start node to the final completion node. It establishes the Early Start (ES) and Early Finish (EF) for every activity.
The initial activity starts at time zero: E S 1 = 0 ES_1 = 0 E S 1 = 0 .
The early finish is calculated by adding activity duration: E F = E S + Duration EF = ES + \text{Duration} EF = ES + Duration
Merge Node Rule : When multiple predecessor activities converge upon a single successor activity, the successor's Early Start is governed by the maximum Early Finish among all immediate predecessors: E S j = max ( E F i ) for all immediate predecessors i ES_j = \max(EF_i) \quad \text{for all immediate predecessors } i E S j = max ( E F i ) for all immediate predecessors i
2. The Backward Pass (Late Dates)
The backward pass moves in reverse from the final project completion date back to the start node. It establishes the Late Finish (LF) and Late Start (LS) —the latest possible dates an activity can be completed or initiated without delaying the overall project completion date.
For the final project activity, Late Finish equals its Early Finish: L F final = E F final LF_{\text{final}} = EF_{\text{final}} L F final = E F final .
The late start is calculated by subtracting activity duration: L S = L F − Duration LS = LF - \text{Duration} L S = L F − Duration
Burst Node Rule : When moving backward, if an activity is followed by multiple successors, its Late Finish is governed by the minimum Late Start among all immediate successors: L F i = min ( L S j ) for all immediate successors j LF_i = \min(LS_j) \quad \text{for all immediate successors } j L F i = min ( L S j ) for all immediate successors j
Float Mechanics: Total Float vs. Free Float
Float (or slack) represents the scheduling leeway available to an activity. On the ARE 5.0 Project Management exam, distinguishing between Total Float and Free Float is critical:
Total Float (TF)
Total Float is the total amount of time that an activity can be delayed from its Early Start date without delaying the project's overall contractual completion date. It reflects the flexibility of the activity relative to the entire project schedule: Total Float = L S − E S = L F − E F \text{Total Float} = LS - ES = LF - EF Total Float = L S − ES = L F − EF
If Total Float = 0 \text{Total Float} = 0 Total Float = 0 , the activity is Critical . Any delay to this activity will cause an identical day-for-day delay to the project completion date.
If Total Float > 0 \text{Total Float} > 0 Total Float > 0 , the activity is Non-Critical and possesses schedule leeway.
If Total Float < 0 \text{Total Float} < 0 Total Float < 0 , the project is facing Negative Float , meaning the current schedule sequence cannot meet the mandated contract deadline unless activities are accelerated or compressed.
Free Float (FF)
Free Float is the amount of time an activity can be delayed without delaying the Early Start of any immediate successor activity. Free float represents localized slack that does not affect downstream activities: Free Float = min ( E S successors ) − E F \text{Free Float} = \min(ES_{\text{successors}}) - EF Free Float = min ( E S successors ) − EF
Notice that in the unconstrained example, Free Float does not exceed Total Float ( F F ≤ T F FF \le TF FF ≤ TF ). While an activity may have several days of Total Float, its Free Float will be zero if any of its successors must begin immediately upon its early completion.
Step-by-Step Worked Example: 8-Activity Architectural Network
Consider an architectural team executing the Schematic Design phase for a specialized municipal facility. The project consists of eight discrete activities (A through H) with established dependencies and durations in calendar days:
Activity ID Description Predecessors Duration (Days) ES EF LS LF Total Float ( L S − E S LS - ES L S − ES ) Free Float Critical Path?
- A Project Setup & Code Analysis None 4 0 4 0 4 0 0 YES
- B Site Civil & Grading Concept A 6 4 10 8 14 4 4 NO
- C Architectural Concept & Massing A 10 4 14 4 14 0 0 YES
- D Structural Framing Logic C 8 14 22 15 23 1 1 NO
- E MEP Systems Concept & Routing B, C 5 14 19 14 19 0 0 YES
- F Energy Modeling & Sustainability E 4 19 23 19 23 0 0 YES
- G Integrated BIM Coordination D, F 7 23 30 23 30 0 0 YES
- H Client Gate Review & Submittal G 3 30 33 30 33 0 0 YES
- Step-by-Step Mathematical Walkthrough
Forward Pass Calculation :
Activity A : Starts at day 0. E F = 0 + 4 = 4 EF = 0 + 4 = 4 EF = 0 + 4 = 4 .
Activity B : Predecessor is A ( E F = 4 EF = 4 EF = 4 ). E S = 4 ES = 4 ES = 4 ; E F = 4 + 6 = 10 EF = 4 + 6 = 10 EF = 4 + 6 = 10 .
Activity C : Predecessor is A ( E F = 4 EF = 4 EF = 4 ). E S = 4 ES = 4 ES = 4 ; E F = 4 + 10 = 14 EF = 4 + 10 = 14 EF = 4 + 10 = 14 .
Activity D : Predecessor is C ( E F = 14 EF = 14 EF = 14 ). E S = 14 ES = 14 ES = 14 ; E F = 14 + 8 = 22 EF = 14 + 8 = 22 EF = 14 + 8 = 22 .
Activity E : Predecessors are B ( E F = 10 EF = 10 EF = 10 ) and C ( E F = 14 EF = 14 EF = 14 ). Applying the merge rule: E S = max ( 10 , 14 ) = 14 ES = \max(10, 14) = 14 ES = max ( 10 , 14 ) = 14 . E F = 14 + 5 = 19 EF = 14 + 5 = 19 EF = 14 + 5 = 19 .
Activity F : Predecessor is E ( E F = 19 EF = 19 EF = 19 ). E S = 19 ES = 19 ES = 19 ; E F = 19 + 4 = 23 EF = 19 + 4 = 23 EF = 19 + 4 = 23 .
Activity G : Predecessors are D ( E F = 22 EF = 22 EF = 22 ) and F ( E F = 23 EF = 23 EF = 23 ). Applying the merge rule: E S = max ( 22 , 23 ) = 23 ES = \max(22, 23) = 23 ES = max ( 22 , 23 ) = 23 . E F = 23 + 7 = 30 EF = 23 + 7 = 30 EF = 23 + 7 = 30 .
Activity H : Predecessor is G ( E F = 30 EF = 30 EF = 30 ). E S = 30 ES = 30 ES = 30 ; E F = 30 + 3 = 33 EF = 30 + 3 = 33 EF = 30 + 3 = 33 .
Overall Project Duration : 33 Days .
Backward Pass Calculation :
Activity H : L F = 33 LF = 33 L F = 33 ; L S = 33 − 3 = 30 LS = 33 - 3 = 30 L S = 33 − 3 = 30 .
Activity G : Successor is H ( L S = 30 LS = 30 L S = 30 ). L F = 30 LF = 30 L F = 30 ; L S = 30 − 7 = 23 LS = 30 - 7 = 23 L S = 30 − 7 = 23 .
Activity D : Successor is G ( L S = 23 LS = 23 L S = 23 ). L F = 23 LF = 23 L F = 23 ; L S = 23 − 8 = 15 LS = 23 - 8 = 15 L S = 23 − 8 = 15 .
Activity F : Successor is G ( L S = 23 LS = 23 L S = 23 ). L F = 23 LF = 23 L F = 23 ; L S = 23 − 4 = 19 LS = 23 - 4 = 19 L S = 23 − 4 = 19 .
Activity E : Successor is F ( L S = 19 LS = 19 L S = 19 ). L F = 19 LF = 19 L F = 19 ; L S = 19 − 5 = 14 LS = 19 - 5 = 14 L S = 19 − 5 = 14 .
Activity B : Successor is E ( L S = 14 LS = 14 L S = 14 ). L F = 14 LF = 14 L F = 14 ; L S = 14 − 6 = 8 LS = 14 - 6 = 8 L S = 14 − 6 = 8 .
Activity C : Followed by D ( L S = 15 LS = 15 L S = 15 ) and E ( L S = 14 LS = 14 L S = 14 ). Applying the burst rule: L F = min ( 15 , 14 ) = 14 LF = \min(15, 14) = 14 L F = min ( 15 , 14 ) = 14 . L S = 14 − 10 = 4 LS = 14 - 10 = 4 L S = 14 − 10 = 4 .
Activity A : Followed by B ( L S = 8 LS = 8 L S = 8 ) and C ( L S = 4 LS = 4 L S = 4 ). Applying the burst rule: L F = min ( 8 , 4 ) = 4 LF = \min(8, 4) = 4 L F = min ( 8 , 4 ) = 4 . L S = 4 − 4 = 0 LS = 4 - 4 = 0 L S = 4 − 4 = 0 .
Network Path Analysis & Float Verification :
Path 1 : A → \rightarrow → B → \rightarrow → E → \rightarrow → F → \rightarrow → G → \rightarrow → H = 4 + 6 + 5 + 4 + 7 + 3 = 29 days 4 + 6 + 5 + 4 + 7 + 3 = 29\text{ days} 4 + 6 + 5 + 4 + 7 + 3 = 29 days . ( T F = 33 − 29 = 4 days TF = 33 - 29 = 4\text{ days} TF = 33 − 29 = 4 days on Activity B).
Path 2 : A → \rightarrow → C → \rightarrow → D → \rightarrow → G → \rightarrow → H = 4 + 10 + 8 + 7 + 3 = 32 days 4 + 10 + 8 + 7 + 3 = 32\text{ days} 4 + 10 + 8 + 7 + 3 = 32 days . ( T F = 33 − 32 = 1 day TF = 33 - 32 = 1\text{ day} TF = 33 − 32 = 1 day on Activity D).
Path 3 : A → \rightarrow → C → \rightarrow → E → \rightarrow → F → \rightarrow → G → \rightarrow → H = 4 + 10 + 5 + 4 + 7 + 3 = 33 days 4 + 10 + 5 + 4 + 7 + 3 = 33\text{ days} 4 + 10 + 5 + 4 + 7 + 3 = 33 days . This is the longest path through the network.
The Critical Path is A → \rightarrow → C → \rightarrow → E → \rightarrow → F → \rightarrow → G → \rightarrow → H with total float of 0 days .
Schedule Compression Techniques: Fast-Tracking vs. Crashing
When a project falls behind schedule or an owner demands an earlier completion date, the project manager must compress the project schedule. Two primary compression techniques exist, each carrying fundamentally different financial and risk profiles:
Fast-Tracking (Parallel Processing)
Fast-tracking involves taking activities that were originally planned to occur in sequence and reconfiguring them to execute concurrently in parallel .
Example in Architectural Practice : Beginning foundation and structural concrete construction documents while architectural schematic layouts are still being finalized with the client.
Cost Impact : Fast-tracking does not directly increase labor costs or require overtime fees initially.
Risk Impact : Extremely High Risk of Rework . If schematic layouts change after structural foundation engineering has begun, completed drawings must be scrapped and redrawn. Fast-tracking frequently causes coordination errors, RFIs, and costly change orders during construction.
Crashing (Resource Injection)
Crashing compresses the schedule by injecting additional resources onto critical path activities to shorten their duration.
Example in Architectural Practice : Assigning two additional senior drafters to work mandatory overtime on Activity G (Integrated BIM Coordination) or hiring an outside drafting service to expedite drawing production.
Cost Impact : Substantial Direct Cost Increase . Crashing requires paying premium overtime rates, expediting fees, or additional staff wages. Furthermore, crashing is subject to the economic law of diminishing marginal returns—overcrowding a task can lead to communication inefficiencies and reduced individual productivity.
Risk Impact : Lower technical risk than fast-tracking because activity sequence and dependencies are preserved, but high risk of budget overruns and staff burnout.
Critical Rule : Crashing must only be applied to activities on the Critical Path . Adding resources to an activity with positive float (such as Activity B or Activity D in our example) increases project costs without accelerating the overall project completion date by even one day.
The forward/backward-pass examples assume a day-zero origin, finish-to-start dependencies, no lags, and no imposed finish constraint. The usual nonnegative float relationships apply to this network; imposed dates can produce negative total float. Fast-tracking can increase rework and cost, even though it changes overlap rather than simply adding resources. Recalculate the network after an approved change.