Skip to main content
Super Tutor
Detailed ExplanationCELE · Construction Management & MethodsReal content

CELE Construction Management & Methods — Project Planning and Scheduling (CPM/PERT)Detailed Explanation

SummaryConceptsNotesRevisionDeep DiveSlidesFlashcardsMistakesCheatMnemonicsTemplates

Want to really understand Project Planning and Scheduling (CPM/PERT) before tackling CELE Construction Management & Methods questions? This detailed explanation breaks down every key concept, shows you why it matters for the CELE 2026, and walks through the reasoning Professional Regulation Commission (PRC) — Board of Civil Engineering expects on high-difficulty questions.

Exam context

Professional Regulation Commission (PRC) — Board of Civil Engineering runs the Civil Engineer Licensure Examination on May and November 2026. Its Construction Management & Methods section sits under a "Core" weighting, and Project Planning and Scheduling (CPM/PERT) is the 2nd chapter in the 5-chapter CELE Construction Management & Methods rotation. The CELE passing mark is 70% weighted average, no sub-test below 50%, and the most recent 2026 paper drew about a meaningful share of questions from Construction Management & Methods.

Project Planning and Scheduling (CPM/PERT) - Detailed Explanation

Project Planning and Scheduling is a core topic in the PRC Civil Engineer Licensure Examination under Construction Management and Methods. Two indispensable tools are the Critical Path Method (CPM) and the Program Evaluation and Review Technique (PERT). CPM, developed in the late 1950s by DuPont, is deterministic — activity durations are fixed. PERT, developed concurrently by the U.S. Navy for the Polaris missile program, is probabilistic — durations are modeled as random variables. Together, they allow a project engineer to identify which activities control the schedule, how much delay any non-critical activity can absorb before it affects the project completion date, and — in the PERT framework — the probability of meeting a target deadline. For the board exam, expect direct calculation problems: forward/backward pass, total float, critical path identification, PERT expected time and variance, and probability of project completion. Mastery of the mechanics and the underlying logic of these tools is essential.

Concepts

Network Representation and Activity Relationships

A project network is a directed graph in which nodes represent events (or activities in the Activity-on-Node/Precedence Diagram Method, PDM) and arrows represent activities or logical dependencies. Two conventions exist: (1) Activity-on-Arrow (AOA): arrows = activities, nodes = start/end events. Dummy arrows (dashed, zero duration) preserve logic without creating false dependencies. (2) Activity-on-Node (AON) / Precedence Diagram Method (PDM): nodes = activities, arrows = dependencies. The board exam most frequently uses AON. In an AON network, each activity box shows: Activity ID, Duration (d), Early Start (ES), Early Finish (EF), Late Start (LS), and Late Finish (LF). Predecessor–successor relationships define the sequence: you cannot start an activity until all its predecessors are complete (Finish-to-Start, the default). Other relationships (Start-to-Start, Finish-to-Finish, Start-to-Finish) appear in advanced PDM but are rarely tested in Philippine board exams. The network begins at a single start node and terminates at a single end node. If multiple start or end activities exist, a dummy Start or Finish node with zero duration connects them.

Examples

Identifying all unique paths from Start to Finish is the first step before performing the forward and backward pass. The longest path (16 days) will be confirmed as the critical path in subsequent calculations.

Scenario

A road project has six activities: A(4), B(3), C(6), D(5), E(4), F(2) with the following logic: B and C follow A; D follows B; E follows C; F follows both D and E. Draw the AON network structure.

Solution

Start → A(4) → {B(3), C(6)}; B(3) → D(5); C(6) → E(4); {D(5), E(4)} → F(2) → Finish. Paths: A-B-D-F = 4+3+5+2 = 14 days; A-C-E-F = 4+6+4+2 = 16 days.

Applications

  • Bar chart (Gantt chart) derivation from the AON network for field scheduling.
  • Resource allocation planning — understanding which activities are concurrent.
  • Construction sequencing for high-rise buildings, road works, and infrastructure per Philippine DPWH standard project schedules.
  • Contract milestone verification under RA 9184 (Government Procurement Reform Act) project timelines.

Misconceptions

  • Confusing AON and AOA: In AOA, activities are on arrows; in AON, activities are on nodes. Mixing the two leads to incorrect network diagrams.
  • Thinking that a dummy activity in AOA has the same float rules as real activities — dummies are merely logical links and may or may not be on the critical path.
  • Assuming there is only one possible network for a given precedence table — the topology is unique but the graphical layout can vary.

Related Concepts

  • Forward Pass (Early Times)
  • Backward Pass (Late Times)
  • Total Float and Free Float
  • Critical Path Identification

Common Exam Questions

Example

Given activities and predecessors, identify all paths and state their total durations.

Approach

List all paths from Start to Finish systematically, summing activity durations on each path.

Question Type

Network path enumeration

Example

Activities C and D both start after A and both end before E — a dummy resolves the ambiguity in AOA notation.

Approach

Check if two activities share the same start and end events — insert a dummy to differentiate them.

Question Type

Identifying dummy activity need in AOA

Key Points To Remember

  • AON: nodes = activities; arrows = finish-to-start logic.
  • AOA: arrows = activities; nodes = events; dummy arrows fix logical errors.
  • All predecessor EFs must be satisfied before a successor can start.
  • A single-start, single-end network is required for standard CPM analysis.
  • Dummy activities in AOA have zero duration and zero float only if they lie on the critical path.

Forward Pass — Early Start and Early Finish

The forward pass computes the earliest possible times at which each activity can start and finish, working from left (project start) to right (project end). The two fundamental rules are: (1) ES of the very first activity = 0 (project time zero). (2) ES of any activity = maximum EF of all its immediate predecessors. (3) EF = ES + d, where d is the activity duration. The forward pass is performed sequentially — you cannot compute an activity's ES until all predecessor EFs are known. The project's Early Finish (the project duration, T_p) equals the EF of the last activity (or the maximum EF at the terminal node). This value is also the minimum possible project completion time given the logical constraints and deterministic durations.

Examples

At activity E, two predecessors merge. ES(E) is governed by D (EF=14), not C (EF=7). This 'max' rule is the essence of the forward pass — the slowest predecessor controls the start of the successor. The project cannot finish before Day 16.

Scenario

Five activities: A(d=3), B(d=5), C(d=4), D(d=6), E(d=2). Logic: B and C both follow A; D follows B; E follows both C and D. Perform the forward pass.

Solution

A: ES=0, EF=0+3=3. B: ES=EF(A)=3, EF=3+5=8. C: ES=EF(A)=3, EF=3+4=7. D: ES=EF(B)=8, EF=8+6=14. E: ES=max(EF(C),EF(D))=max(7,14)=14, EF=14+2=16. Project duration T_p = 16 days.

Applications

  • Determining contract milestone dates relative to Notice-to-Proceed (NTP) date.
  • Scheduling material deliveries — earliest possible need date for each activity.
  • Manpower and equipment mobilization scheduling.

Misconceptions

  • Taking the MINIMUM instead of the MAXIMUM EF of predecessors when computing ES — this is the most common forward pass error.
  • Forgetting that ES of the very first activity is 0, not 1. Philippine board exams typically use 0-based time.
  • Skipping an activity in the sequence — always verify that all predecessors of an activity have been processed before computing its ES.

Related Concepts

  • Backward Pass (Late Times)
  • Total Float
  • Critical Path Identification
  • Network Representation

Common Exam Questions

Example

Given a 6-activity network with durations and predecessors, find EF of Activity F.

Approach

Trace all predecessor activities, compute their EFs, take the max as the ES of the target activity, then add its duration.

Question Type

Compute EF of a specific activity

Example

What is the minimum project duration for the given network?

Approach

Complete the full forward pass; the project duration is the EF at the terminal node.

Question Type

Find project duration

Key Points To Remember

  • ES(first activity) = 0.
  • ES = max(EF of all predecessors) — take the MAXIMUM when multiple predecessors exist.
  • EF = ES + d for every activity.
  • The EF of the last activity = project duration (T_p).
  • The forward pass moves LEFT to RIGHT through the network.

Backward Pass — Late Start and Late Finish

The backward pass computes the latest allowable times at which each activity can start and finish without delaying the project beyond T_p. It works RIGHT to LEFT through the network. Rules: (1) LF of the last activity = T_p (the project duration from the forward pass). This anchors the backward pass. (2) LF of any activity = minimum LS of all its immediate successors. (3) LS = LF − d. The backward pass must be performed after the forward pass is complete. Note: If the project has a mandatory completion date (T_target) different from T_p, set LF of the last activity = T_target. If T_target < T_p, the project is already late and float values will be negative — a condition that signals the need for crashing.

Examples

At activity A, two successors exist (B and C). LF(A) = min(LS(B), LS(C)) = min(3, 10) = 3. Taking the minimum ensures A finishes in time for the more urgent successor (B). If LF(A) were set to 10, B would be delayed.

Scenario

Using the same five-activity network from the forward pass example (T_p = 16): A(3), B(5), C(4), D(6), E(2). Perform the backward pass.

Solution

E: LF=16, LS=16-2=14. D: LF=LS(E)=14, LS=14-6=8. C: LF=LS(E)=14, LS=14-4=10. B: LF=LS(D)=8, LS=8-5=3. A: LF=min(LS(B),LS(C))=min(3,10)=3, LS=3-3=0.

Applications

  • Determining the latest allowable delivery date for materials (LF of the activity they feed).
  • Establishing contract penalty clause dates — if an activity's LS is missed, the project is delayed.
  • Identifying how much a non-critical activity can be deferred without contractual consequence.

Misconceptions

  • Taking the MAXIMUM instead of the MINIMUM LS of successors when computing LF — this is the mirror-image of the forward pass error.
  • Setting LF of the last activity to something other than T_p without being told a target date exists.
  • Performing the backward pass before completing the forward pass — LF of the terminal node must be known first.

Related Concepts

  • Forward Pass
  • Total Float
  • Critical Path
  • Project Crashing

Common Exam Questions

Example

Find the Late Start of Activity C given the complete network.

Approach

Identify all successors of the activity, find their LS values (already computed working backwards), take the min as LF, then subtract duration.

Question Type

Compute LS of a specific activity

Example

After performing forward and backward passes, identify all critical activities.

Approach

After both passes, check which activities have LS = ES (or LF = EF). These are on the critical path.

Question Type

Verify critical path using both passes

Key Points To Remember

  • LF(last activity) = T_p (or the required completion date).
  • LF = min(LS of all successors) — take the MINIMUM when multiple successors exist.
  • LS = LF − d for every activity.
  • The backward pass moves RIGHT to LEFT through the network.
  • Negative float means the project is behind its target — crashing or schedule revision is required.

Total Float and Free Float

Float (also called slack) is the amount of time an activity can be delayed without causing a problem. Two types are commonly tested: **Total Float (TF):** TF = LS − ES = LF − EF Total float is how much an activity can slip without delaying the PROJECT's overall completion date. Activities with TF = 0 are critical. If TF > 0, the activity has scheduling flexibility. Note that total float is a shared resource among all activities on the same path — if one activity uses its total float, the float of subsequent activities on the same path is reduced accordingly. **Free Float (FF):** FF = ES(earliest successor) − EF(current activity) Free float is how much an activity can slip without delaying the EARLY START of any of its immediate successors. FF ≤ TF always. Free float belongs exclusively to the activity — using it does not affect any other activity's float. **Interfering Float:** IF = TF − FF (rarely tested but worth knowing for completeness). For the board exam, total float is far more frequently tested than free float.

Examples

In this case FF = TF for activity C, meaning C can slip up to 7 days without affecting either the project end date or the early start of its successor E. This occurs because E's ES is already controlled by D (EF=14), not by C. Activity C is completely non-critical and has maximum scheduling flexibility.

Scenario

From the five-activity example: Activity C has ES=3, EF=7, LS=10, LF=14. Activity E (successor to C) has ES=14. Find TF and FF of activity C.

Solution

TF(C) = LS − ES = 10 − 3 = 7 days (OR: LF − EF = 14 − 7 = 7 days ✓) FF(C) = ES(E) − EF(C) = 14 − 7 = 7 days.

The activity can slip 3 days before delaying the project, but only 2 days before pushing back its successor's early start. The 1-day difference (interfering float) would affect the successor but not the project end.

Scenario

An activity has ES=5, EF=9, LS=8, LF=12. Its only successor has ES=11. Find TF and FF.

Solution

TF = LS − ES = 8 − 5 = 3 days. FF = ES(successor) − EF = 11 − 9 = 2 days. IF = TF − FF = 3 − 2 = 1 day.

Applications

  • Scheduling non-critical activities to level manpower and equipment resources.
  • Prioritizing activities for acceleration when budget is limited — focus resources on critical (TF=0) activities.
  • Determining the impact of a delay claim: if a delayed activity has TF > delay duration, the project end date is unaffected.

Misconceptions

  • Thinking that free float can be larger than total float — FF ≤ TF always, by definition.
  • Assuming that using an activity's total float does not affect other activities — TF is shared along the path, so consuming float in one activity reduces the float of downstream activities on the same path.
  • Confusing 'float' with 'lag' — lag is an intentional delay built into the precedence relationship; float is the result of network analysis.

Related Concepts

  • Critical Path
  • Forward Pass
  • Backward Pass
  • Project Crashing

Common Exam Questions

Example

Activity B: ES=3, EF=8, LS=3, LF=8. TF = 3−3 = 0 → critical.

Approach

Perform full forward and backward pass first, then apply TF = LS − ES.

Question Type

Compute total float of a given activity

Example

Which activity can be delayed the longest without affecting project completion?

Approach

Compute TF for all activities; the one with the largest TF has the most flexibility.

Question Type

Identify non-critical activities with maximum scheduling flexibility

Key Points To Remember

  • TF = LS − ES = LF − EF; critical activities have TF = 0.
  • FF = min(ES of successors) − EF of the activity.
  • FF ≤ TF always.
  • Total float is SHARED along a path; free float is EXCLUSIVE to the activity.
  • Negative TF signals that the schedule is already over the target completion date.

Critical Path Identification

The critical path is the longest continuous path from the project's start to its end. It defines the minimum project duration. Every activity on the critical path has TF = 0. Key properties: 1. There can be MORE THAN ONE critical path if two or more paths have equal, longest duration. 2. A project delay occurs ONLY if a critical activity is delayed. Delaying a non-critical activity within its float has no effect on project completion. 3. Shortening the project (crashing) requires reducing the duration of critical path activities. 4. After crashing, the critical path may shift — a previously non-critical path may become the new critical path, requiring further analysis. 5. An activity on the critical path that is also a merge point (multiple predecessors) is particularly sensitive because any delay in ANY of its predecessors can delay the project. Identification method: After both passes, list all activities where ES = LS (equivalently EF = LF, or TF = 0). Trace the connected chain from Start to Finish — this is the critical path.

Examples

TF = 0 identifies individual critical activities. The critical PATH is the connected chain of critical activities. Activity E has TF = 0 here because its LF is set by the project end (14) and it takes 4 days from day 10 — but its predecessor C has TF=2, so the path A-C-E is not the critical path. This subtlety is important: TF=0 on an activity does not always mean it is on the longest path if there is a merge from the true critical path.

Scenario

A project has the following activity data after both passes: A(ES=0,EF=4,LS=0,LF=4), B(ES=4,EF=9,LS=4,LF=9), C(ES=4,EF=8,LS=6,LF=10), D(ES=9,EF=14,LS=9,LF=14), E(ES=10,EF=14,LS=10,LF=14). Logic: B and C follow A; D follows B; E follows C. Project end = 14. Identify the critical path.

Solution

TF(A)=0-0=0 ✓ critical. TF(B)=4-4=0 ✓ critical. TF(C)=6-4=2 → NOT critical. TF(D)=9-9=0 ✓ critical. TF(E)=10-10=0 ✓ critical. Critical path: A → B → D (TF=0 for all three). Duration = 4+5+5 = 14 days. Note: E is also critical but it is on the A-C-E path. TF(C)=2, so A-C-E is NOT a critical path even though E has TF=0 — E is critical because of its position after D merging, not because of C.

Applications

  • Directing management attention and resources to activities that determine project completion.
  • Assessing the impact of change orders — does the change affect a critical or non-critical activity?
  • Formulating schedule recovery plans after delays — only acceleration of critical activities helps.
  • Legal disputes over delay claims under Philippine construction contracts (DPWH Standard General Conditions of Contract).

Misconceptions

  • The critical path is the SHORTEST path — WRONG. It is the LONGEST path, which sets the minimum project duration.
  • There can only be one critical path — WRONG. Multiple paths of equal maximum duration are all critical.
  • Crashing any activity shortens the project — WRONG. Only crashing a critical activity shortens the project (until the critical path shifts).
  • All TF=0 activities form a single critical path — not always true; TF=0 activities may lie on different network branches that converge at a merge point.

Related Concepts

  • Total Float
  • Forward Pass
  • Backward Pass
  • Project Crashing (Time-Cost Tradeoff)

Common Exam Questions

Example

Paths: A-B-D=14, A-C-D=11, A-B-E=13. Critical path: A-B-D, duration=14 days.

Approach

Enumerate all paths, sum durations, identify the longest. Verify with TF=0 after both passes.

Question Type

State the critical path and project duration

Example

Activity C has TF=3. If C is delayed 5 days, project is delayed by 5−3=2 days.

Approach

Check if the activity is critical. If not, compare delay to available TF. If delay exceeds TF, project is delayed by (delay − TF).

Question Type

Effect of delaying a specific activity

Key Points To Remember

  • Critical path = LONGEST path from Start to Finish.
  • Critical activities: TF = 0, meaning ES = LS and EF = LF.
  • Project duration = length of the critical path.
  • Multiple critical paths are possible if two paths have equal maximum duration.
  • Crashing only shortens the project if the activity being crashed is on the critical path.

Project Crashing (Time-Cost Tradeoff)

Crashing is the deliberate shortening of an activity's duration by adding resources (overtime, additional crews, equipment) at increased cost. The time-cost tradeoff analysis determines the most cost-effective way to shorten the project schedule. Key terms: - **Normal time (NT):** Planned duration at normal cost. - **Normal cost (NC):** Cost at normal schedule. - **Crash time (CT):** Minimum achievable duration with maximum resources. - **Crash cost (CC):** Cost at crash duration. - **Crash cost slope = (CC − NC) / (NT − CT):** Additional cost per unit time saved. Always crash the activity with the LOWEST crash cost slope first (cheapest per day saved). Crashing procedure: 1. Identify the critical path. 2. Among critical activities, crash the one with the lowest cost slope (up to its crash limit). 3. Recompute the network — check if the critical path has changed. 4. Repeat until the target duration is reached or all critical activities are fully crashed. 5. If two paths are simultaneously critical, both must be crashed — the combined slope governs the cost. Total cost = Direct cost (increases with crashing) + Indirect cost (decreases with shorter duration). The optimum schedule minimizes total cost.

Examples

When crash cost slope equals indirect cost rate, crashing does not improve or worsen total cost — the project is at the cost-neutral crashing point. If the target were only 1 day, either activity could be crashed for a net zero change. If indirect cost were PhP 3,000/day, crashing would save money (PhP 3,000 − PhP 2,000 = PhP 1,000/day net savings).

Scenario

A project has two critical activities on the critical path: X(NT=8, NC=20,000, CT=5, CC=26,000) and Y(NT=6, NC=15,000, CT=4, CC=19,000). Indirect cost = PhP 2,000/day. The target is to reduce project duration by 2 days. Which activity should be crashed?

Solution

Cost slope X = (26,000−20,000)/(8−5) = 6,000/3 = PhP 2,000/day. Cost slope Y = (19,000−15,000)/(6−4) = 4,000/2 = PhP 2,000/day. Both have equal slopes. Crash either one (or split: 1 day each). Crashing saves: 2 days × PhP 2,000/day indirect cost = PhP 4,000 saved; crashing cost = 2 × PhP 2,000 = PhP 4,000 added. Net change = 0 — indifferent at this target duration.

Applications

  • Fast-tracking of DPWH infrastructure projects to meet government deadlines.
  • Recovering lost schedule after a force majeure event (typhoon, pandemic delays common in Philippine construction).
  • Bid strategy: computing the minimum completion time and associated cost to meet a contract duration requirement.

Misconceptions

  • Crashing the longest activity saves the most time — WRONG. Crash the critical activity with the lowest cost slope.
  • You can crash an activity below its crash time — WRONG. CT is the absolute minimum; further crashing is physically impossible.
  • After crashing, the critical path remains the same — WRONG. Always re-evaluate the network after each crash step.

Related Concepts

  • Critical Path
  • Total Float
  • PERT and Probabilistic Scheduling
  • Resource Leveling

Common Exam Questions

Example

Activity P: NC=PhP18,000, CC=PhP24,000, NT=10d, CT=7d. Slope = 6,000/3 = PhP2,000/day.

Approach

Apply formula: slope = (CC − NC) / (NT − CT). Identify the cheapest to crash.

Question Type

Compute crash cost slope

Example

Reduce project from 16 to 13 days — which activities to crash and at what total additional cost?

Approach

Crash the lowest-slope critical activity first; track days crashed and cost added; repeat if path shifts.

Question Type

Find additional cost to reduce project by N days

Key Points To Remember

  • Crash the CRITICAL PATH activity with the LOWEST cost slope first.
  • Cost slope = (CC − NC) / (NT − CT); units: PhP/day or currency/time unit.
  • Crashing a non-critical activity wastes money — it does not shorten the project.
  • After each crash step, re-evaluate the critical path — it may shift.
  • Optimum schedule = minimum total cost (direct + indirect costs).

PERT — Probabilistic Duration Estimation

In PERT, activity durations are treated as random variables because real-world durations are uncertain (weather, labor productivity, material delivery). A Beta distribution is assumed for each activity duration, characterized by three time estimates: - **a** = optimistic time (best-case; probability ≈ 1/100 of being achieved) - **m** = most likely time (mode; the most probable single estimate) - **b** = pessimistic time (worst-case; probability ≈ 1/100 of being exceeded) **Expected duration (te):** $$t_e = \frac{a + 4m + b}{6}$$ The weight of 4 on the most likely estimate reflects the Beta distribution's shape. The divisor is 6 (= number of standard deviations spanning [a, b] for a Beta distribution). **Variance of a single activity:** $$\sigma^2 = \left(\frac{b - a}{6}\right)^2$$ **Project expected duration (T_e):** T_e = sum of t_e values along the critical path (the path with the largest sum of t_e values). **Project variance:** $$\sigma_T^2 = \sum_{\text{critical path}} \sigma_i^2$$ **Project standard deviation:** $$\sigma_T = \sqrt{\sigma_T^2}$$ By the Central Limit Theorem, the project duration T is approximately normally distributed with mean T_e and standard deviation σ_T. **Probability of meeting a target date T_d:** $$Z = \frac{T_d - T_e}{\sigma_T}$$ Look up Z in a standard normal table (provided in the board exam) to find P(T ≤ T_d).

Examples

Note that te = 7 days is greater than m = 6 days. This happens when the pessimistic estimate (b=14) is farther from m than the optimistic estimate (a=4) — the Beta distribution is right-skewed, pulling the mean above the mode. This is typical in construction where delays are more common than early finishes.

Scenario

PERT Example 1: An activity has a=4, m=6, b=14 days. Find te and σ².

Solution

te = (4 + 4×6 + 14) / 6 = (4 + 24 + 14) / 6 = 42 / 6 = 7 days. σ² = ((14 − 4) / 6)² = (10/6)² = (1.667)² = 2.78 day².

There is a 99.25% probability the project will be completed within 20 days. The large Z value (2.43 standard deviations above the mean of 15 days) shows the target of 20 days is very achievable. In board exams, a standard normal table (z-table) is provided — you need to compute Z correctly and look up the probability. For Z=2.43, P≈0.9925.

Scenario

PERT Example 2 (Board-level): A critical path has three activities with: Activity 1: a=2, m=5, b=8; Activity 2: a=4, m=6, b=14; Activity 3: a=1, m=3, b=5. Find (a) expected project duration, (b) project standard deviation, (c) probability of completing in 20 days.

Solution

(a) te1=(2+20+8)/6=30/6=5d; te2=(4+24+14)/6=42/6=7d; te3=(1+12+5)/6=18/6=3d. T_e = 5+7+3 = 15 days. (b) σ²1=((8−2)/6)²=(6/6)²=1.00; σ²2=((14−4)/6)²=(10/6)²=2.78; σ²3=((5−1)/6)²=(4/6)²=0.44. σ²_T=1.00+2.78+0.44=4.22 day². σ_T=√4.22=2.054 days. (c) Z=(20−15)/2.054=5/2.054=+2.43. P(Z≤2.43)≈0.9925 or 99.25%.

This is the reverse PERT problem — find the schedule date for a given confidence level. Memorize common Z values: z=1.00→84.13%, z=1.28→90%, z=1.645→95%, z=1.96→97.5%, z=2.33→99%.

Scenario

PERT Example 3: A project manager wants to know the target date T_d such that there is an 84.13% probability of on-time completion. T_e=25 days, σ_T=4 days. Find T_d.

Solution

P(Z≤z)=0.8413 → z=+1.00 (from standard normal table). T_d = T_e + z×σ_T = 25 + 1.00×4 = 29 days.

Applications

  • Risk analysis for Philippine infrastructure projects subject to monsoon season delays.
  • Contractual schedule padding — stating completion dates with defined confidence levels.
  • Bid preparation: estimating the probability of incurring delay penalties.
  • Program management for large DPWH or BCDA multi-phase projects.

Misconceptions

  • Adding standard deviations (σ) of critical path activities instead of variances (σ²) — WRONG. Always add VARIANCES first, then take the square root for σ_T.
  • Using non-critical path activities' variances in the project variance — WRONG. Only CRITICAL PATH activity variances contribute to project variance in standard PERT.
  • Thinking te is always equal to m — te = m only when the distribution is symmetric (b−m = m−a). In general te ≠ m.
  • Confusing te (expected duration) with the most likely time m — the PERT te is a weighted average, not the mode.

Related Concepts

  • Critical Path
  • Normal Distribution and Z-scores
  • Standard Deviation and Variance
  • Project Risk Analysis

Common Exam Questions

Example

a=3, m=7, b=9: te=(3+28+9)/6=40/6=6.67 days; σ²=((9−3)/6)²=1.00.

Approach

Directly apply te=(a+4m+b)/6 and σ²=((b−a)/6)². Double-check arithmetic on the weighted sum.

Question Type

Compute te and σ² for a single activity

Example

Critical path variances: 1, 4, 1, 4. σ_T=√10=3.162. If Td=Te+5: Z=5/3.162=1.58 → P≈94.3%.

Approach

Sum variances of critical path activities only; take square root; compute Z=(Td−Te)/σT; look up standard normal table.

Question Type

Compute project standard deviation and probability

Key Points To Remember

  • te = (a + 4m + b) / 6 — most likely time gets weight 4, total weight = 6.
  • σ² = ((b − a) / 6)² for each activity.
  • Project variance = SUM of variances of CRITICAL PATH activities ONLY.
  • Z = (T_d − T_e) / σ_T for probability calculations.
  • PERT assumes independence of activity durations along the critical path.

Practice Problems

The numerator of te: a + 4m + b = 5 + 32 + 17 = 54. Dividing by 6 gives 9. For variance, b−a=12, divided by 6 = 2, squared = 4. This is a clean integer result — memorize this pattern as it appears frequently in board exams. Note te(9) > m(8) because b is farther from m than a: (b−m)=9 vs (m−a)=3, indicating right skew.

Problem

Problem 1 — PERT Duration and Variance An activity in a building construction project has an optimistic duration of a=5 days, most likely m=8 days, and pessimistic b=17 days. Determine: (a) the expected duration te, and (b) the variance σ².

Solution

(a) te = (a + 4m + b) / 6 = (5 + 4×8 + 17) / 6 = (5 + 32 + 17) / 6 = 54 / 6 = 9 days. (b) σ² = ((b − a) / 6)² = ((17 − 5) / 6)² = (12/6)² = (2)² = 4 day². Answer: te = 9 days; σ² = 4 day².

Path enumeration confirms the critical path. The backward pass at B uses min(7,16)=7 because B must be done by Day 7 to allow D to start on time. Activity E has 9 days of float — it can start as late as Day 16 and still reach EF=18, matching G's LS of 18.

Problem

Problem 2 — Critical Path and Project Duration A project network has the following activities and predecessors: - A(d=4): no predecessor - B(d=3): follows A - C(d=7): follows A - D(d=5): follows B - E(d=2): follows B - F(d=6): follows C and D - G(d=3): follows E and F Find (a) all paths and their durations, (b) the critical path, (c) project duration, (d) TF of activities B, E.

Solution

(a) Enumerate paths: Path 1: A-B-D-F-G = 4+3+5+6+3 = 21 days Path 2: A-B-E-G = 4+3+2+3 = 12 days Path 3: A-C-F-G = 4+7+6+3 = 20 days (b) Critical path: A-B-D-F-G (longest path = 21 days). (c) Project duration T_p = 21 days. (d) Forward Pass: A: ES=0, EF=4. B: ES=4, EF=7. C: ES=4, EF=11. D: ES=7, EF=12. E: ES=7, EF=9. F: ES=max(11,12)=12, EF=18. G: ES=max(9,18)=18, EF=21. Backward Pass: G: LF=21, LS=18. F: LF=18, LS=12. E: LF=LS(G)=18, LS=16. D: LF=LS(F)=12, LS=7. C: LF=LS(F)=12, LS=5. B: LF=min(LS(D),LS(E))=min(7,16)=7, LS=4. A: LF=min(LS(B),LS(C))=min(4,5)=4, LS=0. TF(B) = LS−ES = 4−4 = 0 (critical ✓). TF(E) = LS−ES = 16−7 = 9 days.

All four te values computed to exactly 4 or 6 — this is a carefully constructed board-exam style problem with clean arithmetic. The project standard deviation of 2.449 days with a mean of 18 days means the target of 24 days is 2.45 standard deviations above the mean — a very high probability. Always add VARIANCES (not standard deviations) before taking the square root.

Problem

Problem 3 — PERT Project Probability A project's critical path has four activities with the following three-time estimates (days): Activity P: a=2, m=4, b=6 Activity Q: a=3, m=5, b=13 Activity R: a=1, m=4, b=7 Activity S: a=2, m=3, b=10 The project sponsor requires completion by Day 24. Find: (a) expected project duration, (b) project variance, (c) project standard deviation, (d) probability of meeting the Day 24 deadline. (Use Z=1.00→84.13%, Z=1.28→90%, Z=1.65→95%, Z=2.05→98%)

Solution

(a) Expected durations: te(P) = (2+4×4+6)/6 = (2+16+6)/6 = 24/6 = 4 days. te(Q) = (3+4×5+13)/6 = (3+20+13)/6 = 36/6 = 6 days. te(R) = (1+4×4+7)/6 = (1+16+7)/6 = 24/6 = 4 days. te(S) = (2+4×3+10)/6 = (2+12+10)/6 = 24/6 = 4 days. T_e = 4+6+4+4 = 18 days. (b) Variances: σ²(P) = ((6−2)/6)² = (4/6)² = 0.444. σ²(Q) = ((13−3)/6)² = (10/6)² = 2.778. σ²(R) = ((7−1)/6)² = (6/6)² = 1.000. σ²(S) = ((10−2)/6)² = (8/6)² = 1.778. σ²_T = 0.444+2.778+1.000+1.778 = 6.000 day². (c) σ_T = √6.000 = 2.449 days. (d) Z = (T_d − T_e) / σ_T = (24 − 18) / 2.449 = 6 / 2.449 = 2.45. P(Z ≤ 2.45) ≈ 99.3%. Answer: There is approximately 99.3% probability of completing the project by Day 24.

This problem illustrates the distinction between TF and FF precisely. Activity C can slip 3 days total (TF) before the project end date is affected, but only 1 day (FF) before D's early start is pushed. The remaining 2 days of TF are 'interfering float' — using them delays D but not necessarily the project, since D has its own float only if B also delays. In this case, since B is critical (TF=0), any delay to D will delay the project.

Problem

Problem 4 — Total Float and Free Float A network analysis yields the following activity data: Activity A: ES=0, EF=5, LS=0, LF=5 (successor: B, C) Activity B: ES=5, EF=9, LS=5, LF=9 (successor: D) Activity C: ES=5, EF=8, LS=8, LF=11 (successor: D) Activity D: ES=9, EF=16, LS=9, LF=16 (terminal activity) Find: (a) TF of each activity, (b) the critical path, (c) FF of activity C.

Solution

(a) TF calculations: TF(A) = LS−ES = 0−0 = 0. TF(B) = 5−5 = 0. TF(C) = 8−5 = 3 days. TF(D) = 9−9 = 0. (b) Critical path: Activities with TF=0: A, B, D → Critical path: A → B → D. Project duration = EF(D) = 16 days. (c) FF of activity C: FF(C) = ES(earliest successor of C) − EF(C). C's only successor is D, with ES(D) = 9. FF(C) = 9 − 8 = 1 day. Note: TF(C) = 3 days but FF(C) = 1 day. The difference (3−1=2 days) is the interfering float — if C uses more than 1 day of its float, D's early start would be delayed (though since D's ES is governed by B, EF=9, D itself wouldn't actually be delayed in this specific case — ES of D is controlled by B, not C). Wait — re-check: ES(D) = max(EF(B), EF(C)) = max(9, 8) = 9. If C slips by 1 day: EF(C) becomes 9. ES(D) = max(9,9) = 9 — unchanged. If C slips by 2 days: EF(C)=10. ES(D)=max(9,10)=10 — D is now delayed. So FF(C) = 1 day is correct.

Activity Z has a crash slope exactly equal to the indirect cost rate (PhP 3,000/day) — crashing Z to its limit is cost-neutral. Crashing X or Y costs PhP 4,000/day to save PhP 3,000/day in indirect costs — a net loss of PhP 1,000/day. The optimum schedule is the 22-day schedule (crash Z fully, do not crash X or Y). This type of problem — finding the optimum duration to minimize total cost — is a classic board exam question.

Problem

Problem 5 — Project Crashing A road project's critical path has three activities with the following data: | Activity | NT (days) | NC (PhP) | CT (days) | CC (PhP) | |----------|-----------|-----------|-----------|----------| | X | 10 | 50,000 | 7 | 62,000 | | Y | 8 | 40,000 | 6 | 48,000 | | Z | 6 | 30,000 | 4 | 36,000 | Indirect costs = PhP 3,000/day. Current project duration = 24 days. Find: (a) crash cost slopes, (b) optimum crash sequence to reduce project by 4 days, (c) net change in total cost.

Solution

(a) Crash cost slopes: Slope(X) = (62,000−50,000)/(10−7) = 12,000/3 = PhP 4,000/day. Slope(Y) = (48,000−40,000)/(8−6) = 8,000/2 = PhP 4,000/day. Slope(Z) = (36,000−30,000)/(6−4) = 6,000/2 = PhP 3,000/day. (b) Crash Z first (lowest slope = PhP 3,000/day): Crash Z by 2 days (its maximum): Cost added = 2×3,000 = PhP 6,000. Duration: 24→22 days. Now need 2 more days saved. Z is fully crashed. Crash X or Y next (both PhP 4,000/day): Crash Y by 2 days: Cost added = 2×4,000 = PhP 8,000. Duration: 22→20 days. Total crashing cost = 6,000 + 8,000 = PhP 14,000. Indirect savings = 4 days × PhP 3,000/day = PhP 12,000. (c) Net change in total cost = +14,000 − 12,000 = +PhP 2,000 (net increase). Conclusion: Crashing 4 days increases total cost by PhP 2,000. To minimize total cost, crash only Z (2 days) → net change = +6,000 − 6,000 = 0 (break-even). Beyond 2 days of crashing, cost increases.

Exam Preparation Tips

  • Memorize the four core formulas cold: EF=ES+d, LS=LF−d, TF=LS−ES=LF−EF, te=(a+4m+b)/6, σ²=((b−a)/6)². These appear in almost every CPM/PERT exam question.
  • For the forward pass, always take the MAX EF of predecessors for the successor's ES. For the backward pass, always take the MIN LS of successors for the predecessor's LF. Write these rules as mnemonics: 'Forward MAX, Backward MIN.'
  • In PERT, ALWAYS add VARIANCES (σ²) of critical path activities, not standard deviations. Then take the square root at the very end to get σ_T. Adding σ values directly is a fatal error.
  • The critical path is ALWAYS the LONGEST path, not the shortest. In exam questions, if asked 'which path controls project duration?', it is the longest path.
  • Know common Z-values by heart for the standard normal distribution: Z=1.00→84.13%, Z=1.28→90%, Z=1.65→95%, Z=2.33→99%. For reverse PERT (find Td for given probability), extract Z from the table and compute Td=Te+Z×σ_T.
  • For crashing problems, always rank critical activities by crash cost slope (lowest first) and crash them in that order. Verify whether the critical path shifts after each crash step in multi-step problems.
  • Practice drawing complete activity-on-node (AON) tables with columns: Activity, d, Predecessors, ES, EF, LS, LF, TF. Filling this table systematically eliminates computation errors.
  • In network path enumeration problems, trace ALL possible paths systematically. Use alphabetical sequencing or branch tracing to ensure no path is missed. Missing even one path can lead to a wrong critical path identification.
  • When a problem gives you ES, EF, LS, LF directly and asks for TF: verify both formulas (LS−ES AND LF−EF) match as a self-check. Discrepancy indicates a data error in your analysis.
  • In the PRC board exam, CPM/PERT problems often appear as multi-part questions worth several points. Allocate time proportionally — typically 8–12 minutes for a full network analysis problem with PERT extension.
Loading diagram…
Loading diagram…
Loading diagram…
Loading diagram…
Loading diagram…

In summary

Project Planning and Scheduling using CPM and PERT is a quantitative, formula-driven topic that rewards systematic practice. The key hierarchy of concepts is: (1) Build the network correctly from the precedence table; (2) Execute the forward pass (ES, EF) using MAX at merges; (3) Execute the backward pass (LF, LS) using MIN at bursts; (4) Compute Total Float = LS − ES and identify the critical path (TF = 0, longest path); (5) Apply PERT formulas for probabilistic duration analysis, remembering te = (a+4m+b)/6, σ² = ((b−a)/6)², and that project variance = sum of VARIANCES along the critical path only; (6) Use Z = (Td − Te)/σT with the standard normal table for probability questions; and (7) For crashing, rank critical activities by cost slope and crash the cheapest first, re-evaluating the network after each step. For Filipino civil engineering reviewees: these topics are consistently present in the Construction Management section of the PRC board exam. Mastery requires not just memorizing formulas but understanding their logic — why the critical path is the longest, why variances add rather than standard deviations, and why only critical activities matter for crashing. Work through all five practice problems in this chapter under timed conditions, aiming for complete accuracy in 10–12 minutes per full network problem. With consistent drill and formula mastery, CPM/PERT becomes one of the most reliably point-earning topics in the exam. Kaya ninyo ito — good luck on your board examination!

Previous chapter

Construction Estimates and Quantity Surveying

Next chapter

Construction Methods, Equipment and Operations

Ready to practise for the CELE 2026?

Super Tutor's AI review plan adapts to your weak areas and builds a weekly practice schedule around your target CELE exam date.

Start free See the full CELE guide CELE preparation guide
← Back to Construction Management & Methods hub