CPM-01 Chapter 01 · Project Planning, Work Breakdown Structure (WBS), Bar Charts, Milestone Charts & Network Logic

Project Planning, Work Breakdown Structure (WBS), Bar Charts, Milestone Charts & Network Logic

In this chapter (1 topics)
On this page
  1. 1. Module Overview & Pedagogical Scope
  2. 2. Learning Objectives & Exam Weightage Analysis
  3. Learning Objectives
  4. Exam Weightage Analysis
  5. 3. Project Management Fundamentals & The 4 Ms of Construction
  6. 3.1 The 4 Ms of Construction
  7. 3.2 The Project Life-Cycle Phases
  8. 4. Work Breakdown Structure (WBS) & Scope Decomposition
  9. 4.1 The Hierarchy Levels of WBS
  10. 4.2 The 100% Rule of WBS
  11. 5. Bar Charts (Gantt Schedules) & Milestone Charts: Architecture & Critical Flaws
  12. 5.1 Architecture of Henry Gantt's Bar Chart (1917)
  13. 5.2 Merits of Bar Charts
  14. 5.3 Inherent Limitations & Fatal Flaws of Bar Charts
  15. 5.4 Milestone Charts
  16. 6. Resource Aggregation Histograms & Cumulative Cash S-Curves
  17. 6.1 Resource Aggregation (Histogram)
  18. 6.2 The Cumulative Cash Flow S-Curve
  19. 6.3 The Project "Banana Curve" Cash Envelope
  20. 7. Network Fundamentals: Events, Activities & Topological Logic
  21. 7.1 Elements of an AOA (Activity-on-Arrow) Network
  22. 8. Dummy Activities: Grammatical vs Logical Dummies
  23. 8.1 Grammatical Dummy
  24. 8.2 Logical Dummy
  25. 8.3 Redundant Dummy
  26. 9. Network Integrity: Cycling, Dangling & Validation Rules
  27. 10. Fulkerson's Numbering Algorithm & AON Precedence Diagramming (PDM)
  28. 10.1 Fulkerson's Event Numbering Algorithm
  29. 10.2 Activity-on-Node (AON) / Precedence Diagramming Method (PDM)
  30. 11. Step-by-Step Rigorous Worked Numerical Examples
  31. Problem 1: AOA Network Construction, Dummy Identification & Fulkerson Numbering
  32. Problem 2: Resource Histogram Aggregation & Cash S-Curve
  33. Problem 3: AON Precedence Logic with Leads and Lags
  34. 12. Comprehensive Exam Question Bank
  35. Section A: GATE CE Previous Years & Anticipated Styles
  36. Section B: UPSC ESE Conventional Practice
  37. Section C: SSC JE & State AE/JE Quick Fire
  38. 13. Common Conceptual Pitfalls & Field Traps
  39. 14. Quick Reference Formulas & Multi-Code Summary Table

1. Module Overview & Pedagogical Scope

Modern civil engineering projects—high-speed rail corridors, multi-span bridges, super-tall towers, hydroelectric dams, and multi-lane expressways—are large-scale, complex socio-technical systems characterized by massive capital investments, tight deadlines, interdisciplinary technical teams, and severe environmental constraints. Delivering these capital assets within budgeted costs and targeted timelines demands structured, quantitative project planning and control techniques.

Historically, project scheduling relied upon visual representations such as the Gantt Bar Chart (developed by Henry Gantt during World War I). While bar charts provide intuitive visual communication on construction jobsites, their inability to depict activity interdependencies, identify critical bottlenecks, or accommodate uncertainty led to the development of mathematical graph-theoretic network techniques: the Critical Path Method (CPM) and the Program Evaluation and Review Technique (PERT).

This introductory master module for Subject 13 establishes:

  1. Construction Management Principles: Management frameworks, project life-cycle phases, and the orchestration of the "4 Ms" of construction: Men (Labor), Materials, Machinery (Equipment), and Money (Capital).
  2. Work Breakdown Structure (WBS): Systematic hierarchical scope decomposition from the complete project down to sub-projects, work packages, and discrete measurable activities following the 100%100\% rule.
  3. Bar Charts & Milestone Charts: Graphical mechanics, operational advantages on the jobsite, and four fatal mathematical limitations.
  4. Resource Aggregation & Cash S-Curves: Daily/weekly labor and cost histograms, peak demand detection, and cumulative sigmoidal expenditure curves (the Project Cash S-Curve and the Early/Late Start "Banana Curve" envelope).
  5. Network Topology & Logic: Directed acyclic graphs, Activity-on-Arrow (AOA) mechanics, tail and head events, concurrent/preceding/succeeding activities, and dummy activities (grammatical vs logical).
  6. Network Integrity & Numbering: Detection and elimination of looping/cycling, dangling, and redundancy errors, Fulkerson's Event Numbering Algorithm (i<ji < j), and Activity-on-Node (AON) / Precedence Diagramming Method (PDM) dependency relationships.
Gantt Bar Charts, Milestones & Cash S-Curves

2. Learning Objectives & Exam Weightage Analysis

Learning Objectives

  1. Explain the project life-cycle phases and construct a multi-level Work Breakdown Structure (WBS) down to work package level.
  2. Construct and critique Gantt bar charts, milestone charts, and resource aggregation histograms, and derive the cumulative S-curve.
  3. Differentiate between grammatical dummies and logical dummies in Activity-on-Arrow (AOA) networks and eliminate redundant dummies.
  4. Detect topological network errors (cycling/looping, dangling events, duplicate activity identifiers) in complex network configurations.
  5. Apply Fulkerson's rule to number all network events systematically such that the tail event index ii is strictly less than the head event index jj for every directed arrow.
  6. Formulate Activity-on-Node (AON) / Precedence Diagramming Method (PDM) relationships: Finish-to-Start (FSFS), Start-to-Start (SSSS), Finish-to-Finish (FFFF), and Start-to-Finish (SFSF) with leads and lags.

Exam Weightage Analysis

Exam Stream Typical Question Type Average Weightage Recurring Focus Concepts
GATE CE Conceptual Multiple Choice (MCQ) & NAT 1 – 2 Marks Dummy activity identification, minimum dummies in network, Fulkerson rule condition (i<ji < j), AON lead/lag calculations.
UPSC ESE (Prelims & Mains) Objective + Multi-step Conventional 10 – 18 Marks Limitations of bar charts, construction of AOA network with minimum dummies, resource leveling vs smoothing, WBS 100% rule.
SSC JE / RRB JE Objective (Conceptual & Definitions) 2 – 4 Questions Definition of dummy activity (zero time/cost), Fulkerson rule, inventor of bar chart (Henry Gantt), milestone chart features.
State PSC AE/JE Mixed Objective & Short Problem 3 – 6 Marks Minimum dummies required for given precedence tables, looping error identification, Cash S-curve characteristics.

3. Project Management Fundamentals & The 4 Ms of Construction

Construction project management is the art and science of coordinating human, financial, physical, and technological resources throughout a project's life cycle to achieve predetermined objectives of scope, quality, time, and cost.

3.1 The 4 Ms of Construction

  1. Men (Labor): Skilled, semi-skilled, and unskilled workforce. Labor productivity is the most volatile variable on a construction site, susceptible to weather, motivation, supervision, and site logistics.
  2. Materials: Consumable physical inputs (cement, structural steel, aggregate, timber, admixtures, pipes, cables). Materials constitute 50%−65%50\% - 65\% of the direct capital cost of civil construction.
  3. Machinery (Equipment): Heavy construction plants (earthmovers, tower cranes, transit mixers, concrete pumps, asphalt batching plants, piling rigs). Involves high capital investment and ownership versus operating economics.
  4. Money (Finance): Capital cash flow, working capital, progress billing, retention money, bank guarantees, and contingency reserves.

3.2 The Project Life-Cycle Phases

  1. Concept & Feasibility Phase: Identifying the infrastructure need, conducting pre-feasibility and detailed project reports (DPR), financial viability analysis (Internal Rate of Return IRR, Cost-Benefit Ratio CBR), and Environmental Impact Assessment (EIA).
  2. Engineering & Detailed Design Phase: Architectural drafting, structural design (IS 456, IS 800), geotechnical soil investigation, bill of quantities (BOQ), and preparation of tender documents.
  3. Tendering & Procurement Phase: Notice Inviting Tender (NIT), pre-qualification, bid evaluation, award of contract, and signing of legal agreement.
  4. Construction Execution Phase: Site mobilization, layout surveying, structural erection, quality control tests, site safety audits, progress monitoring against baseline schedules.
  5. Commissioning & Handover Phase: Non-destructive testing, load testing of bridges, system dry runs, snag list clearance, as-built drawing preparation, and formal transfer of physical possession to the owner/client.
  6. Operations & Maintenance (O&M): Defect Liability Period (DLP), routine maintenance, and asset management.

4. Work Breakdown Structure (WBS) & Scope Decomposition

A Work Breakdown Structure (WBS) is a deliverables-oriented hierarchical decomposition of the total scope of work to be carried out by the project team.

4.1 The Hierarchy Levels of WBS

Level 1: Total Project (e.g., Elevated Metro Rail Line 1 - 25 km)
   │
   ├── Level 2: Sub-Projects / Major Packages (e.g., Viaduct Civil, Stations, Trackwork, Traction)
   │      │
   │      ├── Level 3: Sub-Networks / Components (e.g., Station Pier Foundations, Pier Caps, Girders)
   │      │      │
   │      │      ├── Level 4: Work Packages (e.g., Pier Piling Group 14 to 28)
   │      │      │      │
   │      │      │      └── Level 5: Discrete Activities (e.g., Rig setup, Bore boring, Cage lowering, Concreting)

4.2 The 100% Rule of WBS

The 100%100\% Rule states that the WBS must capture 100%100\% of the work defined by the project scope, including internal project management, QA/QC, and safety.

  • The sum of work at each "child" level must equal 100%100\% of the work represented by the "parent" element.
  • No work outside the scope should be included, and no work within the scope should be omitted.
  • Work Package: The lowest level of the WBS where cost and duration can be reliably estimated, scheduled, monitored, and assigned to a single responsible organizational unit (Cost Account).

5. Bar Charts (Gantt Schedules) & Milestone Charts: Architecture & Critical Flaws

5.1 Architecture of Henry Gantt's Bar Chart (1917)

A bar chart consists of two orthogonal coordinate axes:

  • Vertical Axis: A sequential list of all construction activities.
  • Horizontal Axis: A linear calendar time scale (hours, days, weeks, months).
  • Each activity is plotted as a horizontal bar whose left end marks the scheduled start, whose length represents the planned duration (tt), and whose right end marks the scheduled completion date.

5.2 Merits of Bar Charts

  1. Highly intuitive visual appeal; easily comprehended by non-technical stakeholders, tradesmen, and site foremen.
  2. Excellent for displaying overall project duration and broad progress milestones.
  3. Readily displays physical percentage completion by hatching/shading the active bars.

5.3 Inherent Limitations & Fatal Flaws of Bar Charts

Despite their widespread visual usage, bar charts suffer from four critical deficiencies:

  1. Lack of Activity Interdependency (Precedence Logic):
    Bars do not show which task must finish before another can begin. If Activity AA is delayed by 4 days, the bar chart fails to indicate whether Activity CC can proceed independently or must stall, hiding the ripple effect.
  2. Inability to Identify the Critical Path:
    All bars appear visually identical. Management cannot distinguish between critical activities (whose delay delays the entire project) and non-critical activities (which possess buffer time or float).
  3. No Representation of Uncertainties:
    Bar charts are strictly deterministic. They assume static, fixed task durations and cannot model probabilistic variations or stochastic weather impacts (as handled by PERT).
  4. Cumbersome Progress Updating:
    Dynamic site modifications cannot be recalculated automatically. Updating a delayed bar chart requires redrawing the entire schedule manually.

5.4 Milestone Charts

To mitigate the lack of dependencies in pure bar charts, Milestone Charts were introduced. Key project events of special importance—such as "Foundation Concrete Completed", "Boiler Drum Lifted", or "Substation Energized"—are marked as distinct geometric symbols (typically diamonds ⧫\blacklozenge or circles ◯\bigcirc) on the bar chart.

  • Limitation: While milestones highlight critical dates, they still fail to show activity-to-activity logic and cannot compute mathematical floats.

6. Resource Aggregation Histograms & Cumulative Cash S-Curves

6.1 Resource Aggregation (Histogram)

By projecting the daily resource consumption (manpower, equipment hours, daily expenditure) of each active bar down onto the horizontal time axis and summing them vertically, a Resource Aggregation Histogram is obtained.

  • Highlights peak resource demands (e.g., maximum daily skilled masons or maximum daily concrete transit mixer trucks).
  • In unconstrained scheduling, resource histograms display erratic spikes and valleys, leading to inefficient hiring/firing of labor and idle equipment costs.
  • Serves as the raw baseline for Resource Leveling (smoothing peaks within float limits) and Resource Allocation (shifting activities under hard resource ceilings).

6.2 The Cumulative Cash Flow S-Curve

When the cumulative expenditure of a project is plotted as a function of time, it universally assumes a characteristic sigmoidal "S" shape:

  1. Initial Tail (Slow Ramp-Up): Early project stage characterized by low expenditure rates during mobilization, topographical surveying, geotechnical testing, submittals, and permits.
  2. Central Stem (Steep Maximum Slope): Middle execution stage where primary civil, structural, and electro-mechanical work proceeds simultaneously. Peak daily cash burn rate (dCdt=maximum\frac{dC}{dt} = \text{maximum}).
  3. Upper Plateau (Tapering Off): Final closing stage characterized by diminishing expenditure during architectural snagging, testing, dry runs, commissioning, and handover.

6.3 The Project "Banana Curve" Cash Envelope

If a project is scheduled with all activities starting at their Earliest Start Times (ESES), the resulting cumulative cost curve forms the upper boundary. If all activities are scheduled at their Latest Start Times (LSLS), the resulting curve forms the lower boundary. The enclosed area between the Early-Start S-curve and Late-Start S-curve is known as the Banana Envelope:

  • Any actual site progress curve falling inside the banana envelope represents a feasible, controlled project.
  • Crossing below the Late-Start curve indicates an irreversible project delay that directly postpones final project completion!

7. Network Fundamentals: Events, Activities & Topological Logic

Network Logic: AOA vs AON, Dummies & Fulkerson's Rule

A network is a directed acyclic graph (DAG) representing the operational sequence and interdependencies of all activities comprising a project.

7.1 Elements of an AOA (Activity-on-Arrow) Network

  1. Activity: A distinct, identifiable task or operation that consumes time and resources (men, material, equipment, money).
    • Represented by a directed straight arrow (⟶\longrightarrow).
    • Length, orientation, and slope of the arrow have no mathematical significance.
    • Identified by its boundary nodes (i−j)(i - j), where ii is the tail event and jj is the head event.
  2. Event (Node): An instantaneous accomplishment or milestone representing the beginning or completion of an activity.
    • Represented by a geometric node (circle ◯\bigcirc, square, or rectangle).
    • An event consumes zero time and zero resources.
    • Tail Event (ii): Event marking the start of an activity.
    • Head Event (jj): Event marking the finish of an activity.
    • Burst Event: A single event from which multiple activities diverge.
    • Merge Event: A single event into which multiple activities converge.

8. Dummy Activities: Grammatical vs Logical Dummies

A Dummy Activity is a simulated, artificial arrow introduced into an AOA network solely to maintain structural logic.

Duration of Dummy =0,Resource Consumption of Dummy =0\mathbf{\text{Duration of Dummy } = 0, \qquad \text{Resource Consumption of Dummy } = 0}

Dummies are represented graphically by a dashed line arrow (⇢\dashrightarrow).

8.1 Grammatical Dummy

In computerized scheduling software, every activity must be uniquely identified by its tail and head node numbers (i−j)(i - j).

  • If two or more concurrent activities (e.g., AA and BB) start from the same initial node 11 and terminate at the same completion node 22, both would be designated as (1−2)(1 - 2). This creates ambiguity.
  • Remedy: A new intermediate event is inserted, and a grammatical dummy is added (e.g., Activity AA becomes (1−2)(1 - 2), Activity BB becomes (1−3)(1 - 3), and dummy connects (3⇢2)(3 \dashrightarrow 2)).

8.2 Logical Dummy

Used to enforce true sequential predecessor relationships without creating false, unintended dependencies.

  • Scenario: Activity CC depends strictly on Activity AA. Activity DD depends on both Activity AA and Activity BB.
  • Incorrect Layout: If both AA and BB terminate at node 22, and both CC and DD originate from node 22, then Activity CC would falsely become dependent on Activity BB!
  • Correct Layout: Activity AA terminates at node 33; Activity CC originates from node 33 (depends only on AA). Activity BB terminates at node 44. A dashed logical dummy arrow is drawn from node 3⇢43 \dashrightarrow 4. Activity DD originates from node 44 (depends on BB directly and on AA via the dummy).

8.3 Redundant Dummy

A dummy activity that repeats a dependency sequence already established by other direct or indirect paths is redundant and must be pruned to avoid computational clutter.

  • If path A→B→CA \to B \to C exists, a dummy drawn directly from A⇢CA \dashrightarrow C is redundant.

9. Network Integrity: Cycling, Dangling & Validation Rules

A valid CPM/PERT network must strictly comply with the following topological axioms:

  1. No Looping (Cycling Error):
    Arrows must flow continuously forward in time. No sequence of activities can form a closed loop returning to an earlier event (1→2→3→11 \to 2 \to 3 \to 1). Looping creates infinite time accumulation during forward pass calculations.
  2. No Dangling Events:
    No activity arrow may be left disconnected. Every event—except the initial project start node and the final terminal completion node—must have at least one incoming arrow and at least one outgoing arrow. A disconnected intermediate branch is a dangling error.
  3. Single Start and Single Finish Rule:
    A project must have exactly one initial origin event and exactly one terminal end event. If multiple parallel tasks initiate or conclude the project, they must merge into single boundary nodes.
  4. Arrow Unidirectionality:
    Arrows can cross each other if necessary (using an arched bridge graphic), but arrows must point strictly in the direction of time progress (generally left to right).

10. Fulkerson's Numbering Algorithm & AON Precedence Diagramming (PDM)

10.1 Fulkerson's Event Numbering Algorithm

Developed by D. R. Fulkerson in 1962, this algorithm provides a systematic procedure for numbering all events in an AOA network such that for every directed arrow (i−j)(i - j):

i<j\mathbf{i < j}

(The tail node index is strictly smaller than the head node index, eliminating backward looping).

The 4-Step Fulkerson Procedure:

  1. Step 1: Locate the initial event of the project (an event having only outgoing arrows and zero incoming arrows). Assign it number 11.
  2. Step 2: Mentally delete or cross out all arrows originating from event 11. This exposes one or more new events that now have zero incoming arrows.
  3. Step 3: Number these newly uncovered events consecutively as 2,3,4,…2, 3, 4, \dots in any arbitrary order.
  4. Step 4: Mentally delete all arrows emerging from the newly numbered events. Repeat the process until the final terminal event is assigned the highest integer index NN.

10.2 Activity-on-Node (AON) / Precedence Diagramming Method (PDM)

In modern construction scheduling software (such as Primavera P6 and Microsoft Project), the Activity-on-Node (AON) method has largely superseded AOA:

  • Activities are represented by nodes (rectangles or circles).
  • Arrows represent dependency constraints (finish-to-start, start-to-start, etc.).
  • Zero Dummies: Dummy activities are completely eliminated!

The Four PDM Dependency Relationships:

  1. Finish-to-Start (FS+lagFS + \text{lag}):
    Successor activity BB cannot begin until predecessor AA finishes, plus any specified buffer lag time: ESB≥EFA+LagFSES_B \ge EF_A + \text{Lag}_{FS} (The standard relationship in traditional CPM/PERT; if lag =0= 0, ESB=EFAES_B = EF_A).
  2. Start-to-Start (SS+lagSS + \text{lag}):
    Successor activity BB cannot start until predecessor AA has started and progressed by a specified lead/lag: ESB≥ESA+LagSSES_B \ge ES_A + \text{Lag}_{SS} (Used for fast-tracking pipelined civil works, e.g., structural backfilling starts 3 days after pipe laying commences).
  3. Finish-to-Finish (FF+lagFF + \text{lag}):
    Successor activity BB cannot finish until predecessor AA finishes, plus a lag: EFB≥EFA+LagFFEF_B \ge EF_A + \text{Lag}_{FF}
  4. Start-to-Finish (SF+lagSF + \text{lag}):
    Successor activity BB cannot finish until predecessor AA starts: EFB≥ESA+LagSFEF_B \ge ES_A + \text{Lag}_{SF} (Rarely utilized in civil engineering; used in shift changeover logistics).

11. Step-by-Step Rigorous Worked Numerical Examples

Problem 1: AOA Network Construction, Dummy Identification & Fulkerson Numbering

Problem Statement:
A civil engineering construction project consists of 9 distinct work activities. The precedence requirements among the activities are defined as follows:

  • Activity AA: Predecessors = None
  • Activity BB: Predecessors = None
  • Activity CC: Predecessor = AA
  • Activity DD: Predecessors = A,BA, B
  • Activity EE: Predecessor = BB
  • Activity FF: Predecessor = CC
  • Activity GG: Predecessors = C,DC, D
  • Activity HH: Predecessors = D,ED, E
  • Activity KK: Predecessors = F,G,HF, G, H
  1. Analyze the precedence logic and determine where dummy activities are strictly necessary.
  2. Construct the complete Activity-on-Arrow (AOA) network with the minimum number of dummy activities.
  3. Apply Fulkerson's rule to number all network events systematically and verify that i<ji < j holds for every activity.

Step 1: Logic and Dummy Analysis

  • Analysis of Initial Tasks: AA and BB have no predecessors, so both emerge from initial project start event 11.
  • Dependency of C,D,EC, D, E:
    • CC depends ONLY on AA.
    • EE depends ONLY on BB.
    • DD depends on BOTH AA and BB.
    • Trap: If AA and BB terminate at a shared node, CC would falsely depend on BB, and EE would falsely depend on AA.
    • Resolution: Let AA terminate at event 22 (from which CC begins directly). Let BB terminate at event 33 (from which EE begins directly).
    • Create a new event 44 where DD begins. Connect event 2⇢42 \dashrightarrow 4 with dummy D1D_1, and connect event 3⇢43 \dashrightarrow 4 with dummy D2D_2. Now DD depends on both AA and BB, while CC and EE remain independent!
  • Dependency of F,G,HF, G, H:
    • FF depends ONLY on CC. Let CC terminate at event 55, from which FF originates directly.
    • DD terminates at event 66. Neither GG (which needs C,DC, D) nor HH (which needs D,ED, E) can originate directly at event 66 if CC or EE were merged into event 66, because merging CC into 66 would falsely make HH depend on CC, while merging EE into 66 would falsely make GG depend on EE.
    • Since EE has no successor other than HH, let EE terminate directly at event 88 (the tail event of HH), and introduce dummy D5D_5 from event 6⇢86 \dashrightarrow 8. Now event 88 has exact predecessors {D,E}\{D, E\}!
    • Create event 77 as the tail event of GG, and connect event 5⇢75 \dashrightarrow 7 with dummy D3D_3 and event 6⇢76 \dashrightarrow 7 with dummy D4D_4. Now event 77 has exact predecessors {C,D}\{C, D\}!
    • Finally, merge FF, GG, and HH into event 99, from which terminal activity K:(9−10)K: (9-10) originates.
  • Minimum Number of Dummies Required: 5 dummies\mathbf{5\text{ dummies}} (D1,D2,D3,D4,D5D_1, D_2, D_3, D_4, D_5) across 1010 events (Note: if EE also required an isolated head node, 66 dummies would be needed; terminating EE directly at event 88 saves 11 dummy).

Step 2: System Event Topology & Fulkerson Numbering

Applying Fulkerson's rule:

  • Event 11: Initial start node (predecessor to AA and BB).
  • Event 22: Head of AA, tail of CC and dummy D1D_1.
  • Event 33: Head of BB, tail of EE and dummy D2D_2.
  • Event 44: Merging head of dummies D1,D2D_1, D_2, tail of DD.
  • Event 55: Head of CC, tail of FF and dummy D3D_3.
  • Event 66: Head of DD, tail of dummies D4D_4 and D5D_5.
  • Event 77: Merging head of dummies D3,D4D_3, D_4, tail of GG.
  • Event 88: Merging head of EE and dummy D5D_5, tail of HH.
  • Event 99: Merging head of F,G,HF, G, H, tail of KK.
  • Event 1010: Terminal project completion event (head of KK).

Verification of i<ji < j across all 99 activities and 55 dummies:

  • A:(1−2)  ⟹  1<2A: (1-2) \implies 1 < 2 [OK]
  • B:(1−3)  ⟹  1<3B: (1-3) \implies 1 < 3 [OK]
  • C:(2−5)  ⟹  2<5C: (2-5) \implies 2 < 5 [OK]
  • D1:(2−4)  ⟹  2<4D_1: (2-4) \implies 2 < 4 [OK]
  • D2:(3−4)  ⟹  3<4D_2: (3-4) \implies 3 < 4 [OK]
  • D:(4−6)  ⟹  4<6D: (4-6) \implies 4 < 6 [OK]
  • E:(3−8)  ⟹  3<8E: (3-8) \implies 3 < 8 [OK]
  • D3:(5−7)  ⟹  5<7D_3: (5-7) \implies 5 < 7 [OK]
  • D4:(6−7)  ⟹  6<7D_4: (6-7) \implies 6 < 7 [OK]
  • D5:(6−8)  ⟹  6<8D_5: (6-8) \implies 6 < 8 [OK]
  • F:(5−9)  ⟹  5<9F: (5-9) \implies 5 < 9 [OK]
  • G:(7−9)  ⟹  7<9G: (7-9) \implies 7 < 9 [OK]
  • H:(8−9)  ⟹  8<9H: (8-9) \implies 8 < 9 [OK]
  • K:(9−10)  ⟹  9<10K: (9-10) \implies 9 < 10 [OK] Every single arrow points from a lower-numbered event to a higher-numbered event (i<ji < j).

Problem 2: Resource Histogram Aggregation & Cash S-Curve

Problem Statement:
A commercial warehouse expansion project consists of 5 overlapping activities with planned schedule days and uniform daily expenditure:

  • Activity AA (Excavation): Days 1 to 4, Daily cost = $10,000/day
  • Activity BB (Foundation): Days 3 to 7, Daily cost = $15,000/day
  • Activity CC (Superstructure): Days 5 to 9, Daily cost = $20,000/day
  • Activity DD (Masonry & Roof): Days 8 to 11, Daily cost = $12,000/day
  • Activity EE (Services & Finishes): Days 10 to 12, Daily cost = $8,000/day

Compute:

  1. The daily expenditure profile for all 12 days.
  2. The peak daily funding demand and identify the peak days.
  3. The total project capital cost.
  4. Construct the cumulative expenditure table and verify the characteristics of the cumulative S-curve.

Step 1: Compute Daily Expenditure by Vertical Aggregation

  • Day 1: Activity AA active   ⟹  $10,000\implies \$10,000
  • Day 2: Activity AA active   ⟹  $10,000\implies \$10,000
  • Day 3: Activities A+BA + B active   ⟹  10,000+15,000=$25,000\implies 10,000 + 15,000 = \$25,000
  • Day 4: Activities A+BA + B active   ⟹  10,000+15,000=$25,000\implies 10,000 + 15,000 = \$25,000
  • Day 5: Activities B+CB + C active   ⟹  15,000+20,000=$35,000\implies 15,000 + 20,000 = \$35,000
  • Day 6: Activities B+CB + C active   ⟹  15,000+20,000=$35,000\implies 15,000 + 20,000 = \$35,000
  • Day 7: Activities B+CB + C active   ⟹  15,000+20,000=$35,000\implies 15,000 + 20,000 = \$35,000
  • Day 8: Activities C+DC + D active   ⟹  20,000+12,000=$32,000\implies 20,000 + 12,000 = \$32,000
  • Day 9: Activities C+DC + D active   ⟹  20,000+12,000=$32,000\implies 20,000 + 12,000 = \$32,000
  • Day 10: Activities D+ED + E active   ⟹  12,000+8,000=$20,000\implies 12,000 + 8,000 = \$20,000
  • Day 11: Activities D+ED + E active   ⟹  12,000+8,000=$20,000\implies 12,000 + 8,000 = \$20,000
  • Day 12: Activity EE active   ⟹  $8,000\implies \$8,000

Step 2: Peak Daily Demand

Peak Daily Demand=$35,000/day(Occurs on Days 5, 6, and 7)\mathbf{\text{Peak Daily Demand} = \$35,000/\text{day}} \quad (\text{Occurs on Days 5, 6, and 7})

Step 3: Total Project Cost

Total Cost=10+10+25+25+35+35+35+32+32+20+20+8=$287,000\text{Total Cost} = 10 + 10 + 25 + 25 + 35 + 35 + 35 + 32 + 32 + 20 + 20 + 8 = \mathbf{\$287,000}

Step 4: Cumulative Expenditure & S-Curve Values

Day (tt) Active Activities Daily Cost ($k) Cumulative Cost ($k) Cumulative % of Budget
1 AA 1010 1010 3.48%3.48\%
2 AA 1010 2020 6.97%6.97\%
3 A,BA, B 2525 4545 15.68%15.68\%
4 A,BA, B 2525 7070 24.39%24.39\%
5 B,CB, C 3535 105105 36.59%36.59\%
6 B,CB, C 3535 140140 48.78%48.78\%
7 B,CB, C 3535 175175 60.98%60.98\%
8 C,DC, D 3232 207207 72.13%72.13\%
9 C,DC, D 3232 239239 83.28%83.28\%
10 D,ED, E 2020 259259 90.24%90.24\%
11 D,ED, E 2020 279279 97.21%97.21\%
12 EE 88 287\mathbf{287} 100.00%\mathbf{100.00\%}

S-Curve Check: The curve exhibits a slow initial slope (spending only 7%7\% in the first 2 days), a steep linear rise between Days 3 and 8 (72%72\% accumulated), and a smooth horizontal asymptote plateauing to 100%100\% on Day 12.


Problem 3: AON Precedence Logic with Leads and Lags

Problem Statement:
In a highway flyover project, two major structural operations are scheduled using the Precedence Diagramming Method (AON):

  • Activity XX (Fabrication of Precast Prestressed Girders): Duration dX=10 daysd_X = 10\text{ days}, begins at project day ESX=0ES_X = 0.
  • Activity YY (Erection of Girders by Launcher Gantry): Duration dY=12 daysd_Y = 12\text{ days}.

The project specifications mandate two simultaneous precedence constraints between XX and YY:

  1. Constraint 1 (Start-to-Start): Erection cannot begin until at least 4 days of girder fabrication are completed: Relationship: SS+4 days\text{Relationship: } SS + 4\text{ days}.
  2. Constraint 2 (Finish-to-Finish): Erection cannot be completed until at least 2 days after all girder fabrication is finalized: Relationship: FF+2 days\text{Relationship: } FF + 2\text{ days}.

Determine:

  1. The Early Start (ESYES_Y) and Early Finish (EFYEF_Y) of Activity YY.
  2. Which constraint actively governs the schedule of Activity YY.
  3. The total combined elapsed duration for completing both operations.

Step 1: Compute Times for Predecessor Activity XX

ESX=0 daysES_X = 0\text{ days} EFX=ESX+dX=0+10=10 daysEF_X = ES_X + d_X = 0 + 10 = 10\text{ days}

Step 2: Formulate Precedence Constraints for Activity YY

  • From Constraint 1 (SS+4 daysSS + 4\text{ days}):

    ESY≥ESX+LagSS=0+4=4 daysES_Y \ge ES_X + \text{Lag}_{SS} = 0 + 4 = 4\text{ days}

    Since EFY=ESY+dYEF_Y = ES_Y + d_Y, this constraint implies:

    EFY≥4+12=16 daysEF_Y \ge 4 + 12 = 16\text{ days}
  • From Constraint 2 (FF+2 daysFF + 2\text{ days}):

    EFY≥EFX+LagFF=10+2=12 daysEF_Y \ge EF_X + \text{Lag}_{FF} = 10 + 2 = 12\text{ days}

    Since ESY=EFY−dYES_Y = EF_Y - d_Y, this constraint implies:

    ESY≥12−12=0 daysES_Y \ge 12 - 12 = 0\text{ days}

Step 3: Determine Governing Values

To satisfy both physical conditions simultaneously, the early finish of YY must satisfy the maximum requirement:

EFY=max⁡(16 days,12 days)=16 daysEF_Y = \max(16\text{ days}, 12\text{ days}) = \mathbf{16\text{ days}} ESY=EFY−dY=16−12=4 daysES_Y = EF_Y - d_Y = 16 - 12 = \mathbf{4\text{ days}}

Step 4: Governance and Elapsed Duration

  • Governing Constraint: Constraint 1 (SS+4 daysSS + 4\text{ days}) strictly governs the start of Activity YY.
  • Constraint 2 (FF+2 daysFF + 2\text{ days}) is automatically satisfied with 4 days of positive buffer (EFY=16≥12EF_Y = 16 \ge 12).
  • Total Combined Elapsed Project Duration: 16 days\mathbf{16\text{ days}}.

12. Comprehensive Exam Question Bank

Section A: GATE CE Previous Years & Anticipated Styles

  1. [GATE CE] A dummy activity in a project network:

    • (A) Consumes time but no resources
    • (B) Consumes resources but no time
    • (C) Consumes neither time nor resources
    • (D) Consumes both time and resources
      Answer: (C). A dummy is a purely mathematical construct consuming zero duration and zero resources.
  2. [GATE CE] In an Activity-on-Arrow (AOA) network, Fulkerson's rule for numbering events ensures that:

    • (A) All activities have equal floats
    • (B) The initial event is numbered 0
    • (C) For every activity arrow (i−j)(i - j), the condition i<ji < j is satisfied
    • (D) Critical path events are numbered with even numbers
      Answer: (C).

Section B: UPSC ESE Conventional Practice

  1. [ESE Mains] State five major shortcomings of Henry Gantt's Bar Chart system for scheduling major civil infrastructure works. Explain how the milestone chart partially addresses these flaws and why the network method (CPM/PERT) is mathematically superior.

Section C: SSC JE & State AE/JE Quick Fire

  1. The rule of event numbering in network analysis is known as:
    • (A) Newton's rule
    • (B) Simpson's rule
    • (C) Fulkerson's rule
    • (D) Bowditch's rule
      Answer: (C) Fulkerson's rule.
  2. In a project cumulative cost S-curve, the steepest slope of the curve represents the period of:
    • (A) Project mobilization
    • (B) Peak expenditure and maximum construction activity
    • (C) Project commissioning and closeout
    • (D) Tendering and contract award
      Answer: (B).
  3. An intermediate event in a network that has incoming arrows but no outgoing arrows is termed:
    • (A) Looping error
    • (B) Dangling error
    • (C) Burst event
    • (D) Dummy event
      Answer: (B) Dangling error.

13. Common Conceptual Pitfalls & Field Traps

  1. Dummy Necessity Overuse Trap:
    Inserting dummy arrows between every pair of sequential tasks.
    Field Reality: Dummies must be held to the absolute mathematical minimum. Over-dummying clutters the network, increases matrix sizes in software solvers, and introduces false critical paths.
  2. Grammatical vs Logical Confusion:
    Assuming all dummies serve the same purpose. Grammatical dummies exist solely to ensure unique (i−j)(i - j) identity in AOA; logical dummies preserve independent task relationships.
  3. Bar Chart Progress Updating Fallacy:
    Believing a Gantt chart can dynamically adjust to site delays. When a non-critical activity with float is delayed, an engineer cannot tell from a bar chart whether the project completion date is threatened without conducting a full CPM network pass.
  4. Fulkerson Numbering Arbitrary Node Trap:
    Assigning event numbers randomly as nodes are sketched. Random numbering violates i<ji < j, creates negative coordinate indexing in software algorithms, and obscures cyclic loops.
  5. AON Lead/Lag Direction Trap:
    Subtracting lag instead of adding it. A positive lag in SS+lagSS + \text{lag} delays the start of the successor, moving its start time forward on the calendar (ESB=ESA+lagES_B = ES_A + \text{lag}).

14. Quick Reference Formulas & Multi-Code Summary Table

Category Parameter Exact Analytical Formulation / Rule
Gantt Schedules Activity Representation Horizontal bar of length tt against calendar time
Milestone Symbol Event diamond (⧫\blacklozenge) marking major completion milestone
Cash S-Curve Daily Cash Demand Cdaily(t)=∑k∈activeckC_{\text{daily}}(t) = \sum_{k \in \text{active}} c_k
Cumulative S-Curve Ccum(t)=∑τ=1tCdaily(τ)C_{\text{cum}}(t) = \sum_{\tau=1}^t C_{\text{daily}}(\tau)
Envelope Bounds Upper Bound = Early Start (ESES) S-curve; Lower Bound = Late Start (LSLS) S-curve
AOA Network Elements Activity (i−j)(i - j) Consumes time (tij>0t_{ij} > 0) and resources; arrow ⟶\longrightarrow
Event Node Instant of time; consumes t=0,cost=0t = 0, \text{cost} = 0; circle ◯\bigcirc
Dummy Activity Zero time (t=0t = 0), zero cost; dashed arrow ⇢\dashrightarrow
Network Integrity Fulkerson's Condition i<j\mathbf{i < j} for every directed arrow (i−j)(i - j)
Network Errors Looping (cycling 1→2→11 \to 2 \to 1); Dangling (unconnected dead-end)
AON / PDM Precedence Finish-to-Start (FSFS) ESB≥EFA+LagFSES_B \ge EF_A + \text{Lag}_{FS}
Start-to-Start (SSSS) ESB≥ESA+LagSSES_B \ge ES_A + \text{Lag}_{SS}
Finish-to-Finish (FFFF) EFB≥EFA+LagFFEF_B \ge EF_A + \text{Lag}_{FF}
Start-to-Finish (SFSF) EFB≥ESA+LagSFEF_B \ge ES_A + \text{Lag}_{SF}
WBS Standard 100% Rule Hierarchy must capture 100%100\% of scope; no omissions, no extras
About this page’s source
Topic ID
CPM-01 (from metadata/sync_topic.py MAPPINGS)
Source file
notes/construction_management/01_project_planning_and_network_logic/01_project_planning_and_network_logic.md
Presentation changes
  • Leading title heading and bold Key: value metadata lines shown in the page header instead of the body
  • Literal \$ and \text-nested $ signs protected during parsing (19); TeX passed to KaTeX unchanged
  • Display-math fences normalised at render time (16 block(s); TeX unchanged)