CPM-02 Chapter 02 · Critical Path Method (CPM): Forward & Backward Pass, Float Mathematics & Network Scheduling

Critical Path Method (CPM): Forward & Backward Pass, Float Mathematics & Network Scheduling

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. Critical Path Method (CPM) Philosophy & Deterministic Foundations
  6. 3.1 Distinctive Characteristics of CPM
  7. 3.2 Dual-Node Notation
  8. 4. Forward Pass Computations: Early Times (TE, ES, EF)
  9. 4.1 Earliest Event Time (TE, j)
  10. 4.2 Early Activity Times (ESij, EFij)
  11. 5. Backward Pass Computations: Late Times (TL, LF, LS)
  12. 5.1 Latest Event Time (TL, i)
  13. 5.2 Late Activity Times (LFij, LSij)
  14. 6. Event Slack Mechanics: Zero, Positive & Negative States
  15. 7. Rigorous Mathematical Formulations of the Four Floats
  16. 7.1 Total Float (TF)
  17. 7.2 Free Float (FF)
  18. 7.3 Independent Float (IF)
  19. 7.4 Interfering Float (IT)
  20. 8. The Universal Float Hierarchy Inequality (TF ≥ FF ≥ IF)
  21. 8.1 Mathematical Proof of Hierarchy
  22. 9. The Three Inviolable Conditions for Critical Activities
  23. 9.1 Three Simultaneous Conditions
  24. 9.2 The Classic Zero-Slack Trap (Vital GATE & ESE Trap)
  25. 10. Sub-Critical, Critical, and Super-Critical Network Paths
  26. 11. Step-by-Step Rigorous Worked Numerical Examples
  27. Problem 1: Complete CPM Network Forward & Backward Pass with Floats
  28. Problem 2: Demonstration of Non-Critical Activity Between Critical Events
  29. Problem 3: Contractual Target Constraint and Super-Critical Network Analysis
  30. 12. Comprehensive Exam Question Bank
  31. Section A: GATE CE Previous Years & Anticipated Styles
  32. Section B: UPSC ESE Conventional Practice
  33. Section C: SSC JE & State AE/JE Quick Fire
  34. 13. Common Conceptual Pitfalls & Field Traps
  35. 14. Quick Reference Formulas & Multi-Code Summary Table

1. Module Overview & Pedagogical Scope

The Critical Path Method (CPM) is the foundational mathematical technique of deterministic network analysis in civil engineering infrastructure management. Developed in 1957 through a collaborative endeavor between the DuPont chemical corporation and Remington Rand Univac, CPM was engineered specifically for large-scale industrial construction, maintenance, and plant turnaround projects where activity durations can be estimated with high historical confidence.

Unlike probabilistic research-and-development models (such as PERT), CPM operates within a deterministic framework:

  1. Every distinct work activity is characterized by a single known duration (tijt_{ij}).
  2. Direct relationships exist between activity durations and direct resource costs.
  3. Network scheduling reveals the longest sequence of dependent tasks—the Critical Path—which governs the minimum possible elapsed duration required to complete the entire project.

This comprehensive master module synthesizes:

  • Forward Pass Analysis: Computing Earliest Event Times (TET_E), Early Start (ESES), and Early Finish (EFEF) through recursive maximization at merge nodes.
  • Backward Pass Analysis: Computing Latest Event Times (TLT_L), Late Finish (LFLF), and Late Start (LSLS) through recursive minimization at burst nodes.
  • Float Mathematics: Complete mathematical formulations and geometric proofs for the Four Types of Floats: Total Float (TFTF), Free Float (FFFF), Independent Float (IFIF), and Interfering Float (ITIT), establishing the universal hierarchy TF≥FF≥IFTF \ge FF \ge IF.
  • Critical Path Axioms: Deriving the three simultaneous criteria for critical activities and resolving the classic engineering trap of non-critical tasks bridging zero-slack nodes.
  • Path Classification: Quantitative boundaries separating sub-critical (TF>0TF > 0), critical (TF=0TF = 0), and super-critical (TF<0TF < 0) paths under fixed contractual targets.
CPM Forward & Backward Pass Scheduling

2. Learning Objectives & Exam Weightage Analysis

Learning Objectives

  1. State the deterministic axioms of the Critical Path Method (CPM) and execute forward pass calculations to determine Earliest Event Times (TET_E).
  2. Execute backward pass calculations from target project completion dates to determine Latest Event Times (TLT_L).
  3. Formulate the four basic activity times: Early Start (ESES), Early Finish (EFEF), Late Start (LSLS), and Late Finish (LFLF).
  4. Define, derive, and calculate the four fundamental floats: Total Float (TFTF), Free Float (FFFF), Independent Float (IFIF), and Interfering Float (ITIT).
  5. Prove mathematically that TF≥FF≥IFTF \ge FF \ge IF for every activity in any network configuration.
  6. Verify whether an activity lies on the critical path using the three simultaneous criteria: Si=0S_i = 0, Sj=0S_j = 0, and TE,j−TE,i=tijT_{E, j} - T_{E, i} = t_{ij}.
  7. Analyze super-critical networks exhibiting negative float under accelerated contractual completion constraints.

Exam Weightage Analysis

Exam Stream Typical Question Type Average Weightage Recurring Focus Concepts
GATE CE Numerical Answer Type (NAT) & MCQ 2 – 4 Marks Calculation of Total Float, Free Float, and Independent Float; duration of critical path; zero-slack trap.
UPSC ESE (Prelims & Mains) Objective + Multi-step Conventional 12 – 24 Marks Full network table reduction (ES, EF, LS, LF, TF, FF, IF); derivation of float formulas; super-critical paths.
SSC JE / RRB JE Objective (Formulas & Definitions) 3 – 5 Questions Formula for Total Float (LS−ESLS - ES or LF−EFLF - EF), Free Float (TF−head slackTF - \text{head slack}), definition of critical path.
State PSC AE/JE Mixed Objective & Short Problem 4 – 8 Marks Total project duration, identifying critical path, condition for critical activity, interfering float (=head slack= \text{head slack}).

3. Critical Path Method (CPM) Philosophy & Deterministic Foundations

3.1 Distinctive Characteristics of CPM

The Critical Path Method is distinguished by three core operational axioms:

  1. Activity-Oriented Nature: The primary analytical focus is on the work activities (i−ji - j) that consume time, labor, equipment, and capital.
  2. Deterministic Time Estimation: A single, highly predictable time duration (tijt_{ij}) is assigned to each activity based on standard productivity norms, equipment capacities, and historical site data.
  3. Cost-Time Trade-Off Capability: Every activity has a defined normal cost and crash cost, enabling structured crashing algorithms to accelerate schedules at minimum economic cost.

3.2 Dual-Node Notation

In an Activity-on-Arrow network, every event node ii represents an instantaneous accomplishment and is partitioned into geometric sectors to store temporal progress:

  • Upper Sector: Event Number / Identifier (ii).
  • Lower-Left Sector: Earliest Event Time (TE,iT_{E, i}).
  • Lower-Right Sector: Latest Event Time (TL,iT_{L, i}).

4. Forward Pass Computations: Early Times (TE,ES,EFT_E, ES, EF)

The forward pass moves systematically forward through the network from the initial project start event to the final project terminal event, calculating the earliest possible times at which events and activities can occur.

4.1 Earliest Event Time (TE,jT_{E, j})

  • Boundary Condition: The initial start event (Event 11) is assigned a time datum of zero: TE,1=0\mathbf{T_{E, 1} = 0}
  • Recursive Forward Propagation: For any subsequent event jj, its earliest occurrence time is governed by the completion of all preceding activities entering event jj: TE,j=max⁡i[TE,i+tij]\mathbf{T_{E, j} = \max_{i} \left[ T_{E, i} + t_{ij} \right]} (where the maximization is conducted across all incoming arrows (i−j)(i - j) converging into merge event jj).

4.2 Early Activity Times (ESij,EFijES_{ij}, EF_{ij})

For any activity (i−j)(i - j) having duration tijt_{ij}:

  1. Early Start Time (ESijES_{ij}): The earliest possible instant the activity can begin. An activity cannot start until its tail event ii has occurred: ESij=TE,i\mathbf{ES_{ij} = T_{E, i}}
  2. Early Finish Time (EFijEF_{ij}): The earliest possible instant the activity can be completed: EFij=ESij+tij=TE,i+tij\mathbf{EF_{ij} = ES_{ij} + t_{ij} = T_{E, i} + t_{ij}}

5. Backward Pass Computations: Late Times (TL,LF,LST_L, LF, LS)

The backward pass moves systematically backward from the final project terminal event to the initial start event, calculating the latest allowable times at which events and activities can occur without postponing the scheduled project completion date.

5.1 Latest Event Time (TL,iT_{L, i})

  • Boundary Condition: For the final terminal event NN, unless an external contractual completion date TsT_s is imposed, the latest allowable time is set equal to its earliest event time: TL,N=TE,N(or TL,N=Ts)\mathbf{T_{L, N} = T_{E, N} \quad (\text{or } T_{L, N} = T_s)}
  • Recursive Backward Propagation: For any preceding event ii, its latest allowable occurrence time is governed by the latest start times of all succeeding activities emerging from event ii: TL,i=min⁡j[TL,j−tij]\mathbf{T_{L, i} = \min_{j} \left[ T_{L, j} - t_{ij} \right]} (where the minimization is conducted across all outgoing arrows (i−j)(i - j) diverging from burst event ii).

5.2 Late Activity Times (LFij,LSijLF_{ij}, LS_{ij})

For any activity (i−j)(i - j) having duration tijt_{ij}:

  1. Late Finish Time (LFijLF_{ij}): The latest possible instant the activity can finish without delaying the overall project completion: LFij=TL,j\mathbf{LF_{ij} = T_{L, j}}
  2. Late Start Time (LSijLS_{ij}): The latest possible instant the activity can begin without delaying project completion: LSij=LFij−tij=TL,j−tij\mathbf{LS_{ij} = LF_{ij} - t_{ij} = T_{L, j} - t_{ij}}

6. Event Slack Mechanics: Zero, Positive & Negative States

Event Slack (SiS_i) is a property of an event node that quantifies the buffer time available:

Si=TL,i−TE,i\mathbf{S_i = T_{L, i} - T_{E, i}}
+---------------------------------------------------------------------------------------------------+
| EVENT SLACK STATE   | MATHEMATICAL CONDITION | OPERATIONAL INTERPRETATION                         |
+---------------------+------------------------+----------------------------------------------------+
| Zero Slack          | S_i = T_L,i - T_E,i = 0 | Critical Event: Zero buffer; strictly on schedule. |
+---------------------+------------------------+----------------------------------------------------+
| Positive Slack      | S_i = T_L,i - T_E,i > 0 | Sub-Critical Event: Surplus time; ahead of schedule.|
+---------------------+------------------------+----------------------------------------------------+
| Negative Slack      | S_i = T_L,i - T_E,i < 0 | Super-Critical Event: Deficit time; behind target. |
+---------------------+------------------------+----------------------------------------------------+

7. Rigorous Mathematical Formulations of the Four Floats

Mathematics of the Four Floats & Critical Path Criteria

While Slack is strictly a property of an Event (Node), Float is strictly a property of an Activity. Float represents the temporal flexibility or scheduling buffer associated with a task.

7.1 Total Float (TFTF)

Definition: The maximum duration of time by which an activity can be delayed beyond its early start without delaying the overall project completion date.

TFij=LFij−EFij=LSij−ESij\mathbf{TF_{ij} = LF_{ij} - EF_{ij} = LS_{ij} - ES_{ij}}

Substituting event times (LF=TL,jLF = T_{L, j} and EF=TE,i+tijEF = T_{E, i} + t_{ij}):

TFij=TL,j−TE,i−tij\mathbf{TF_{ij} = T_{L, j} - T_{E, i} - t_{ij}}
  • Total float is a shared property of an entire path sequence. Consuming total float on an upstream task reduces the total float available to downstream tasks on that path.

7.2 Free Float (FFFF)

Definition: The duration of time by which an activity can be delayed without delaying the early start time of any immediately succeeding activity.

FFij=TE,j−EFij=TE,j−(TE,i+tij)\mathbf{FF_{ij} = T_{E, j} - EF_{ij} = T_{E, j} - (T_{E, i} + t_{ij})} FFij=TE,j−TE,i−tij\mathbf{FF_{ij} = T_{E, j} - T_{E, i} - t_{ij}}

Relationship between Total Float and Free Float:

Recall that head event slack is Sj=TL,j−TE,j  ⟹  TE,j=TL,j−SjS_j = T_{L, j} - T_{E, j} \implies T_{E, j} = T_{L, j} - S_j. Substituting into the Free Float equation:

FFij=(TL,j−Sj)−TE,i−tij=(TL,j−TE,i−tij)−SjFF_{ij} = (T_{L, j} - S_j) - T_{E, i} - t_{ij} = (T_{L, j} - T_{E, i} - t_{ij}) - S_j FFij=TFij−Sj\mathbf{FF_{ij} = TF_{ij} - S_j}

(Free Float equals Total Float minus Head Event Slack).


7.3 Independent Float (IFIF)

Definition: The duration of time by which an activity can be delayed when its preceding activities finish as late as possible (TL,iT_{L, i}) and all succeeding activities are scheduled to start as early as possible (TE,jT_{E, j}):

IFij=TE,j−TL,i−tij\mathbf{IF_{ij} = T_{E, j} - T_{L, i} - t_{ij}}

Relationship between Free Float and Independent Float:

Recall that tail event slack is Si=TL,i−TE,i  ⟹  TL,i=TE,i+SiS_i = T_{L, i} - T_{E, i} \implies T_{L, i} = T_{E, i} + S_i. Substituting into the Independent Float equation:

IFij=TE,j−(TE,i+Si)−tij=(TE,j−TE,i−tij)−SiIF_{ij} = T_{E, j} - (T_{E, i} + S_i) - t_{ij} = (T_{E, j} - T_{E, i} - t_{ij}) - S_i IFij=FFij−Si=TFij−Sj−Si\mathbf{IF_{ij} = FF_{ij} - S_i = TF_{ij} - S_j - S_i}

(Independent Float equals Free Float minus Tail Event Slack).

[!NOTE] Independent Float is an autonomous buffer owned solely by that specific activity; consuming it has zero impact on either predecessor or successor tasks. If mathematical calculation yields IF<0IF < 0, it is reported as 00 in construction practice.


7.4 Interfering Float (ITIT)

Definition: That portion of the Total Float which, if utilized, delays the early start of subsequent activities without delaying project completion:

ITij=TFij−FFij\mathbf{IT_{ij} = TF_{ij} - FF_{ij}}

From FFij=TFij−SjFF_{ij} = TF_{ij} - S_j:

ITij=Sj=TL,j−TE,j\mathbf{IT_{ij} = S_j = T_{L, j} - T_{E, j}}

(Interfering Float is identically equal to the Slack of the Head Event).


8. The Universal Float Hierarchy Inequality (TF≥FF≥IFTF \ge FF \ge IF)

8.1 Mathematical Proof of Hierarchy

For any real activity in a feasible network, event slacks are non-negative (Si≥0S_i \ge 0 and Sj≥0S_j \ge 0):

  1. Comparing Total Float and Free Float: FFij=TFij−SjFF_{ij} = TF_{ij} - S_j Since Sj≥0S_j \ge 0: TFij−FFij=Sj≥0  ⟹  TFij≥FFijTF_{ij} - FF_{ij} = S_j \ge 0 \implies \mathbf{TF_{ij} \ge FF_{ij}}
  2. Comparing Free Float and Independent Float: IFij=FFij−SiIF_{ij} = FF_{ij} - S_i Since Si≥0S_i \ge 0: FFij−IFij=Si≥0  ⟹  FFij≥IFijFF_{ij} - IF_{ij} = S_i \ge 0 \implies \mathbf{FF_{ij} \ge IF_{ij}}

Combining both expressions yields the Universal Float Hierarchy Inequality:

TF≥FF≥IF\mathbf{TF \ge FF \ge IF}
+---------------------------------------------------------------------------------------------------+
| FLOAT HIERARCHY SUMMARY:                                                                          |
|   1. Total Float (TF)       : Broadest buffer, shared along entire path.                          |
|   2. Free Float (FF)        : Buffer localized to head event; protects succeeding tasks.          |
|   3. Independent Float (IF) : Most restrictive buffer; completely autonomous (never < 0).         |
|   4. Interfering Float (IT) : Equal to Head Event Slack (S_j = TF - FF).                          |
+---------------------------------------------------------------------------------------------------+

9. The Three Inviolable Conditions for Critical Activities

The Critical Path is the longest path from the initial event to the terminal event in terms of total duration. Every activity lying along the critical path is a Critical Activity.

9.1 Three Simultaneous Conditions

For an activity (i−j)(i - j) with duration tijt_{ij} to lie on the critical path, all three of the following mathematical conditions must be satisfied simultaneously:

  1. Condition 1 (Tail Event Zero Slack): TE,i=TL,i  ⟺  Si=0T_{E, i} = T_{L, i} \iff S_i = 0
  2. Condition 2 (Head Event Zero Slack): TE,j=TL,j  ⟺  Sj=0T_{E, j} = T_{L, j} \iff S_j = 0
  3. Condition 3 (Zero Activity Floats): TE,j−TE,i=TL,j−TL,i=tij  ⟺  TFij=FFij=IFij=0T_{E, j} - T_{E, i} = T_{L, j} - T_{L, i} = t_{ij} \iff \mathbf{TF_{ij} = FF_{ij} = IF_{ij} = 0}

9.2 The Classic Zero-Slack Trap (Vital GATE & ESE Trap)

[!CAUTION] It is a common misconception that any activity connecting two zero-slack events is automatically critical. This is completely false!

Conditions 1 and 2 are necessary, but NOT sufficient. If Condition 3 is violated, an activity bridging two zero-slack nodes will have positive float and is strictly non-critical.

Mathematical Proof:

Let activity (i−j)(i - j) connect event ii (TE,i=TL,i=10 daysT_{E, i} = T_{L, i} = 10\text{ days}, Si=0S_i = 0) and event jj (TE,j=TL,j=22 daysT_{E, j} = T_{L, j} = 22\text{ days}, Sj=0S_j = 0).
Let the duration of activity (i−j)(i - j) be tij=8 dayst_{ij} = 8\text{ days}.

  • Total Float: TF=TL,j−TE,i−tij=22−10−8=4 days>0TF = T_{L, j} - T_{E, i} - t_{ij} = 22 - 10 - 8 = \mathbf{4\text{ days} > 0}
  • Free Float: FF=TE,j−TE,i−tij=22−10−8=4 days>0FF = T_{E, j} - T_{E, i} - t_{ij} = 22 - 10 - 8 = \mathbf{4\text{ days} > 0}
  • Independent Float: IF=TE,j−TL,i−tij=22−10−8=4 days>0IF = T_{E, j} - T_{L, i} - t_{ij} = 22 - 10 - 8 = \mathbf{4\text{ days} > 0}

Because TF=4 days>0TF = 4\text{ days} > 0, this activity has 4 days of buffer and does not lie on the critical path, even though both of its boundary events are critical nodes!


10. Sub-Critical, Critical, and Super-Critical Network Paths

When a project is constrained by an external contractual completion deadline TsT_s:

  • Backward pass sets: TL,N=TsT_{L, N} = T_s.
  • If Ts>TE,NT_s > T_{E, N}: The project has positive buffer across all paths. The path with minimum float is the critical path, but its float is positive (TFcrit>0TF_{\text{crit}} > 0).
  • If Ts=TE,NT_s = T_{E, N}: Standard CPM baseline (TFcrit=0TF_{\text{crit}} = 0).
  • If Ts<TE,NT_s < T_{E, N}: The contractual target is shorter than the minimum physical network duration.
    • The critical path exhibits Negative Float (TFcrit<0TF_{\text{crit}} < 0).
    • A path with negative float is termed a Super-Critical Path.
    • Management must immediately crash or fast-track activities along the super-critical path to eliminate negative float and avoid contractual liquidated damages.

11. Step-by-Step Rigorous Worked Numerical Examples

Problem 1: Complete CPM Network Forward & Backward Pass with Floats

Problem Statement:
A project network consists of 6 events and 8 activities (including 1 dummy). The activities and their estimated durations are:

  • Activity (1−2)(1 - 2): t=4 dayst = 4\text{ days}
  • Activity (1−3)(1 - 3): t=6 dayst = 6\text{ days}
  • Activity (2−4)(2 - 4): t=5 dayst = 5\text{ days}
  • Activity (3−4)(3 - 4): t=7 dayst = 7\text{ days}
  • Activity (2−5)(2 - 5): t=8 dayst = 8\text{ days}
  • Activity (3−5)(3 - 5): Dummy activity (3⇢5)(3 \dashrightarrow 5), t=0 dayst = 0\text{ days}
  • Activity (4−6)(4 - 6): t=4 dayst = 4\text{ days}
  • Activity (5−6)(5 - 6): t=6 dayst = 6\text{ days}

Calculate:

  1. Earliest Event Times (TET_E) and Latest Event Times (TLT_L) for all events 11 to 66.
  2. The Critical Path and total project completion time.
  3. Construct a complete scheduling table tabulating ES,EF,LS,LF,TF,FF,IFES, EF, LS, LF, TF, FF, IF, and ITIT for every activity.

Step 1: Forward Pass Computations (TET_E)

  • Event 11: Initial start node: TE,1=0T_{E, 1} = 0
  • Event 22: Single incoming activity (1−2)(1 - 2): TE,2=TE,1+t1−2=0+4=4 daysT_{E, 2} = T_{E, 1} + t_{1-2} = 0 + 4 = 4\text{ days}
  • Event 33: Single incoming activity (1−3)(1 - 3): TE,3=TE,1+t1−3=0+6=6 daysT_{E, 3} = T_{E, 1} + t_{1-3} = 0 + 6 = 6\text{ days}
  • Event 44: Merge event with incoming activities (2−4)(2 - 4) and (3−4)(3 - 4): TE,4=max⁡[TE,2+t2−4,  TE,3+t3−4]=max⁡[4+5,  6+7]=max⁡[9,13]=13 daysT_{E, 4} = \max\left[ T_{E, 2} + t_{2-4}, \; T_{E, 3} + t_{3-4} \right] = \max\left[ 4 + 5, \; 6 + 7 \right] = \max[9, 13] = \mathbf{13\text{ days}}
  • Event 55: Merge event with incoming activities (2−5)(2 - 5) and dummy (3−5)(3 - 5): TE,5=max⁡[TE,2+t2−5,  TE,3+t3−5]=max⁡[4+8,  6+0]=max⁡[12,6]=12 daysT_{E, 5} = \max\left[ T_{E, 2} + t_{2-5}, \; T_{E, 3} + t_{3-5} \right] = \max\left[ 4 + 8, \; 6 + 0 \right] = \max[12, 6] = \mathbf{12\text{ days}}
  • Event 66: Terminal merge event with incoming activities (4−6)(4 - 6) and (5−6)(5 - 6): TE,6=max⁡[TE,4+t4−6,  TE,5+t5−6]=max⁡[13+4,  12+6]=max⁡[17,18]=18 daysT_{E, 6} = \max\left[ T_{E, 4} + t_{4-6}, \; T_{E, 5} + t_{5-6} \right] = \max\left[ 13 + 4, \; 12 + 6 \right] = \max[17, 18] = \mathbf{18\text{ days}}
Total Project Duration=18 Days\mathbf{\text{Total Project Duration} = 18\text{ Days}}

Step 2: Backward Pass Computations (TLT_L)

  • Event 66: Terminal boundary condition: TL,6=TE,6=18 daysT_{L, 6} = T_{E, 6} = 18\text{ days}
  • Event 55: Outgoing activity (5−6)(5 - 6): TL,5=TL,6−t5−6=18−6=12 daysT_{L, 5} = T_{L, 6} - t_{5-6} = 18 - 6 = \mathbf{12\text{ days}}
  • Event 44: Outgoing activity (4−6)(4 - 6): TL,4=TL,6−t4−6=18−4=14 daysT_{L, 4} = T_{L, 6} - t_{4-6} = 18 - 4 = \mathbf{14\text{ days}}
  • Event 33: Burst event with outgoing activity (3−4)(3 - 4) and dummy (3−5)(3 - 5): TL,3=min⁡[TL,4−t3−4,  TL,5−t3−5]=min⁡[14−7,  12−0]=min⁡[7,12]=7 daysT_{L, 3} = \min\left[ T_{L, 4} - t_{3-4}, \; T_{L, 5} - t_{3-5} \right] = \min\left[ 14 - 7, \; 12 - 0 \right] = \min[7, 12] = \mathbf{7\text{ days}}
  • Event 22: Burst event with outgoing activities (2−4)(2 - 4) and (2−5)(2 - 5): TL,2=min⁡[TL,4−t2−4,  TL,5−t2−5]=min⁡[14−5,  12−8]=min⁡[9,4]=4 daysT_{L, 2} = \min\left[ T_{L, 4} - t_{2-4}, \; T_{L, 5} - t_{2-5} \right] = \min\left[ 14 - 5, \; 12 - 8 \right] = \min[9, 4] = \mathbf{4\text{ days}}
  • Event 11: Burst event with outgoing activities (1−2)(1 - 2) and (1−3)(1 - 3): TL,1=min⁡[TL,2−t1−2,  TL,3−t1−3]=min⁡[4−4,  7−6]=min⁡[0,1]=0 daysT_{L, 1} = \min\left[ T_{L, 2} - t_{1-2}, \; T_{L, 3} - t_{1-3} \right] = \min\left[ 4 - 4, \; 7 - 6 \right] = \min[0, 1] = \mathbf{0\text{ days}}

Step 3: Event Slack Analysis

  • Event 11: S1=TL,1−TE,1=0−0=0S_1 = T_{L, 1} - T_{E, 1} = 0 - 0 = 0 [Critical]
  • Event 22: S2=TL,2−TE,2=4−4=0S_2 = T_{L, 2} - T_{E, 2} = 4 - 4 = 0 [Critical]
  • Event 33: S3=TL,3−TE,3=7−6=1 dayS_3 = T_{L, 3} - T_{E, 3} = 7 - 6 = 1\text{ day} [Slack = 1]
  • Event 44: S4=TL,4−TE,4=14−13=1 dayS_4 = T_{L, 4} - T_{E, 4} = 14 - 13 = 1\text{ day} [Slack = 1]
  • Event 55: S5=TL,5−TE,5=12−12=0S_5 = T_{L, 5} - T_{E, 5} = 12 - 12 = 0 [Critical]
  • Event 66: S6=TL,6−TE,6=18−18=0S_6 = T_{L, 6} - T_{E, 6} = 18 - 18 = 0 [Critical]

Step 4: Complete Activity Scheduling & Float Table

Activity Duration tt ES=TE,iES = T_{E, i} EF=ES+tEF = ES + t LF=TL,jLF = T_{L, j} LS=LF−tLS = LF - t TF=LF−EFTF = LF - EF FF=TF−SjFF = TF - S_j IF=max⁡(0,FF−Si)IF = \max(0, FF - S_i) IT=SjIT = S_j Critical?
(1−2)(1 - 2) 44 00 44 44 00 00 00 00 00 CRITICAL
(1−3)(1 - 3) 66 00 66 77 11 11 00 00 11 No
(2−4)(2 - 4) 55 44 99 1414 99 55 44 44 11 No
(3−4)(3 - 4) 77 66 1313 1414 77 11 00 00 11 No
(2−5)(2 - 5) 88 44 1212 1212 44 00 00 00 00 CRITICAL
(3−5)(3 - 5) 00 66 66 1212 1212 66 66 55 00 No
(4−6)(4 - 6) 44 1313 1717 1818 1414 11 11 00 00 No
(5−6)(5 - 6) 66 1212 1818 1818 1212 00 00 00 00 CRITICAL
CRITICAL PATH: 1⟶2⟶5⟶6(Duration =4+8+6=18 Days)\mathbf{\text{CRITICAL PATH: } 1 \longrightarrow 2 \longrightarrow 5 \longrightarrow 6 \quad (\text{Duration } = 4 + 8 + 6 = 18\text{ Days})}

Problem 2: Demonstration of Non-Critical Activity Between Critical Events

Problem Statement:
In a refinery maintenance project, an engineering pipeline inspection activity (8−14)(8 - 14) has an estimated duration of t=8 dayst = 8\text{ days}.
Network analysis yields the following event times:

  • Event 88: TE,8=10 days,TL,8=10 daysT_{E, 8} = 10\text{ days}, \quad T_{L, 8} = 10\text{ days}
  • Event 1414: TE,14=22 days,TL,14=22 daysT_{E, 14} = 22\text{ days}, \quad T_{L, 14} = 22\text{ days}
  1. Compute the slack of events 88 and 1414.
  2. Compute Total Float, Free Float, and Independent Float of activity (8−14)(8 - 14).
  3. Determine whether activity (8−14)(8 - 14) is critical, and justify why it does or does not lie on the critical path.

Step 1: Event Slacks

S8=TL,8−TE,8=10−10=0 days(Tail Event Zero Slack)S_8 = T_{L, 8} - T_{E, 8} = 10 - 10 = \mathbf{0\text{ days}} \quad (\text{Tail Event Zero Slack}) S14=TL,14−TE,14=22−22=0 days(Head Event Zero Slack)S_{14} = T_{L, 14} - T_{E, 14} = 22 - 22 = \mathbf{0\text{ days}} \quad (\text{Head Event Zero Slack})

Both boundary events satisfy Critical Conditions 1 and 2!

Step 2: Compute Activity Floats

  • Total Float (TFTF): TF=TL,14−TE,8−t=22−10−8=4 daysTF = T_{L, 14} - T_{E, 8} - t = 22 - 10 - 8 = \mathbf{4\text{ days}}
  • Free Float (FFFF): FF=TF−S14=4−0=4 daysFF = TF - S_{14} = 4 - 0 = \mathbf{4\text{ days}}
  • Independent Float (IFIF): IF=FF−S8=4−0=4 daysIF = FF - S_8 = 4 - 0 = \mathbf{4\text{ days}}
  • Interfering Float (ITIT): IT=S14=0 daysIT = S_{14} = \mathbf{0\text{ days}}

Step 3: Criticality Determination

Even though both tail event 88 and head event 1414 have Zero Slack, activity (8−14)(8 - 14) has:

TF=4 days>0TF = 4\text{ days} > 0 Activity (8−14) is STRICTLY NON-CRITICAL!\mathbf{\text{Activity } (8 - 14) \text{ is STRICTLY NON-CRITICAL!}}

Engineering Rationale: The time window between event 8 and event 14 is 22−10=12 days22 - 10 = 12\text{ days}. Because the activity requires only 8 days8\text{ days}, it has 12−8=4 days12 - 8 = 4\text{ days} of float. Condition 3 (TE,j−TE,i=tT_{E, j} - T_{E, i} = t) is violated (12≠812 \ne 8). It does not lie on the critical path.


Problem 3: Contractual Target Constraint and Super-Critical Network Analysis

Problem Statement:
A bridge reconstruction project has a critical path duration computed from forward pass as TE=28 weeksT_E = 28\text{ weeks}.
The client imposes a strict contractual completion deadline with liquidated damages after Ts=25 weeksT_s = 25\text{ weeks}.

  1. Perform the backward pass termination and compute the project terminal slack.
  2. Determine the Total Float of activities along the critical path.
  3. Classify the resulting network and explain the engineering interventions required to return to feasibility.

Step 1: Backward Pass Boundary Condition & Slack

Because target date Ts=25 weeksT_s = 25\text{ weeks} is mandatory:

TL,final=Ts=25 weeksT_{L, \text{final}} = T_s = 25\text{ weeks}

The terminal event slack is:

Sfinal=TL,final−TE,final=25−28=−3 weeksS_{\text{final}} = T_{L, \text{final}} - T_{E, \text{final}} = 25 - 28 = \mathbf{-3\text{ weeks}}

Step 2: Total Float Along Critical Path

For any activity (i−j)(i - j) on the primary path:

TF=TL,j−TE,i−tij=−3 weeksTF = T_{L, j} - T_{E, i} - t_{ij} = \mathbf{-3\text{ weeks}}

The total float is negative!

Step 3: Path Classification & Interventions

  • Classification: The path is a Super-Critical Path (TF=−3 weeks<0TF = -3\text{ weeks} < 0).
  • Implication: The project is already projected to breach the contract by 21 days before physical ground is broken!
  • Engineering Remedial Interventions:
    1. Activity Crashing: Identify critical activities with the lowest cost slope (ΔC/Δt\Delta C / \Delta t) and compress their durations by 3 weeks through overtime, additional crews, or high-capacity equipment.
    2. Fast-Tracking (Pipelining): Convert rigid Finish-to-Start (FSFS) dependencies into overlapping Start-to-Start (SSSS) relationships with leads and lags.
    3. Scope De-scoping: Re-negotiate non-essential deliverables or seek an authorized extension of time (EOT).

12. Comprehensive Exam Question Bank

Section A: GATE CE Previous Years & Anticipated Styles

  1. [GATE CE] For an activity in a network, the earliest start time is Day 5, latest start time is Day 12, earliest finish time is Day 15, and latest finish time is Day 22. If the head event slack is 3 days, the free float of the activity is:

    • (A) 0 days
    • (B) 3 days
    • (C) 4 days
    • (D) 7 days
      Answer: (C). Total Float TF=LS−ES=12−5=7 daysTF = LS - ES = 12 - 5 = 7\text{ days} (or LF−EF=22−15=7 daysLF - EF = 22 - 15 = 7\text{ days}). Free Float FF=TF−Sj=7−3=4 daysFF = TF - S_j = 7 - 3 = 4\text{ days}.
  2. [GATE CE] Consider the following statements regarding the Critical Path Method:

    • I. The critical path is the shortest path in terms of time through the network.
    • II. An activity connecting two critical events is always a critical activity.
    • III. Free float can never exceed Total float.
    • IV. Independent float can be negative in mathematical calculations.
      Which of the above statements are CORRECT?
    • (A) I and II
    • (B) III and IV
    • (C) II and III
    • (D) I, III and IV
      Answer: (B). Statement I is false (longest path); Statement II is false (zero-slack trap); Statement III is true (TF≥FFTF \ge FF); Statement IV is true (IF=FF−SiIF = FF - S_i can be negative algebraically).

Section B: UPSC ESE Conventional Practice

  1. [ESE Mains] Define Total Float, Free Float, and Independent Float. Prove mathematically that Total Float ≥\ge Free Float ≥\ge Independent Float. In a network, can Free Float be zero while Total Float is non-zero? Explain with a neat sketch.

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

  1. The difference between the latest start time and the earliest start time of an activity is known as:
    • (A) Free float
    • (B) Independent float
    • (C) Total float
    • (D) Interfering float
      Answer: (C) Total float (TF=LS−ESTF = LS - ES).
  2. Interfering float is mathematically equal to:
    • (A) Tail event slack
    • (B) Head event slack
    • (C) Total float plus Free float
    • (D) Zero
      Answer: (B) Head event slack (IT=SjIT = S_j).
  3. If the earliest finish time of a project is 30 days and the contractual completion time is 26 days, the critical path float is:
    • (A) +4 days+4\text{ days}
    • (B) −4 days-4\text{ days}
    • (C) 0 days0\text{ days}
    • (D) +56 days+56\text{ days}
      Answer: (B) −4 days-4\text{ days} (Super-critical path).

13. Common Conceptual Pitfalls & Field Traps

  1. The Zero-Slack Activity Fallacy:
    Assuming an activity is critical solely because its start node has Si=0S_i = 0 and its end node has Sj=0S_j = 0. Always verify Condition 3: TE,j−TE,i=tijT_{E, j} - T_{E, i} = t_{ij}.
  2. Negative Independent Float Reporting Trap:
    Reporting negative independent float in engineering schedules. While algebraically IF=FF−SiIF = FF - S_i can be negative when Si>FFS_i > FF, by definition an activity cannot have "negative flexibility"; it is officially recorded as IF=0IF = 0.
  3. Float Ownership Misunderstanding:
    Assuming Total Float belongs exclusively to one activity. Total float is shared along the entire path. If upstream activity AA consumes 4 days of total float, downstream activities on that chain lose those 4 days of buffer!
  4. Backward Pass Subtraction Order Trap:
    Computing Late Finish as TL,i+tijT_{L, i} + t_{ij}. Late Finish is strictly the head event time LF=TL,jLF = T_{L, j}, and Late Start is LS=TL,j−tijLS = T_{L, j} - t_{ij}.
  5. Merge Event Forward Pass Trap:
    Taking the minimum time at a merge node during the forward pass. Early event time must await the slowest converging activity; hence TE=max⁡(TE+t)T_E = \mathbf{\max}(T_E + t).

14. Quick Reference Formulas & Multi-Code Summary Table

Category Parameter Exact Analytical Formulation
Event Times Earliest Event Time (TE,jT_{E, j}) TE,1=0,TE,j=max⁡i[TE,i+tij]T_{E, 1} = 0, \quad T_{E, j} = \max_i [T_{E, i} + t_{ij}]
Latest Event Time (TL,iT_{L, i}) TL,N=TE,N,TL,i=min⁡j[TL,j−tij]T_{L, N} = T_{E, N}, \quad T_{L, i} = \min_j [T_{L, j} - t_{ij}]
Event Slack (SiS_i) Si=TL,i−TE,iS_i = T_{L, i} - T_{E, i}
Activity Times Early Start (ESES) ESij=TE,iES_{ij} = T_{E, i}
Early Finish (EFEF) EFij=ESij+tij=TE,i+tijEF_{ij} = ES_{ij} + t_{ij} = T_{E, i} + t_{ij}
Late Finish (LFLF) LFij=TL,jLF_{ij} = T_{L, j}
Late Start (LSLS) LSij=LFij−tij=TL,j−tijLS_{ij} = LF_{ij} - t_{ij} = T_{L, j} - t_{ij}
Four Floats Total Float (TFTF) TF=LF−EF=LS−ES=TL,j−TE,i−tijTF = LF - EF = LS - ES = T_{L, j} - T_{E, i} - t_{ij}
Free Float (FFFF) FF=TE,j−TE,i−tij=TF−SjFF = T_{E, j} - T_{E, i} - t_{ij} = TF - S_j
Independent Float (IFIF) IF=TE,j−TL,i−tij=FF−SiIF = T_{E, j} - T_{L, i} - t_{ij} = FF - S_i
Interfering Float (ITIT) IT=TF−FF=Sj=TL,j−TE,jIT = TF - FF = S_j = T_{L, j} - T_{E, j}
Float Hierarchy Universal Inequality TF≥FF≥IF\mathbf{TF \ge FF \ge IF}
Critical Conditions Three Simultaneous Rules Si=0,Sj=0,TE,j−TE,i=tijS_i = 0, \quad S_j = 0, \quad T_{E, j} - T_{E, i} = t_{ij}
Path Types Sub-Critical TF>0TF > 0 (Possesses positive buffer)
Critical TF=0TF = 0 (Zero buffer; governs duration)
Super-Critical TF<0TF < 0 (Project behind contractual deadline)