Study guide
1.2 Project Scheduling and CPM
PE Civil: Transportation Exam
Track your progress as you read
Finished sections get a check mark.
1 Chapter 1: Project Management
1.1 Quantity and Cost Estimating 1.2 Project Scheduling and CPM 1.3 Engineering Economic Analysis
2 Chapter 2: Traffic Engineering - Capacity and Flow
2.1 Uninterrupted Flow Capacity and Level of Service (LOS) 2.2 Interrupted Flow on Segment Streets 2.3 Intersection Capacity and LOS 2.4 Nonmotorized Facilities Analysis
3 Chapter 3: Traffic Engineering - Studies and Safety
3.1 Traffic Volume, Speed, and Planning Studies 3.2 Traffic Forecasts and Monitoring 3.3 Traffic Safety and Collision Analysis 3.4 Highway Safety and Crash Modification Factors (CMFs)
4 Chapter 4: Roadside and Cross-Section Design
4.1 Forgiving Roadside and Clear Zone Design 4.2 Barrier Design and Length of Need 4.3 Cross-Section Design Elements 4.4 Nonmotorized Design Considerations
5 Chapter 5: Horizontal Alignment Design
5.1 Circular Curve Elements and Calculations 5.2 Design Speed and Superelevation Design 5.3 Horizontal Sight Distance and Obstructions
6 Chapter 6: Vertical Alignment Design
6.1 Grades, Slopes, and Profile Design 6.2 Crest Vertical Curve Geometry and Sight Distance 6.3 Sag Vertical Curve Geometry and Sight Distance 6.4 Vertical Clearance Under Structures
7 Chapter 7: Intersection Geometry and Layout
7.1 At-Grade Intersection Design and Roundabouts 7.2 Intersection Sight Distance and Sight Triangles 7.3 Interchange Ramps and Terminal Geometry
8 Chapter 8: Traffic Signals
8.1 Traffic Signal Timing and Phasing 8.2 Traffic Signal Warrants (MUTCD) 8.3 Traffic Signal Design and Preemption
9 Chapter 9: Traffic Control Design
9.1 Permanent Signing Design and Standards 9.2 Pavement Marking Layout and Rules 9.3 Temporary Traffic Control and Work Zones
10 Chapter 10: Geotechnical and Pavements
10.1 Sampling, Testing, and Soil Stabilization 10.2 Fundamental Soil Properties and Mass Balance 10.3 Compaction, Excavation, and Mass Diagrams 10.4 Flexible and Rigid Pavement Design and ESALs
11 Chapter 11: Hydrology and Open-Channel Drainage
11.1 Rainfall Hydrology and Rational Method 11.2 Open-Channel Flow and Manning's Equation 11.3 Peak Flow Mitigation and Water-Quality
12 Chapter 12: Drainage Structures and Systems
12.1 Culvert Design and Inlet/Outlet Control 12.2 Stormwater Collection Systems and Inlet Capacities
1.2 Project Scheduling and CPM
Key Takeaways Explain This Topic AI
The critical path is the longest path of activities through the network and determines the minimum project duration; critical activities have a Total Float of zero.
Total Float ( T F = L S − E S = L F − E F TF = LS - ES = LF - EF TF = L S − ES = L F − EF ) is shared along a path, whereas Free Float ( F F = min ( E S successor ) − E F FF = \min(ES_{\text{successor}}) - EF FF = min ( E S successor ) − EF ) belongs to a single activity without delaying successors.
Precedence Diagramming Method (PDM) supports FS, SS, FF, and SF relationships with lags/leads, whereas Arrow Diagramming Method (ADM) is limited to FS and uses dummy activities.
Forward pass calculations determine early dates (ES, EF) using the maximum values of predecessors, while backward pass calculations determine late dates (LS, LF) using the minimum values of successors.
Last updated: July 2026
1.2 Project Scheduling and CPM
The Critical Path Method (CPM) is the standard technique used to plan, schedule, and control civil engineering projects. Its modeling approach represents project activities, durations, and logical relationships as a network diagram to identify the critical path and manage project float.
Scheduling Network Diagrams
Estimators and schedulers use two primary methods to diagram project logic:
Precedence Diagramming Method (PDM)
Also known as Activity-on-Node (AON), PDM is the industry standard. Activities are represented by nodes (boxes), and dependencies are shown by arrows. PDM is highly flexible because it supports four types of activity relationships:
Finish-to-Start (FS) : The successor cannot start until the predecessor finishes (most common).
Start-to-Start (SS) : The successor cannot start until the predecessor starts.
Finish-to-Finish (FF) : The successor cannot finish until the predecessor finishes.
Start-to-Finish (SF) : The successor cannot finish until the predecessor starts (rare).
PDM also supports lag (a delay between activities) and lead (an acceleration of the successor).
Arrow Diagramming Method (ADM)
Also known as Activity-on-Arrow (AOA), ADM represents activities as arrows and events (milestones) as nodes (circles). ADM only supports Finish-to-Start relationships. To maintain unique activity paths and represent complex logical relationships, ADM requires dummy activities —activities with zero duration represented by dashed arrows.
- Feature Precedence Diagramming Method (PDM / AON) Arrow Diagramming Method (ADM / AOA)
- Activity Placement On Nodes (Boxes) On Arrows
- Logical Relationships FS, SS, FF, SF (with lags/leads) FS only
- Dummy Activities Not required Required for logical routing and unique IDs
- Complexity High flexibility, easy to update Less flexible, harder to read in software
- Forward and Backward Pass Calculations
To calculate the project schedule, a double pass is performed through the network diagram using estimated durations ( D D D ). Schedulers typically use the 0-based indexing system (where the project starts at Day 0):
The Forward Pass (Early Dates)
The forward pass determines the earliest possible dates each activity can start and finish. It moves from the project start to the project finish:
Early Start (ES) :
For the project starting activity: E S = 0 ES = 0 ES = 0 .
For any successor activity j j j : E S j = max ( E F i + lag i j ) ES_j = \max(EF_i + \text{lag}_{ij}) E S j = max ( E F i + lag ij ) for all immediate predecessors i i i .
Early Finish (EF) :
Calculated for each activity as: E F = E S + D EF = ES + D EF = ES + D .
The overall project duration is the maximum E F EF EF of the terminal activities.
The Backward Pass (Late Dates)
The backward pass determines the latest possible dates each activity can start and finish without delaying the project completion. It moves from the project finish back to the project start:
Late Finish (LF) :
For the project terminal activity: L F = Project Duration LF = \text{Project Duration} L F = Project Duration (or the target completion date).
For any predecessor activity i i i : L F i = min ( L S j − lag i j ) LF_i = \min(LS_j - \text{lag}_{ij}) L F i = min ( L S j − lag ij ) for all immediate successors j j j .
Late Start (LS) :
Calculated for each activity as: L S = L F − D LS = LF - D L S = L F − D .
Float Calculations
Float (or slack) represents scheduling flexibility. The PE Civil exam requires calculating two types of float:
Total Float (TF)
Total Float is the maximum time an activity can be delayed from its Early Start without delaying the project's overall completion date. It is calculated as: T F = L S − E S = L F − E F TF = LS - ES = LF - EF TF = L S − ES = L F − EF
Activities on the critical path have T F = 0 TF = 0 TF = 0 (assuming no project constraints).
Total Float is shared along a path. If one activity uses the shared Total Float, the float available to subsequent activities on that path decreases.
Free Float (FF)
Free Float is the maximum time an activity can be delayed without delaying the Early Start of any immediate successor activity. It is calculated as: F F = min ( E S successors ) − E F FF = \min(ES_{\text{successors}}) - EF FF = min ( E S successors ) − EF
Free Float belongs solely to that specific activity and is not shared.
Free Float can never exceed Total Float ( F F ≤ T F FF \le TF FF ≤ TF ).
Identifying and Managing the Critical Path
The Critical Path is the continuous sequence of activities from project start to finish that determines the minimum total project duration.
It is the path with the longest cumulative duration .
It is characterized by activities having minimum Total Float (normally zero).
Any delay to an activity on the critical path directly delays the project completion date.
Schedulers use crashing (adding resources to critical activities to shorten their duration) or fast-tracking (performing critical activities in parallel instead of sequentially) to recover delayed schedules. However, these techniques increase project costs and risks.
Detailed Network Walkthrough Example
Let's calculate the schedule for a small project with five activities:
Activity A (Start): D = 4 days D = 4 \text{ days} D = 4 days , no predecessors.
Activity B : D = 6 days D = 6 \text{ days} D = 6 days , predecessor A (FS relationship).
Activity C : D = 3 days D = 3 \text{ days} D = 3 days , predecessor A (FS relationship).
Activity D : D = 5 days D = 5 \text{ days} D = 5 days , predecessor B (FS relationship).
Activity E (Finish): D = 4 days D = 4 \text{ days} D = 4 days , predecessors C and D (FS relationship).
Step 1: Forward Pass
Activity A : E S A = 0 ES_A = 0 E S A = 0 , E F A = 0 + 4 = 4 EF_A = 0 + 4 = 4 E F A = 0 + 4 = 4 .
Activity B : E S B = E F A = 4 ES_B = EF_A = 4 E S B = E F A = 4 , E F B = 4 + 6 = 10 EF_B = 4 + 6 = 10 E F B = 4 + 6 = 10 .
Activity C : E S C = E F A = 4 ES_C = EF_A = 4 E S C = E F A = 4 , E F C = 4 + 3 = 7 EF_C = 4 + 3 = 7 E F C = 4 + 3 = 7 .
Activity D : E S D = E F B = 10 ES_D = EF_B = 10 E S D = E F B = 10 , E F D = 10 + 5 = 15 EF_D = 10 + 5 = 15 E F D = 10 + 5 = 15 .
Activity E : E S E = max ( E F C , E F D ) = max ( 7 , 15 ) = 15 ES_E = \max(EF_C, EF_D) = \max(7, 15) = 15 E S E = max ( E F C , E F D ) = max ( 7 , 15 ) = 15 , E F E = 15 + 4 = 19 EF_E = 15 + 4 = 19 E F E = 15 + 4 = 19 .
The total project duration is 19 days .
Step 2: Backward Pass
Activity E : L F E = 19 LF_E = 19 L F E = 19 , L S E = 19 − 4 = 15 LS_E = 19 - 4 = 15 L S E = 19 − 4 = 15 .
Activity D : L F D = L S E = 15 LF_D = LS_E = 15 L F D = L S E = 15 , L S D = 15 − 5 = 10 LS_D = 15 - 5 = 10 L S D = 15 − 5 = 10 .
Activity C : L F C = L S E = 15 LF_C = LS_E = 15 L F C = L S E = 15 , L S C = 15 − 3 = 12 LS_C = 15 - 3 = 12 L S C = 15 − 3 = 12 .
Activity B : L F B = L S D = 10 LF_B = LS_D = 10 L F B = L S D = 10 , L S B = 10 − 6 = 4 LS_B = 10 - 6 = 4 L S B = 10 − 6 = 4 .
Activity A : L F A = min ( L S B , L S C ) = min ( 4 , 12 ) = 4 LF_A = \min(LS_B, LS_C) = \min(4, 12) = 4 L F A = min ( L S B , L S C ) = min ( 4 , 12 ) = 4 , L S A = 4 − 4 = 0 LS_A = 4 - 4 = 0 L S A = 4 − 4 = 0 .
Step 3: Float Calculations
Activity A : T F A = 0 − 0 = 0 TF_A = 0 - 0 = 0 T F A = 0 − 0 = 0 , F F A = min ( E S B , E S C ) − E F A = min ( 4 , 4 ) − 4 = 0 FF_A = \min(ES_B, ES_C) - EF_A = \min(4, 4) - 4 = 0 F F A = min ( E S B , E S C ) − E F A = min ( 4 , 4 ) − 4 = 0 .
Activity B : T F B = 4 − 4 = 0 TF_B = 4 - 4 = 0 T F B = 4 − 4 = 0 , F F B = E S D − E F B = 10 − 10 = 0 FF_B = ES_D - EF_B = 10 - 10 = 0 F F B = E S D − E F B = 10 − 10 = 0 .
Activity C : T F C = 12 − 4 = 8 TF_C = 12 - 4 = 8 T F C = 12 − 4 = 8 , F F C = E S E − E F C = 15 − 7 = 8 FF_C = ES_E - EF_C = 15 - 7 = 8 F F C = E S E − E F C = 15 − 7 = 8 .
Activity D : T F D = 10 − 10 = 0 TF_D = 10 - 10 = 0 T F D = 10 − 10 = 0 , F F D = E S E − E F D = 15 − 15 = 0 FF_D = ES_E - EF_D = 15 - 15 = 0 F F D = E S E − E F D = 15 − 15 = 0 .
Activity E : T F E = 15 − 15 = 0 TF_E = 15 - 15 = 0 T F E = 15 − 15 = 0 , F F E = 19 − 19 = 0 FF_E = 19 - 19 = 0 F F E = 19 − 19 = 0 .
The critical path is A → B → D → E with a duration of 19 days. Activity C has 8 days of Total Float and 8 days of Free Float, meaning it can be delayed by up to 8 days without impacting the project schedule or its successor Activity E.