19-02-2021

INTRODUCTION- CRITICAL PATH METHOD

The critical path method (CPM), or critical path analysis (CPA), is
an algorithm for scheduling a set of project activities.
It acts as a basis for both preparation of a schedule, and of resource planning and helps you
to monitor achievement of project goals and what/where remedial action needs to be taken to
get a project back on course.

CRITICAL PATH METHOD AND

CONSTRUCTION MANAGEMENT ANALYSIS
Lecture by: Surbhi Modi

HISTORY BENEFITS
The critical path method (CPM) is a project modelling technique developed in the late 1950s The benefit of using CPA i.e. critical path analysis within the planning process is to help you to
by Morgan R. Walker of DuPont and James E. Kelley Jr. of Remington Rand. develop and test your plan to ensure that it is robust.
Kelley and Walker related their memories of the development of CPM in 1989. Kelley Critical path analysis formally identifies tasks which must be completed on time for the
attributed the term "critical path" to the developers of the Program Evaluation and Review whole project to be completed on time.
Technique which was developed at about the same time by Booz Allen Hamilton and the U.S.
Navy. The precursors of what came to be known as Critical Path were developed and put It also identifies, which tasks can be delayed if resources needs to be reallocated to catch
into practice by DuPont between 1940 and 1943 and contributed to the success of up on missed or overrunning tasks.
the Manhattan Project. It also helps to identify minimum length of time required to complete a project.
The first time CPM was used for major skyscraper development was in 1966 while constructing Where you need to accelerate the project, it helps to identify the activities that can be
the former World Trade Centre Twin Towers in New York City. Although the original CPM accelerated in order to complete the project on time.
program and approach is no longer used, the term is generally applied to any approach
used to analyse a project network logic diagram.
 19-02-2021

CONCEPT NOMENCLATURE
F,15
3
As with Gantt Charts, the essential concept behind critical path analysis is that you can not For various calculations involved in
critical path analysis, you need to 2
start some activities until others are finished. These activities needs to be completed in G,17 H,9
sequence with each stage more or less completed before the next stage can begin. These are understand following terminologies:-
called ‘sequential activities’. Path: A connected sequence of activities
A,6 4 I,6
Other activities are not dependent on completion of any other tasks. You can do these at any leading from the starting event to the
1 B,8 8
time before or after a particular stage is reached. These are non-dependent or ‘Parallel ending event.
D,13 J,12
activities’. Critical path: The longest path/ C,5
5
7
sequence of activities that determine the
duration of a project. E,9

Critical activities: All of the activities 6

that make up the critical path are
critical activities.

EST EFT

NOMENCLATURE NOMENCLATURE F,15

6 21
F,15
3 3
This network has four paths: For various calculations involved in critical
A,6 G,17
2 path analysis, you need to understand 2 H,9
A-F-H: Duration= 6+15+9= 30days G,17 H,9 following terminologies:- 0 6 6 23
I,6 21 30
A-G-I: Duration= 6+17+6= 29 days A,6 4 I,6 Earliest start time (EST): It is the earliest 4 23 29
time by which an activity can start. B,8
B-D-J: Duration= 8+13+12= 33 days 1 8 1 0 8
D,13 8
B,8 EST= Maximum Earliest finish time of
C-E-J: Duration= 5+9+12= 26 days J,12 8 21
D,13 immediate predecessors.
5 5 J,12
C,5 7 Earliest Finish time (EFT): Earliest time C,5 7
Hence path B-D-J has maximum 21 33
duration, so it becomes the “CRITICAL E,9 by which an activity can finish. 0 5
PATH” and activities B,D,J are “Critical E,9
EFT= ES (earliest start of an activity) + t Hence EFT of project
activities” 5 14
6 (duration of an activity) 6
is 33 days
FORWARD PASS
 19-02-2021

EST EFT

NOMENCLATURE F,15
6 21
LST LFT
PROPERTIES OF CRITICAL PATH
9 24 3
H,9
For various calculations involved in critical A,6 It is the longest path reaching the goal.
6 23 21 30
path analysis, you need to understand 0 6 2 G,17 I,6
10 27 24 33 It is not necessary that the critical path has maximum number of activities.
following terminologies:- 3 9 23 29
Latest start time (LST): Latest time an 4 27 33 There can be more than one critical paths for the same project.
0 8
activity can start without delaying the
critical path time 1 0 8 8 21 8 Any impact on any activity lying on critical path directly affects the project completion
B,8 8 21 immediately.
LST= LFT (Latest finish time of 5 J,12
succeeding)- t(duration of activity) C,5 D,13 7 The PM should focus on all activities on critical path as priority to ensure compliance to
21 33 schedules.
Latest Finish Time (LFT): Latest time an 0 5
21 33
activity can be completed without E,9
07 12 Hence EFT of project
delaying the critical path time. 6 5 14
is 33 days
LFT= Minimum latest start of immediate 12 21
predecessors. BACKWARD PASS

FLOAT/ SLACK TYPES OF FLOATS

A float is the time
Total Float:- The total time that a schedule activity can be delayed.
available for delaying
an activity without Total Float= (LFT-EFT) or (LST-EST)
delaying Finish date of Independent Float:- Amount of float that can used without affecting either of the succeeding or
the Project. preceding activity.
It is also termed as slack, Independent Float= EFT(succeeding)- LFT(preceding)- duration (present)
cushion, margin, excess Free Float:- It is the time by which the completion of an activity can be delayed beyond the EFT without
time or flexibility. affecting the EST of succeeding activity.
Free float= EST(succeeding)- EFT(present)
Interfering Float:- Part of total float that causes reduction in the total float of successor activity.
Interfering float= LFT(present)- EST(succeeding)
 19-02-2021

Total Independe Free Interferin

Activity Remarks
float nt float Float g Float EST EFT

A 03 15 00 03 -- F,15 LST LFT

6 21
B 00 00 00 00 C.P. 03
9 24 3
H,9
C 07 07 00 07 -- A,6 03 21 30
04 6 23
0 6 2 G,17 I,6
D 00 00 00 00 C.P. 03 10 27 24 33

F
07

03
12

06
06

00
00

03
--

--
3

1
B,8
9

00
0
0
8
8 00
8 21
4
04 23
27
29
33

8
Thank you
8 21
G 04 03 00 04 -- 5 J,12
C,5 D,13 7
H 03 00 00 00 -- 21 33
0 5 00
07 E,9 21 33
I 04 00 00 00 -- 07 12
5 14 Hence EFT of project
6
07 is 33 days
J 00 00 00 00 C.P. 12 21