Critical Path Analysis Definition

Critical path analysis is the process of identifying the longest path in a schedule network diagram. The analysis not only indicates completeness of project schedule but also ascertains degree of scheduling flexibility. Moreover, critical path analysis also reveals the minimum duration required to complete a project.

Critical path analysis also specifies link between project activities. Not all activities can start and finish on time. Hence critical path analysis specifies permissible delays to activities that are not on critical path. Thus schedule flexibility is the permissible delay that does not affect project completion date.

Critical Path Method Example With Solution

Step – 1 : Calculate the total number of paths and their duration.

The first and the most crucial critical path analysis step is to identify the critical path. To achieve this first identify all the paths in the network. The schedule network diagram shown above has four paths. The path with longest duration is the critical path. Description of all the paths in mentioned below.

First path is Start (S) – A – D – E – End (E’) the duration of this path is 16 weeks

The second path is S – A – E – G – E’ the duration of which is also equal to 16 weeks

The longest path in the network above is S-B-C-E-G-E’ with a duration of 22 weeks. Hence, path S-B-C-E-G-E’ is the critical path of the above schedule network diagram.

Step – 2 : Indicate the Critical Path

Indicate the critical path on the network diagram with a bold line. The network diagram with critical path will look as follows

Project Schedule Network Diagram With Critical Path

Step – 3 : Perform Forward Pass on Critical Path

The next step is to calculate early start and early finish of each activity. We need to start with activities on critical path.

Step – 3.1 : Calculate Early Start and Early Finish of activities on Critical Path.

First Node

There are two conventions for critical path analysis. The convention used for solving cpm example problem is that the project starts on day one. Another convention for cpm analysis states that the project starts on day zero. We will stick to the convention indicated in PMBOK, which states that, the project starts on day 1. Hence ES of first activity B on critical path is 1.

EF = ES + Activity Duration – 1

EF of Activity B = 1 + 6 – 1 = 6

Node B

ES = EF of first node + 1 = 6 + 1 = 7

EF = ES + Activity Duration -1 = 7 + 4 – 1 = 10

Repeat the above step till you reach the last node

Once the forward pass is complete the network diagram will look as follows. The following diagram looks different because of spreadsheet calculations. However, the schedule network logic has not changed.

Calculate Early Start & Early Finish of Activities on Critical Path

Step – 4 : Perform Backward Pass on Critical Path

Perform backward pass to calculate Late Start and Late Finish.

Step – 4.1 : Calculate Late Start and Late Finish of activities on critical path

The total float of activities on critical path is zero. Hence on critical path LS = ES and LF = EF. Therefore, no backward pass calculation for activities on critical path. On completing the backward pass network diagram will look like this.

Calculate Late Start & Late Finish of Activities on Critical Path

Step – 5 : Perform Forward Pass on Activities Not On Critical Path

Node A

ES = 1 and EF = 1+4-1 =4

Node D

ES = 4 and EF = 16

For activities with more than one preceding activity ES is latest of the earliest finish times of the preceding activities

When we have ES and EF of a particular node we can calculate the Total Float using the formula

Total Float = LS – ES or LF – EF

Step – 6 : Perform Backward Pass on Activities Not On Critical Path.

Node F

LF = LS of Previous node -1 = 18 – 1 = 17

LS = LF – Activity Duration + 1 = 17 – 9 + 1 = 9

Node D

LF = 22 since this is the last activity not on critical path it can finish on week 22

LS = 22 – 12 + 1 = 11

Node A

This node has two activities connected to it i.e D and E. In such conditions LF of node A is the earliestof the latest start times of the preceding activity. In this case it is same hence