Critical Path Method Gate Notes 38
Critical Path Method Gate Notes 38
The critical path method is a method used for project analysis. In this method, different
activities are considered for the project analysis rather than the consideration of the
events. In the CPM method, different tasks are identified for the project analysis. The
critical path in the CPM is high scoring section of the GATE syllabus and is the longest
path with duration wise.
For example, the construction of buildings, the construction of highways, etc. These
projects are handled with the help of the critical path method. This method is generally
used for repetitive types of projects. The CPM analysis method calculates float
associated with an activity for the project analysis.
Critical Path
In CPM analysis, the path along which total floats are zero or minimum is called the
critical path. All activities on this path are critical. In a project network, more than one
critical path is also possible. In a project, network activities can be critical, subcritical or
supercritical. It will be explained below.
Subcritical Path: It is the path that joins all the subcritical activities in the network. A
total float is greater than zero for a subcritical activity, i.e., FT > 0.
Supercritical Path: It is the path that joins all super-critical activities of a project
network. For a supercritical activity total float is less than zero, i.e., FT < 0.
Earliest occurrence time (TE): It is the time when an event may occur at the earliest as
possible.
Latest allowable time (TL): It is the time for an event at which it can be completed for
the latest possible, but it will not affect the overall project completion time.
Earliest start time(EST): This time refers to the earliest time to start an activity.
Earliest finish time (EFT): This time refers to the possible earliest time for which
activity in the project network may be completed.
Latest start time(LST): The maximum possible time for an activity to start without any
delay in the overall project duration.
Latest finish time (LFT): The latest possible time by which an activity must be
completed without affecting the project completion time.
For an activity i – j, the latest allowable time of the head event j, i.e., TjL is the LFT of
activity i–j.
Note: LST of the activity is to be calculated based on the latest occurrence time of its
head event and not on the brass of the latest occurrence time of its tail event.
Float
Total Float
The total available time span by which the finishing or starting of an activity may be
delayed without affecting the total completion time of the project is called the total float
of the activity. Total float is the maximum available time above the activity completion
time.
FT = (TJL ) – (TjE – t j)
FT = (TJL ) – (TjE – t j)
FT = LFT – EFT
FT = LST – EST
The total float of an activity affects the total float of succeeding and preceding activities.
It is the available time for an activity to be delayed by this much without affecting the
succeeding activities. Free float affects only the preceding activities. In calculating the
free float, It is assumed that all the project network activities start as early as possible.
⇒ FF = FT – Sj
In free float, the preceding activity is not allowed to occur at its latest time, and hence
total float of the preceding activity is affected. However, the succeeding activity can start
at its earliest start time, so its total float is not affected.
It is the minimum freely available time for which completion of the preceding or
succeeding activities does not affect. It can be represented as below.
FID = FF – Si,