byjusexamprep.

com

1
byjusexamprep.com

CONSTRUCTION PROJECT MANAGEMENT

4 CPM

1. CRITICAL PATH METHOD (CPM)

This is based on deterministic approach in which only one time estimate is made for activity

completion. Network diagram in CPM is activity oriented.

● It is activity oriented network

● It is used for repetitive type of work and has deterministic approach.

1.1. Comparison between PERT and CPM

PERT

1. It is event oriented.

2. It has probabilistic approach. The probability distribution is of the type of β distribution

3. Three types of times are estimated on the basic of which an expected time t e is derived.

4. Cost is directly proportional to time. Hence efforts are made to minimize the time so

as to result in the minimum cost.

5. It is suitable for newer type of projects which have not been performed in the past and

no exact assessment of time and cost are available.

Examples: Research work, launching of space a craft, development of misssile

programme etc.

2
byjusexamprep.com

CPM
1. It is an activity oriented network.
2. It has deterministic approach. probability value approaches to one here.
3. Only one time is calculated I.e. activity duration “t”.
4. Time and cost are related by the following curve given from this curve optimum time
is derived which result in the minimum cost.
5. It is suitable for repetitive type of work where time and cost can be evaluated with fair
degree of accuracy.

Examples:
● Construction work,
● Maintenance work,
● Civil engineering projects.
1.2. Event Times in CPM
1. Earliest occurrence time (TE): Time at which an event may occur as early as possible.
2. Latest allowable time (TL): Time at which event may occur as late as possible without
delaying the overall project completion time.
These are similar to PERT and are calculated in the same fashion.
1.3. Activity times in CPM
1. Earliest start time(EST): It is the earliest possible time at which an activity can be
started.
For an activity i–j, earliest event time of event i, i.e. TEi is EST of activity i–j

3
byjusexamprep.com
2. Earliest finish time (EFT): It is the earliest possible time by which an activity can be
completed.
For an activity i–j
EFT = EST +tij = TEi + tij
tij = Activity duration

3. Latest start time(LST): This is the latest possible time at which an activity can be
started without delaying the overall project
∴ LST = LFT - Activity duration
∴ LST= TLi – tij
LFT = latest finish time of activity i – j = TLi
4. Latest finish time (LFT): This is the latest time by which an operation or activity
must be completed without delaying the project.
For an activity i – j, latest allowable time of head event j, i.e. TLj is LFT of activity i–j.
Note: LST of an activity is to be calculated on the basis of latest occurrence time of its
head event and not on the brass of latest occurrence time of its tail event.
Float
● It is associated with activity times
● It is analogous to slack of event in PERT.
● It is the range within which start or finish time of an activity may fluctuate without
affecting the project completion time.
● Floats are of following types:
1. Total float: The time span by which starting or finishing of an activity can be delayed
without delaying the completion of the project.
It is the maximum available time in excess of the activity completion time.
Total float is given by FT
FT = (TLj – TEi) – tij
Total float is given by FT
FT = (TLj ) – (TEj – tij)
FT = (TLj ) – (TEj – tij)
FT = LFT – EFT
FT = (TLj – tij) – TEi
FT = LST – EST

4
byjusexamprep.com

∙ Total float of an activity affects total float of succeeding as well as preceding activities.
2. Free float (FF): The delay which can be made without delaying succeeding activities. It
affects only preceding activities. It is denoted by FF. It is assumed that all activities start
as early as possible.
Free float is given by

FF (TEi TEi ) – tij

⇒ F F = FT – S j
where Sj is head event slack.
In free float, preceding activity is not allowed to occur at its latest time and hence total
float of preceding activity is affected. However the succeeding activity can start at its
earliest start time and hence its total float is not affected.
3. Independent float (FID): It is the minimum excess available time which exists without
affecting any of succeeding or preceding activities. It is denoted by F ID.
● It is the excess of minimum available time over the activity duration.

FID (TEi TLi ) – tij

FID = FF – Si
Where Si is tail event slack.
4. interfering float (FINT): It is similar to head event slack.
FINT = Sj = FT – FF
1.4. Critical Path
In CPM analysis, the path along which total floats are zero or minimum is called as critical
path. All activities on this path are critical. There can be more than one critical paths.
1.4.1. Subcritical Path: It is the path joining all subcritical activities. For a subcritical
activity total float is greater than zero i.e.,
FT > 0
1.4.2. Supercritical Path: It is the path joining all super critical activities. For a
supercritical activity total float is less than zero i.e.,
FT < 0
Example: Compute the earliest expected time of completion of a project whose network
is shown below. The earliest expected time of each activity is shown on arrows (in Weeks).

5
byjusexamprep.com

Solution:
The network commences from event 1 and culminates at event 9.
Thus earliest expected time of completion of event (TE1) = 1
Earliest expected time for event

2(TE2 ) TE1 t12

E 0 5 5 weeks

Similarly earliest expected time for event

3(TE3 ) TE1 t13

E 0 3 3 weeks
Event 4 is approached by paths 1→4 and 1→2→4.
4
For these two paths (TE ) TE1 t14
E 0 3 3 weeks (for path 1 4)

(TE4 ) TE2 t24

E 5 6 11 weeks (for path 1 2 4)

TE4 11 weeks
Thus, (Larger of weeks and 11 weeks)
1
Thus, TE 0

TE2 5 weeks

TE3 3 weeks

TE2 t24 5 6 11 weeks

TE4 E
11 weeks
TE1 t14
E 0 3 3 weeks

TE2 t25
E 5 9 14 weeks

TE3 t36
E 3 7 10 weeks

TE5 t57 14 7 21 weeks

TE7 E
21 weeks
TE3 t 47
E 11 8 19 weeks

6
byjusexamprep.com

TE5 t5E 8
14 16 30 weeks
TE8 TE6 t6–8
E 10 4 14 weeks 30 weeks
TE3 t3–8
E 3 10 13 weeks
Now,

TE7 t7E 9
21 18 39 weeks
TE9 44 weeks
Now; TE8 t8–9
E 30 14 44 weeks

So, earliest expected time of completion of project = 44 weeks

Example: In the network as shown, the three times viz. optimistic time and the
pessimistic time (in days) are shown on the arrows. Compute the earliest expected times
and the latest allowable occurrence times of various events

Solution:
The expected time of an activity is given by,

t0ij 4t Lij t Pij

t ijE
6

7
byjusexamprep.com

Activity i-j tij0 tijL tijP tijE TEj TLj

Successor event j Predecessor event i

10 9 4 7 10 7 37.17 37.17

9 8 2 4 6 4 30.17 30.17

9 7 6 10 12 9.67 30.17 30.17

8 6 5 9 11 8.67 26.17 26.17

8 5 3 5 7 5 26.17 26.17

7 5 0 0 0 0 19 20.5

7 3 11 13 15 13 19 20.5

6 5 0 0 0 0 17.5 17.5

6 2 8 10 14 10.33 17.5 17.5

5 4 4 10 12 9.33 17.5 17.5

4 2 2 4 5 3.83 8.17 8.17

4 1 6 8 11 8.17 8.17 8.17

3 1 4 6 8 6 6 7.5

2 1 1 3 5 3 3 4.34

****