11.1.3 Critical Path Analysis

Critical Path Analysis (CPA) is a method for analysing an activity network to determine the minimum project duration, identify critical activities, and calculate key timings. It also helps determine the minimum number of workers required to complete the project efficiently.

Key Concepts

Critical Path

The critical path is the longest path through the network. It determines the minimum time required to complete the project. Activities on the critical path have zero float.

Timings

Earliest Event Time (EET): The earliest time an event can occur, considering all preceding activities.

Calculated through a forward pass from start to finish.

Latest Event Time (LET): The latest time an event can occur without delaying the project.

Calculated through a backward pass from finish to start.

Earliest Start Time (EST) and Earliest Finish Time (EFT):

EST: Earliest time an activity can start (equal to the EET of its preceding event).
EFT: Earliest time an activity can finish:

\text{EFT} = \text{EST} + \text{Duration}

Latest Start Time (LST) and Latest Finish Time (LFT):

LFT: Latest time an activity can finish without delaying the project (equal to the LET of its succeeding event).
LST: Latest time an activity can start:

\text{LST} = \text{LFT} - \text{Duration}

Float: The amount of time an activity can be delayed without affecting the project duration.

\text{Float} = \text{LFT} - \text{EFT}

Steps in Critical Path Analysis

Draw the Activity Network
Forward Pass
Backward Pass
Identify Critical Activities
Calculate Lower Bound for Workers

Draw the Activity Network:

Ensure all dependencies are included, and activities are labelled with their durations.

Forward Pass:

Start at the start node.
Calculate the EET for each event:

\text{EET of current event} = \max(\text{EFT of all preceding activities})

Backward Pass:

Start at the end node.
Calculate the LET for each event:

\text{LET of current event} = \min(\text{LST of all succeeding activities})

Identify Critical Activities:

Activities with zero float are critical.
The sequence of critical activities forms the critical path.

Calculate Lower Bound for Workers:

The lower bound for workers is given by:

\text{Lower Bound} = \lceil \frac{\text{Total Activity Time}}{\text{Project Duration}} \rceil

Worked Example

infoNote

Question Consider the precedence table below:

Activity	Duration	Immediate Predecessors
A	3	-
B	2	A
C	4	A
D	5	B, C
E	3	C
F	6	D, E

Step 1: Draw the Activity Network

Construct the network with a single start node, a single end node, and all dependencies shown.

Step 2: Forward Pass

Start at $A$ : $\text{EET}(A) = 0 + 3 = 3$
$B$ : $\text{EET}(B) = \text{EET}(A) + 2 = 5$
$C$ : $\text{EET}(C) = \text{EET}(A) + 4 = 7$
$D$ : $\text{EET}(D) = \max(\text{EET}(B), \text{EET}(C)) + 5 = 12$
$E$ : $\text{EET}(E) = \text{EET}(C) + 3 = 10$
$F$ : $\text{EET}(F) = \max(\text{EET}(D), \text{EET}(E)) + 6 = 18$

Step 3: Backward Pass

Start at $F$ : $\text{LET}(F) = \text{EET}(F) = 18$
$D$ : $\text{LET}(D) = \text{LET}(F) - 6 = 12$
$E$ : $\text{LET}(E) = \text{LET}(F) - 6 = 12$
$B$ : $\text{LET}(B) = \text{LET}(D) - 5 = 7$
$C$ : $\text{LET}(C) = \min(\text{LET}(D), \text{LET}(E)) - 4 = 8$
$A$ : $\text{LET}(A) = \min(\text{LET}(B), \text{LET}(C)) - 3 = 3$

Step 4: Identify Critical Activities

Activities with : $\text{EET} = \text{LET}$
$A, C, D, F$ Critical Path: A → C → D → F

Project Duration: 18 units.

Step 5: Calculate Lower Bound for Workers

Total Activity Time:

3 (A) + 2 (B) + 4 (C) + 5 (D) + 3 (E) + 6 (F) = 23

Lower Bound for Workers:

\text{Lower Bound} = \lceil \frac{23}{18} \rceil = 2

At least 2 workers are required to complete the project in the shortest possible time.

Note Summary

infoNote

Common Mistakes

Incorrect Timings in Forward/Backward Pass Forgetting to take the maximum for EET or minimum for LET leads to incorrect critical paths.
Confusion Between Float and Timings Misinterpreting float as the difference between EET and LET instead of LFT and EFT.
Missing Dependencies Failing to include all immediate predecessors or successors can cause errors in the network.
Incorrect Lower Bound Calculation Using project duration instead of total activity time or vice versa.
Overlooking Critical Activities Not correctly identifying zero float activities as critical.

infoNote

Key Formulas/Theorems

Earliest Finish Time (EFT):

\text{EFT} = \text{EST} + \text{Duration}

Latest Start Time (LST):

\text{LST} = \text{LFT} - \text{Duration}

Float:

\text{Float} = \text{LFT} - \text{EFT}

Lower Bound for Workers:

\text{Lower Bound} = \lceil \frac{\text{Total Activity Time}}{\text{Project Duration}} \rceil

Critical Path Analysis Simplified Revision Notes for A-Level Edexcel Further Maths Decision Maths 1

11.1.3 Critical Path Analysis

Key Concepts

Critical Path

Timings

Steps in Critical Path Analysis

Worked Example

Note Summary

Common Mistakes

Key Formulas/Theorems

500K+ Students Use These Powerful Tools to Master Critical Path Analysis For their A-Level Exams.

Other Revision Notes related to Critical Path Analysis you should explore