Project Planning and Scheduling
Project Planning and Scheduling
1.1 Introduction
Fig. 1.1
2 Project Planning and Management with CPM & PERT
Once the activities have been identified, the next important process is to
arrange them in a correct sequence and allotting realistic time for their
execution. This process of determining the sequential order of planned
activities, assign them realistic time duration and determine the start
and finish date for each activity is referred as project scheduling. Project
scheduling becomes complicated in view of the complexities involved, risks
associated and difficulties encountered in defining the logical sequence of
the activities due to their multiplicity of interactions, interdependencies
and interrelationships.
Project Planning and Scheduling 3
Major three parties involved in a project are client, consultant and the
contractor around whom the entire scheme of a project revolves. All of
them have a common goal of successful project delivery but with different
objectives and routes. Client targets completion of the project in time,
within the estimated cost and with acceptable quality standards so as to put
the project to use by the stipulated date. Consultant tries to give attractive
and striking design features leaving a lasting impact, although at a cost.
Contractor puts his efforts to achieve a larger profit margin in the business.
Thus, such diverse individual objectives with a common goal necessitate
meticulous planning efforts individually and in totality. Therefore, it is
6 Project Planning and Management with CPM & PERT
erroneous to assume this role as the responsibility of any one party. Each
must develop a schedule for his required work which must be coordinated
and communicated with the other two parties because the work of each
affects the work of the other two parties.
Client while awarding the work has a clear vision for the project in
terms of the target date, cost and specific priorities. He may supervise the
work himself or appoint a project manager on his behalf to monitor overall
going of the project.
Consultant and contractor have to make their individual plans to
achieve the overall target set by the client. Consultant would plan for the
preparation of architectural and structural drawings in addition to BOQ for
tender documents. His planning shall be governed by the size, duration and
complexity of the project and accordingly, he will deploy the resources in
terms of experts, specialists and sub-consultants. It would be appropriate
and desirable if the planning of the consultant also involves the experts and
specialists who have to carry out the task of design for the project. Such an
approach necessitates effective coordination, communication and synergy
that is essential for overall going of the project. After all, the objective of
the design organisation must be to prepare the design schedule to meet the
client’s schedule for project delivery.
1.7.11 Cohesive unit with enhanced loyalty and trust: This is the
natural outcome of the enhanced confidence and morale of the team
members achieved due to good planning efforts. The successful outcome
of a project due to team effort strengthens the bonding of members making
it a cohesive unit to take further challenges. Such close bonding is full
of trust, reliability and faith wherein each one knows the strength and
weakness of the others and together as a team they magnificently manage
the opportunities and threats on their way to realize the goal.
1.7.12 One runs the project instead of a project running him: Good
planning and scheduling provides a smooth platform for the successful
delivery of the project. Anything to everything pertaining to a project is
so nicely and precisely laid in the scheme of the things that for a project
manager it becomes easier to organise, coordinate, control and manage the
project during its various stages of implementation. Effectively, PM shall be
in complete command and control of the project right from the beginning
till its completion. Technically, PM will run the project and not the other
way round and that is the key to success.
1.8 P
lanning for Multiple Small Projects vs Single Large
Project
how the work of each individual progresses from one project to another.
In the case of a large project, generally, a single project manager is assigned
the task of managing it. He is solely responsible for implementation for the
project. He is assisted by the staff personnel to give diverse technical expertise
that is required to accomplish the numerous tasks involved in going of the
project. The PM has the task of identifying and interfacing related tasks to
ensure successful delivery of the project. Much of the work of the PM involves
extensive communication with team members, client, contractor
and consultant to see that the work moves in a continuous and uninterrupted
manner.
Thus, the need of good planning and scheduling is as important for
managing multiple small projects as it is for managing a single large project.
Questions
1. Differentiate between planning and scheduling of a project. Which one
is more important?
2. Why planning and scheduling are necessary for managing a project?
3. Why planning is called as the heart of good project management?
Describe in 150 words.
4. A project manager is usually assigned the responsibility of either
managing a single large project or many small projects at a time.
Describe the different approaches to planning and scheduling that
must be used by these two types of project managers.
2
Planning and Scheduling
Techniques
2.1 Introduction
In this bar chart, activities of internal electric supply and internal water
supply are concurrent whereas, plastering and flooring work are overlapping
other activities. In fact, internal water supply and internal electric supply
are independent activities and not related with each other. However, flooring
and plastering work are interconnected with internal electric supply and
internal water supply works as these later two activities must be completed
before the former two activities commence. Bar chart however, cannot
clearly show the interdependencies among these activities. The mere fact
that two or more activities are to commence simultaneously or with certain
overlapping times doesn’t necessarily mean that those are interrelated or
interconnected. In other words, such state of activities doesn’t mean that
those activities are related, interdependent or completely independent.
This is a serious lacuna of the bar chart. Similarly, bars running parallelly
need not stand for independent activities as is reflected from the following
activities and as shown in the bar chart (Fig. 2.4) where time period for
various activities is as shown against each activity.
In this case, if all the activities are performed sequentially, total time
required for accomplishing the entire tasks shall be 57 days (i.e. 25 + 7 +
15 + 10) as reflected in the bar chart below:
With such planning, total time for completion of the entire tasks has
come down to 46 days as against earlier time period of 57 days. However,
if due to certain unexpected contingencies, the activity of excavation in
foundation has been delayed by certain days say 02 or 03 days, how this
will affect its subsequent activities i.e. PCC in foundation, reinforcement or
concreting etc. is not reflected by the bar chart.
2.2.2.2 It does not reflect project progress: In planning and execution
of a project, the primary focus of the project manager and stake holders
has to be on the progress attained on any particular day. Further, since a
project has to be in a state of dynamic equilibrium during its entire phases,
it is imperative to have a system which easily reflects the project progress,
but bar chart lacks this feature. Changes in a project are necessary which
necessitate frequent updating of the entire scheme, but that cannot be
revealed in a bar chart. To cater for such requirements, conventional bar
charts are modified by putting certain shaded portions or by partial filling
through inclined lines to show the status of progress on a particular date as
shown in Fig. 2.6 below:
Table 2.1
Numbers (1) to (7) against each sub task show their completion which
represent key events or significant points in the going of the project under
study. These important events are defined as milestones and are shown as
below:
Planning and Scheduling Techniques 21
2.3 W
ork Breakdown Structure (WBS) for Bar Chart and
Network Analysis
Network is the natural extension of the milestone chart wherein the events
are connected by arrows in a logical sequence. In a network schedule, it
requires project team to break a project down into identifiable tasks and
to relate the tasks to each other in a logical sequence much greater than a
bar chart. The up-front planning and scheduling helps the project team to
identify conflicts in resources before they actually occur. It is up to the project
manager to use his own judgment and select the method of scheduling that
best defines the work to be performed and that effectively communicates
project requirements to all participants. There are two basic elements in
a network plan; activity and event. Activity is the time consuming element
and represents a job. The event is akin to milestone and also called as node
is the beginning or the end of a job. In network system, activities are denoted
by arrows whereas events are denoted by circles or rectangles. Technically,
when all the activities and events in a project are connected logically and
sequentially they form a pictorial diagram which is called network. This
network is the basic document in a network based management system.
Before moving further, a look at event and activity will be of much use
in understanding network analysis system.
2.4.1 Activity: This is defined as the performance of a task required to
complete the project. It is clearly defined element of a project or work
and forms an integral part of the project. It consumes time and resources
and always lies between two events. Conventionally, an activity is any
function that takes place between events whether work is involved or not
26 Project Planning and Management with CPM & PERT
Both these techniques i.e. CPM and PERT are often referred to as
network analysis system. With time, the difference between CPM and PERT
net work system is fading away and with minor modification both CPM and
PERT networks have led to development of some other programmes.
Planning and Scheduling Techniques 29
Fig. 2.11
Questions
1. Broadly describe the techniques used for planning and scheduling of a
project.
2. What is a work breakdown structure in Construction Project
Management? Define and explain in brief. Further, how Work
Breakdown Structure is classified into different levels for making the
job convenient? Explain with an example. (ESE-2018 : 12 marks)
3. What is bar chart? Explain how it can be used to monitor progress of a
project. What are the limitations of a bar chart? (CS—2002 : 12 marks)
4. What do you mean by scheduling of a civil engineering project? What are
the advantages of scheduling? Discuss the classification of scheduling.
(CS—2015 : 15 marks)
5. What is Gantt chart? What are its weaknesses?
6. How milestone chart is an improvement over Gantt chart? How can
project progress be reflected on a Gantt chart?
7. Bring out the evolution of various project management techniques.
Which one is the best technique?
8. Differentiate between activity and event in reference to CPM and
PERT.
Problems
1. Prepare Gantt charts for the following projects for which various
activities and their durations are shown below:
30 Project Planning and Management with CPM & PERT
3.1 Introduction
There are various network modules for project management viz. CPM,
PERT, PEP (Program Evaluation Procedure), LCES (Least Cost Estimating
and Scheduling), and SCANS (Scheduling and Control by Automated
Network System). Each of them has its own characteristics which are
Critical Path Method 33
accordingly analyzed to get the final outcome. CPM network has following
distinct characteristics:
(a) It is built on the basis of jobs or activities and not the events.
(b) It is a deterministic model and doesn’t take into account the
uncertainties involved in the estimation of time for the execution of
a job or an activity.
(c) In this system, times are related to costs. In another terms,
time is related to resources for accomplishment of the job or
activity.
Both these methods have their own merits and demerits, but they
achieve the same results as described below:
In general, most of the rules for drawing network diagram are based on
common sense. However, certain important considerations for drawing
networks are described below:
e 3 f
b 3 4 5
b e
g
1 c g 1
a f 4
a d
d c
2 5
2
(a) (b)
3 a d
b 1 2 5
e
a d 5 c
1 2 b f
c f
e
4 3 4
( c) (e)
c
3 4
b d
a
1 2 Loop 5
f e
(e)
Fig. 3.2
E
3 6
F H
B G
A C J L
1 2 5 7 8
D K
Fig. 3.3
38 Project Planning and Management with CPM & PERT
3
Dummy
C activity
A B D E
1 2 4 5 6
GL Plinth beam
PCC
RCC
Foundation
4 6 Dummy
C E activity
A B D F G
1 2 3 5 7 8
3.6 N
umbering of Events in a Network Diagram by
Fulkerson’s Method
e
C F
f h
b
a c g n
A B E J L
d o
j l
D G K
k m
Fig. 3.7(a)
Critical Path Method 41
e
3 6
h
b C f F
a c g n
1 2 5 9 11
A B d E J o L
j l
4 7 10
D k G K
m
H
Fig. 3.7(b): Numbering of events in a network
42 Project Planning and Management with CPM & PERT
3.6.1 Skip numbering: In the above example, there were only 11 events
which could be easily incorporated in the network diagram sequentially, duly
reflecting the consistency in it. In practice, a network requires numerous
activities and events for its formulation where extensive modifications and
re-doing may be required both before and after finalization of the network
and also during progress of the work on ground. Under such situations,
network if prepared from numbers 1, 2, 3, 4, ……, i.e. without leaving any
numbers in between, addition of any new event would necessarily require
inclusion of new event number after the end event number of the already
drawn network.
For example, in the above case, if there is a requirement of additional
events between events 6 & 9 and 4 & 8, then number to the former event
shall be 12 and to the later it will be 13 i.e. after the last event i.e. 11 of the
existing network. Evidently, a number 12 between 6 & 9 and 13 between
4 & 8 shall not only look unsystematic and inconsistent but also would be
breaking the symmetry and sequence of the diagram.
To avoid such situation, numbering of the events is done by skipping the
numbers and putting events’ number in that pattern viz. 10, 20, 30, ……
etc. Thus, at a later date if there is requirement of new events’ number, that
can be given from amongst the numbers falling between already assigned
numbers. Another system may be leaving certain numbers at a regular
interval viz. 5, 6, 7; 15, 16, 17; 25, 26, 27 and so on in the initially drawn
network and subsequently using them as event numbers for the redrawn,
updated or corrected network diagram. One can use any other possibilities
to cater for such ground requirements; the choice is wide open. This type of
numbering is known as skip numbering.
Relative Relative
frequency frequency
of of
occurrence occurrence
Note: ‘to’ and ‘tp’ represent optimistic time and pessimistic time
estimates respectively and shall be discussed under PERT-network.
Fig. 3.8-(a) shows that there is more uncertainty whereas in Fig. 3.8 (b)
uncertainty is less and the system tends to be a more deterministic model.
CPM network is most commonly used in engineering construction
projects and repetitive types of works.
Example 3.3: To begin with, we will take a simple work of concreting in
foundation, having following activities:
Activity Activities description Duration
Name (weeks)
a Digging in foundation 4
b Formwork and shuttering for concreting in foundation 2
c Concreting in foundation 3
Fig. 3.9
¾¾ Names of the activities have been written at the centre above the
arrows.
¾¾ Time durations of the activities is placed at the centre below the
arrows.
¾¾ Earliest time for events is mentioned on the top of the respective
events.
¾¾ Earliest time for accomplishment of the entire work is 9 weeks.
3.7.1 Earliest Event Time: Earliest event time for an event is the time
when an event can be said to have occurred at the earliest. In the above
example shown under Fig. 3.9, the network was simple, linear and straight
forward without any concurrent or parallel activities. One has to simply
move in the network from left towards right, add the time duration and
derive earliest event time for the respective events. This example was to
acquaint the reader with various aspects associated with the activities and
events in a CPM network. In general, while preparing a CPM network for
any construction project, there is multiplicity of the activities and events
Critical Path Method 45
TE = 6 TE = 10
e
3 5
4 g
c
TE = 0 TE = 3 3 TE = 13 TE = 15
3
a b h
1 2 6 7
3 8 2
d f
4 5
4 TE = 7
Fig. 3.10-(a)
•• By choosing the first path i.e. 1-2-3-5-6, event-6 can occur at time
T = 13 weeks.
•• By following the second path i.e. 1-2-6, event-6 can occur at time
T = 11 weeks.
•• By selecting the third path i.e. 1-2-4-6, event-6 can occur at time
T = 12 weeks.
As per the guidelines for CPM network under Para 3.3 above, no event
can be considered as occurred or reached until all the activities leading to it
have been completed.
TE = 6 TE = 10
e
3 5
4 g
c f
TE = 0 TE = 3 3 4 TE = 10 3 TE = 15 TE = 17
a b h k
1 2 6 7 8
3 4 5 2
d j
4
5
4
TE = 7
Fig. 3.10-(b)
In this network; event-6 can be reached from two paths i.e. 1-2-3-6 and
1-2-6.
•• By choosing the first path i.e. 1-2-3-6, event 6 can occur at time
T=10.
•• By following the second path i.e. 1-2-6, event 6 can occur at time
T=7.
¾¾ Assigning earliest event time T=7 to event-6 would reveal that
although all the activities along the path 1-2-6 have been completed
but all the activities along the path 1-2-3-6 have not been completed.
¾¾ However, if event-6 is assigned earliest event time T=10, all
the activities along both paths i.e. 1-2-3-6 and 1-2-6 have been
completed.
3.7.2 Key to Evaluate Earliest Event Time (TE ): From above examples
under Fig. 3.10(a) and 3.10(b), it is evident that whenever, there is more
than one path to reach an event, value of TE for the said event shall be
maximum of the time taken out of different paths reaching that event.
Therefore, following equation holds the key to calculate TE for an event.
TE (successor event) = M
aximum of {TE (predecessor event) + t(activity)}
TjE = Maximum of (TiE + tij)
In a pictorial form this can be depicted as below;
e
T E = 10
E
eg g
f t =3
T E = 10 T E = 15
F G
fg
t =5
dg
t =5
D d
T E=7
Fig. 3.11
48 Project Planning and Management with CPM & PERT
This part of network has been derived from Fig. 3.10(b). Events D, E, F
& G in Fig. 3.11 correspond to events 4, 5, 6 & 7 of Fig. 3.10(b).
Time duration for activity EG, FG and DG is 3, 5 and 5 weeks
respectively.
Event-G can be reached by three paths i.e. EG, FG and DG. Thus,
earliest event time for event-G shall be the maximum value from amongst
the following;
The maximum of these values is 15 weeks and thus, earliest event time
for event-G is 15 weeks. We denote this as TgE = 15 weeks.
Therefore, to calculate the earliest event time for an event which can
be reached from various paths/routes, following step- by – step approach
shall work as a guiding tool.
Step-1: Identify the paths/routes reaching at this event.
Step-2: Calculate the earliest event time for its immediate predecessor
events on those identified routes.
Step-3: Add the interconnecting activity’s time to the immediate
predecessor event time on those identified routes.
Step-4: The maximum of the value attained in step-3 shall be Earliest
Event Time to the event under consideration.
In equation form, this is represented as below:
TjE = Maximum of (TiE + tij)
Where, i-j is the activity connecting the events i and j.
3.7.3 Latest Allowable Occurrence Time: Latest event time for an
event as the title suggests is the latest time by which an event must be
completed in order to keep the project on schedule. The necessity of this
time has been generated due to certain time margin i.e. float available for
performing an activity. This aspect shall be discussed subsequently. In the
case of Earliest Event Time (TE), efforts are to accomplish the tasks at the
earliest whereas, in Latest Allowable Occurrence Time of an event, there
is a margin/play available to complete the event. This will be clear as we
proceed with examples. For presentation purpose, latest allowable time is
denoted as TjL.
Critical Path Method 49
TE = 0 TE = 4 TE = 6 TE = 9
a b c
1 2 3 4
t=4 t=2 t=3
weeks weeks weeks
TL = 0 TL = 4 TL = 6 TL = 9
Fig. 3.12
TE = 6 TE = 10
TL = 6 TL = 10
3 6
TE = 0 TE = 3 4 TE = 14 TE = 16
TL = 0 TL = 3 2 TE = 8 4 TL = 14 TL = 16
3
TL = 11
1 2 5 7 8
3 5 3 2
4
6
4
TE = 7
TL = 8
Fig. 3.13
In this network, TE for the last event i.e. event 8 is 16 weeks. This is
the project completion time. Latest event occurrence time TL for the last
event is considered to be equal to TE for the last event i.e. T8L = 16. This
necessarily has to be so unless some condition is placed to have different
values of TE and TL for the last event. With this presumption, TL for the
preceding events shall be calculated as below:
Event-7 is the preceding event to event-8. Time taken for completion
of the activity 7-8 is 2 weeks. This means that latest time by which event-7
can be completed is T8L–2 i.e. 16–2 =14 weeks. Thus, T7L= 14 weeks.
On the similar analogy,
In the true grammatical meaning slack time refers to relaxed or loose time.
In network diagram also it has similar connotation. Technically, slack time
is more commonly used in event controlled network viz. PERT, but it is
equally applicable to CPM network also. While calculating the slack time
of events, it will be revealed that it helps in identifying the critical path of
the network. Slack time is the difference between the Earliest Event Time
and Latest Occurrence Time of an event. It is denoted by ‘τjs’ or ‘s’ where j
denotes the jth event of the network and τjs or ‘s’ represents the slack time
for the said event. In the equation form it is shown as:
τjs = s = (TjL – TjE)
3.8.1 Calculating Slack Time in Tabular Form: In the network
shown in Fig. 3.13, values of TE and TL have been calculated in a logical
manner to give their correct values to the respective events. The same can
be calculated in a tabular form for ease and deriving certain other specific
information as below:
Table 3.1
Note: Slack time for event-5 is 3 weeks and for event-4 it is 1 week. Path
following the events having zero slack values is the critical path and shown in
thick lines.
# shows maximum of the TE values for event-7.
* shows maximum of the TE values for event-5. In this case both are equal to 8
54 Project Planning and Management with CPM & PERT
T3E = 6 6
T E = 10
T3L = 6 T6L = 10
S=0 S=0
T1E = 0 T2E = 3 3 6 7
T E = 14 T8E = 16
4 7
T1L = 0 T2L = 3 T L = 14 T8L = 16
2 4
S=0 S=0 3 T5E = 8 S=0 S=0
5
T L = 11
1 2 5 7 8
3 5 S = +3 2
4 6
4 T4E = 7
T4L = 8
S = +1
Fig. 3.14
Time in
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15
weeks
TE = 7 TE = 10
EL = 7 EL = 10
3 5
TE = 3 3
TE = 0 TE = 12 TE = 14
EL = 0 EL = 3 2 EL = 12 EL = 14
4
1 2 6 7
3 2
4 4
3
3
TE = 7 4 4
EL = 9
Slack
Time
(2 weeks)
hat slack time denotes has been discussed already, but how it impacts
W
the network can be understood by drawing a net work and studying it
as per Fig. 3.15.
Critical Path Method 55
It is important to note that for all other events, values of TE are equal
to TL individually and therefore, solid circles would cover the dotted circles
as they will fall on each other. Critical path shall be along the events where
there is zero slack time. Accordingly, path 1-2-3-5-6-7 shown in dark thick
lines shall be the critical path in this network.
3.9 Float
We have so far discussed the time element associated with the events and
on that basis slack time for the events were calculated and critical path for
the network identified. Equally important is the time element associated
with the activities or jobs of the network diagram. For an activity i-j, there
are four time estimates as below:
Earliest Start Time (EST): The EST refers to the time before which
the activity cannot begin. Thus, it is the earliest occurrence time for the
event from which the activity or job arrow shall originate. It is denoted as
TiE. Thus, EST=TiE.
Earliest Finish Time (EFT): When time duration of the activity i-j is
added to the earliest occurrence time of the event from which activity arrow
originates, EFT is arrived at. Thus, EFT = TiE+tij.
Latest Start Time (LST): This is the time arrived at by subtracting the
activity time duration from the latest occurrence time of the event at which
the activity arrow terminates. Thus, LST = TjL - tij.
56 Project Planning and Management with CPM & PERT
Latest Finish Time (LFT): This is the latest occurrence time for the
event at which the activity arrow terminates. It is denoted as LFT = TjL.
Thus, EST is synonymous to Early Event Time of the node from which
activity arrow originates and LFT is synonymous to the Latest Occurrence
time of the node at which the activity arrow terminates. Following figure
depicts these four time estimates pictorially.
i
TE
EST ij EFT
t TL
j
LST LFT
tij
Time in
weeks 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15
TE = 0 TE = 12 TE = 14
EL = 0 EL = 12 EL = 14
EST=3 LST = 5
1 2 2 6 7
3 2
4
3
4 3
4 4
EFT = 7 LFT = 9
Fig. 3.16
Fig. 3.16 is derived from Fig. 3.15 and shows part network for the
purpose of defining EST, EFT, LST & LFT. Activity 2-4 has been taken for
this purpose. Arrow originates from event-2 and terminates at event-4.
Time duration for activity 2-4 is 4 weeks.
Considering the overall network of Fig. 3.15, Latest Event Time for
event-4 is 9 weeks and Earliest Event Time for event-2 is 3 weeks. Thus, for
activity 2-4, total time availability from the network viewpoint is 6 weeks (i.e.
9 weeks – 3 weeks) whereas it takes only 4 week’s time for its completion.
This means there is a margin/gap/space/play of 2 weeks (6 weeks – 4 weeks)
for performing this activity. This margin is the main reason for study of EST,
EFT, LST & LFT which are helpful in deriving floats for the activities.
If the job 2-4 is completed on the EFT i.e. at 7 weeks, it is left with 2 week’s
time for commencement of its subsequent job i.e. 4-6. These time spaces are
defined as float and shall be discussed in subsequent paras.
There are three types of floats in a net-work diagram; total float,
independent float and free float.
Critical Path Method 57
3.9.1 Total Float: For an activity i-j we have four time estimates as
discussed above; EST, EFT, LST & LFT as shown in the following figure.
Time
(days) 1 2 3 4 5 6 7 8 9 10 11 12
Total Float
1
i j
ij
t = 6 days
EST=2 EFT=8
i
TE
i j
tij = 6 days
LST=4 LFT=10
TjL
Total time available for activity–ij= 8 days
Actual time required for completing activity–i j = 6 days
Total Float time for activity–ij = 86 = 2 days
Fig. 3.17
This figure depicts following:
The maximum time available for performing job i-j is the difference
between its earliest start time and latest finish time i.e. TjL–TiE, which is
equal to 10 – 2 = 8 days. However, the time required for actual completion
of this activity i-j is 6 days only. Thus, we have 2 days’ extra time (i.e. 8 – 6
= 2 days) over and above the actual time required for completion of the job
i-j. This extra time is termed as float.
¾¾ EST for the activity i-j is 2 days i.e. it cannot begin before 2
days. This is also the earliest event time for i. Time duration for
completion of activity i-j = 6 days. Therefore, EFT for activity i-j
shall be; EST + 6 = 2 + 6 = 8 days. EST and EFT are shown with
firm circles.
¾¾ LFT for activity i-j is 10 days i.e. it cannot go beyond 10 days. This
is also the latest event time for j. Time duration for activity i-j = 6
days. Therefore LST for activity i-j shall be; LFT – 6 = 10 – 6 = 4
days. LFT and LST are shown with dotted circles.
¾¾ Total float for the activity i-j shall be 2 days.
Total float for activity i-j = Maximum time available – Actual time
for the activity i-j required for
the activity
i-j
= (TjL – TiE) - tij
= (TjL – tij) - TiE
58 Project Planning and Management with CPM & PERT
= LST – TiE
= LST of the activity–EST of the activity
= L atest Start Time of activity i-j – Earliest
Start Time of activity i-j
Total float has been shown by a dark arrow in the network above.
3.9.2 Free Float: The bottom line in free float is that all events are
considered to have occurred on their earliest event times. It is one of
the possibilities that may happen in a network. This evidently means
that all the activities shall start at their EST. This is explained in
Fig. 3.18.
Time
(days) 1 2 3 4 5 6 7 8 9 10 11 12
i
Free EST (T E)=1 EST (TjE)=5
Float
i j k
tij=3 days tjk=4 days
j
T E=5 days
TiE+tij=1+3=4 days
Free
Float
h i j k
hi
t =2 tij=2 jk
t =1
TjE - TiL
i
TE TjE =8
h i j k
i j
Independent float for i-j =
i
j i
TE – TL – t
ij
T L =5 TjL
= 8–5–2
= 1 day TiL is assumed 5 days for this case
In this network, activities i-j and j-k have been considered wherein
activity j-k is the successor activity to i-j. As brought out above, the events
are assumed to have occurred on their earliest event times, therefore we will
assign earliest event times to each event i and j as TiE and TjE respectively.
This evidently reveals that;
EST for activity i-j = TiE. = 1 day
EST for activity j-k =TjE.= 5 days
Time available for the activity i-j = TjE – TiE.
Actual time required for completing activity i-j = tij
Free float for activity i-j = TjE – TiE-tij
= TjE – (TiE+tij)
= TjE – Earliest Finish Time (EFT) of activity
i-j
In the above example, tij = 3 days
EFT for activity i-j = TiE+ tij= 1 + 3 = 4 days
Free float for i-j = 5 – 4 = 1 day
Thus, free float of an activity is the difference between the earliest start
time (EST) of its succeeding activity and the earliest finish time (EFT) of
the activity under consideration.
3.9.3 Independent Float: The basis of consideration in this type of float
is that for an activity under consideration, it is assumed that its preceding
activity is completed at the latest finish time and its succeeding activity
starts at the earliest start time.
To understand this, Fig. 3.18 may be referred. It shows three activities
h-i, i-j and j-k. Time duration for these activities are thi, tij and tjk respectively.
Since independent float is based on latest finish time of the preceding
activity, therefore, for activity i-j, we will target latest finish time (LFT) of
the preceding activity h-i which is TiL in this case. Next point of interest is
the earliest start time (EST) of the succeeding activity j-k which is TjE. The
margin/space available for the activity i-j shall be between (TjE – TiL) and tij,
which is defined as independent float.
Calculations for independent float for activity i-j may be done as
hereunder:
Time duration for activity i-j = tij
Latest finish time for its predecessor activity h-i = TiL
Earliest start time for its successor activity j-k = TjE
Total time available for activity i-j = TjE – TiL
60 Project Planning and Management with CPM & PERT
3
TE=8 T5E = 14
T3L = 8 T5L = 15
3 6 6
T1E = 0 TE=4
2 6
T E = 11
8
T E = 18
9
T E = 20
T1L = 0 T2L = 4 4 3 3 T8L = 18 T9L = 20
T6L = 11
1 2 5 8 9
4 6 7 2
5 0
6 4 5
4 7
4
T4E = 9 7
T E = 13
T4L = 10 T7L = 14
Fig. 3.19
Table 3.2: Three types of Floats in a tabular form
1 2 3 4 5 6 7 8 9 10 11
Activity Duration Earliest Latest Total Free Independent Remark
Beginning Ending Start Finish Start Finish Float Float Float (IF)
(j) (TF) (FF)
(i)
1 2 4 0 4 0 4 0 0 0
Critical Path Method
1 4 6 0 6 4 10 4 3 3
2 3 4 4 8 4 8 0 0 0
2 4 5 4 9 5 10 1 0 0
2 5 6 4 10 5 11 1 1 1
3 5 3 8 11 8 11 0 0 0
3 6 6 8 14 9 15 1 0 0
4 7 4 9 13 10 14 1 0 –1* ‘IF’=0
being (-)ve
5 7 0 11 11 14 14 3 2 2
5 8 7 11 18 11 18 0 0 0
6 8 3 14 17 15 18 1 1 0
7 8 4 13 17 14 18 1 1 0
7 9 5 13 18 15 20 2 2 1
8 9 2 18 20 18 20 0 0 0
9 next - 20 - 20 - - - - For ref only
61
62 Project Planning and Management with CPM & PERT
5 10 10 19
C,5 E,9
5 10 10 19
0 0 3 3 5 19 20 20
Start A,3 B,2 G,1 End
0 0 3 3 5 19 20 20
13 17 17 19
D, 4 F, 2
5 9 10 12
Critical path from this network is A-B-C-E-G and shown by a thick line.
Critical Path Method 63
Questions
1. Is CPM an improvement over Gantt chart and WBS structure? Explain,
how?
2. What is critical path? How it is calculated?
3. List the rules of identifying critical path of a network.
(CS-2003 : 10 marks)
4. Can a network have more than one critical path? Show with examples.
5. Differentiate between slack and float. How these are useful in a
network?
6. What is the difference between ‘Free Float’ and ‘Total Float’? Explain
the significance of each term. (ESE- 1997 : 15 marks)
7. In a network, there are two paths from start to completion. Along path-1,
earliest event time and latest finish time are identical for all the events
falling on this path whereas for path-2, these times are not identical for
some intermediate events. Possibility of float and slack values shall be
in which of the paths?
8. Why dummy activities are necessary in a network? Is it possible to have
a network without dummy activities?
9. What are the main advantages of Activity on Node (AON) over Activity
on Arrow (AOA) networks? (ESE-2016 : 8 marks)
10. Identify activity and event from the following:
(a) Digging in foundation
(b) Foundation completed
(c) Bending and laying of reinforcement bars
(d) Taking car to garage
(e) Reinforcement bars laid
(f) Car servicing completed
(g) Plastering the wall
(h) Painting work completed.
11. Define :
EST; LFT; Total Float; Free Float; Interfering Float. (CS-2011 : 10
marks)
64 Project Planning and Management with CPM & PERT
Problems
1. Draw a CPM network diagram for construction of a semi underground
RCC water storage tank having following activities and durations:
(a) Site layout and marking on ground 01 week
(b) Digging for foundation 02 weeks
(c) Laying of rebars & RCC work up to ground level 06 weeks
(d) RCC up to roof top 05 weeks
(e) Water connection including fittings and fixtures 04 weeks
(f) Water proofing treatment including plastering;
internal & external 04 weeks
(g) Testing of the tank for leakage/seepage including
rectification if any 02 weeks
(h) Returning filling below ground level 02 weeks
(i) Handing over 01 week
Draw the critical path for the network and find the completion time.
2. You have to organise a One day’s Technical Seminar in your office
on a given topic which will be attended by speakers and guests from
different parts of the country. Seminar booklet shall have minimum
ten technical papers. There will be six speakers reading their technical
papers. Following is the time schedule.
(a) Fix/deciding the date of Seminar 7 days
(b) Calling for technical papers 28 days
(c) Receipt of technical papers 42 days
(d) Fixing the rates for magazine with publisher 14 days
(e) Proof checking of technical papers and their finalization 21 days
(f) Request letters to guest speakers for seminar 14 days
(g) Send magazine for printing and collect printed booklet 21 days
(h) Arrange accommodation and meals for seminar 14 days
(i) Arrangement of transportation 7 days
(j) Arrange venue and PA system 3 days
(k) Conduct Seminar 1 day
(l) Prepare Seminar proceedings and dispatch 7 days
Prepare CPM network for this Seminar and determine critical path.
Critical Path Method 65
4.1 Introduction
In the Critical Path Method (CPM), duration of each activity is usually defined
with a reasonable degree of certainty based on the previous experience,
technical knowhow, maturity and judgment of the person preparing the
network. The emphasis in CPM is on the activities for performing the given
project in totality. In PERT network, emphasis is on the events that is on
the specific achievements, targets or milestones which may be in the form
of commencement or completion of the given tasks. For example followings
may be referred;
(a) The Optimistic Time Estimate: This is the time estimate for
an activity under the most optimistic circumstances and thus is
the shortest time for performing the said activity under ideal
conditions. It is assumed that there will be no delays, hiccups and
setbacks and the work shall be completed as originally planned.
Better than the normal conditions are assumed to prevail during
the going of the job. There is no iota of doubt or confusion at
any point of time during the course of the job about the ground
realities. This is the time estimate assuming that everything will go
well and is evidently the minimum, but has a very low chance of
being realized in actual practice. This is when unusual good luck is
experienced, and everything goes right the first time. There is only
a very small chance of completing the activity in less than this time.
This is represented as to.
PERT–Network 69
4.3.2 Range: This is the difference between the longest and the shortest
time taken for completing a job. For an example a job (i-j) is for digging the
foundation for a building having area of 200 sq m. Different experts may
give varying time estimates for the said task say 20 days, 22 days, 25 days,
28 days & 35 days. Thus, for the same task there is a range of 20–35 days.
One may say the range for task (i-j) is 15 days. It can also be put other way
round i.e. if the optimistic time for the task is 20 days and pessimistic time
as 35 days, the range for the job shall be 15 days.
4.3.3 Spread and Dispersion: In the case of range, there is information
about the longest and the shortest time, but has no value addition in the
information due to other intermediate values lying in between these two
values. For example, in the example under 4.3.2 above, time estimates
are 20, 22, 25, 28 and 35, but the range i.e. 15 days doesn’t bring out any
information about the type of spread of data, their individual position vis-
a-vis other values or average value and so on. Therefore, the concept of
spread or dispersion was necessitated by the statisticians. To cater for this, a
more satisfactory measure i.e. variance has been included.
4.3.3.1 Variance: It is the measure of dispersion of the data from the
mean value. It gives a fair idea about the spread of data from the mean
value and gives wider information to the observer. Variance is the square
of the standard deviation value of the data analyzed and is calculated as
hereunder:
72 Project Planning and Management with CPM & PERT
(i) Calculate the mean value of the data available for distribution.
(ii) Determine the deviation of each individual value from the mean
value.
(iii) Square the individual variations so arrived and add them all.
(iv) Find the mean of the square deviations arrived at (iii) above.
Figure arrived at (iv) is variance for the entire data values under
consideration and is denoted as σ2.
4.3.3.2 Standard Deviation: The square root of the variance is called
standard deviation and is denoted by σ. This also adds to the information to
the observer about the spread and dispersion of the data.
4.3.4 Probability: Probability is often connected with the words chance,
uncertainty and likelihood. It is like a dice which has six faces, when rolled
once while playing, the probability of getting a side with 4 number shall
be 1/6. It cannot be said with confidence that while rolling the dice one
would get a pre-decided face with absolute certainty, rather there is always
an element of uncertainty and chance which gives rise to probability.
Another example may be of mobile phones where a vendor has a large
number with him and roughly 20 % of them are defective. If someone picks
10 mobile phones from the vendor, the chances are that 2 may be defective.
However, if another 10 are picked, the chances may be that all are defect
free. Similarly, if another 10 are picked, it may have 4 defective. However,
if the entire lot is taken in totality there will be 20% defective pieces. Thus,
mathematically, if ‘n’ is the number of defective pieces in a lot of ‘N’ then
probability of picking a defective piece shall be = n/N.
4.3.5 Frequency Distribution Curve: This is the graph/curve plotted
between the available data against their frequencies of occurrence in the
set of data. For example, rainfall in mm at a station has following values
during a particular period:
400 600 500 550 680 700 550 600 550 440 580 680 650
580 750 450 600 650 580 600 580 600 580 800 700 600
680 580 650 600 450 450 680 600 500 650 680 650 500
475 600 500 550 580 600 500 680 550 500 550 475 700
550 500 500 600 680 500 600 600 600 500 500 600 600
PERT–Network 73
Table 4.1
Range (mm) Frequency (nos)
400 - 449 2
450 - 499 5
500 - 549 11
550 - 599 14
600 - 649 16
650 - 699 12
700 - 749 3
750 - 799 1
800 - 849 1
20
15
10
Frequency
0
49 99 49 99 49 99 49 99
0-4 0-4 0-5 0-5 0-6 0-6 0-7 0-4
40 45 50 55 60 65 70 75
25
20
15
Frequency
10
0
0 2 4 6 8 10
Rainfall range (mm)
4.3.6 Normal Distribution Curve: When the data are spread equally
on either side of the mean value they are said to be distributed in a normal
manner and when shown on a frequency distribution curve they are
symmetrically placed on either side of the mean value.
PERT–Network 75
No.
of
jobs
A B
to tm tp
Time estimates
4.4 R
elationship between Beta-Distribution Curve and
Variance
Probability
to tm tp
Time duration
Table 4.2
Person to tm tP Range σ= Variance te =
(weeks) (weeks) (weeks) (tP – to) (tP – to) (σ2) (to + 4tm + tp)
6 6
P-1 5 7 10 5 0.83 0.69 7.17
P-2 6 9 12 6 1 1 9
P-3 5 7 9 4 0.67 0.44 7
Variance in the case of P-3 is the least of the three values and highest
in the case of P-2. Thus, P-3 is more certain about his estimates followed by
P-1 and P-2 in that order.
→ Certainty of the estimates, P-3 > P-1 > P-2
Teo = 12
TEm = 17 Teo = 18
TEp = 22 TEm = 24
6-7-10
3 6 TEp = 32 Teo = 30
TEm = 39 Path-1
Teo = 15 4-5-8
TEp = 51
TEo = 0 7-10-12 TEm = 18 Teo = 24 Teo = 22 Teo = 32
TEm = 0 TEp = 22 Path-2 TEm = 30 TEm = 29 Path-1 TEm = 40 Path-2
TEp = 0 TEp = 35 TEp = 40 TEp = 46
5-7-10 10-11-12 9-12-13 8-10-11
1 2 5 8 9
Teo = 34
Teo = 5 TEm = 39 Path-3
9-10-11 10-11-12 TEp = 45
TEm = 7 8-9-12
TEp = 10
Teo = 30
TEm = 36 Path-4
TEp = 46
Teo = 13 4-9-12
TEm = 16 4 7 Teo = 24
TEp = 22 Teo = 20 TEm = 28 Path-3
TEm = 25 Path-4 TEp = 33
TEp = 34
Fig. 4.5
78 Project Planning and Management with CPM & PERT
In this network, there are four paths along which the entire work can
be completed. These four paths and time taken i.e. to, tm and tp along them
is shown in Table 4.3.
Table 4.3
Looking at this table, the maximum time taken for completing the
project shall be:
As discussed earlier, the longest route for completing the project is called
critical path and it consumes the maximum resources. Table 4.3 shows three
critical paths and they are under three different time estimates. Technically,
there may be more than one critical path but they should be under similar
time estimates. This is essentially required for logical planning, monitoring
and control of the project.
In the present case, the scenario is different i.e. three critical paths
under different time estimates. Such a situation, not only create confusion
and misunderstanding but also will lead the decision makers in diverse
directions thus defeating the very purpose of project planning and
management. It is in this context that there is a requirement of a single
time estimate catering for the aforesaid three time estimates (to, tm, tp) as
per their weights to resolve the complexity arising out of such uncertainties.
Therefore, in PERT analysis expected time te is considered which is derived
as per Eqn. 4.1. Expected time te is also known as average time. This
equation is derived from β-curve and forms the basis for estimating the
expected time of a project.
PERT–Network 79
Having been conversant with the three time estimates and necessity of
a single time estimate for arriving at a logical conclusion regarding project
delivery schedule, te values for various activities shall be calculated in
tabular form and there after critical path shall be determined i.e. the path
consuming the maximum time for accomplishing the entire project.
Table 4.4
A comparison of Table 4.3 and Table 4.4 gives entirely different result.
Critical path from the estimates based on te i.e. expected time values is
Path-2 and it takes 39.67 days for completion of the entire project. Another
important feature of Table 4.4 is the closeness of the Σ te values along the
four paths i.e. Path-1 = 39.50, Path-2 = 39.67, Path-3 = 39.17 and Path-4
= 36.67 days. These values are in sharp contrast to the values obtained in
Table 4.3 which were 51, 40 and 34 days respectively along the paths-1, 2
and 3. This justifies the rationale for deriving te values based on Eqn. 4.1.
80 Project Planning and Management with CPM & PERT
Probability
to tm & te tp
Time duration
Fig. 4.6 shows a Normal distribution curve, where data are identically
spread on either side of the central point. This shows that data between
tm & to and tm & tp are symmetrically placed. Under this condition, value of
expected time or average time te shall be equal to the value of tm as can be
seen from the example given below:
Example 4.3: An activity i–j has three time estimates 10-12-14 days,
i.e. optimistic time-most likely time-pessimistic time in that order. Calculate
the values of average time or expected time for completion of the said
activity. What inference is drawn from this?
PERT–Network 81
Probability
to = 9 tm = 10 te = 10.67 tp = 15
Time duration
Table 4.5
45-50-56 15-17-19
5 6 8
dummy
dummy
dummy
60-64-70
9
Table 4.6
Activities, 4-5, 8-10 and 9-10 are dummy activities and hence no time
is shown against them.
Total completion time for the project is 93.66 days and it is along the
Path-1.
Table 4.7
e f
6 8
50 17
dummy
0
a b c d h j
1 2 3 4 5 9 10
3 7 11 48 20 4
dummy
0
g
7
64
The major difference between the PERT and CPM network for a
project as visible from Fig. 4.8 and Fig. 4.9 are as below:
(a) In the PERT network Fig. 4.8, there are 12 arrows (including 3
dummy activities) and 11 nodes whereas, in the CPM network
Fig. 4.9, there are 11 arrows (including 2 dummy activities) and
10 nodes. Both, these networks can be made to look indentical
by slightly adjusting the nodes and activities. Evidently, it is up to
the person drawing the network, as how much similarities can be
brought in these networks for the same project.
(b) Achieving similarities in these networks may be for academic
interest and not for practical consideration as the object of
network analysis is to monitor the project whether based on
PERT or CPM technique.
As a general rule, PERT and CPM network for a project will look much
alike with minor differences. However, different person may not draw exactly
similar network for a project due to their personal experience, priorities and
prevailing circumstances.
Example 4.6: A ‘PERT’ network is shown in Fig. 4.10 below. Put the
number of the events as per Fulkerson’s rule. Calculate expected time for
each activity, range, standard deviation and variance. Find out the total
time required for completing the project. Find out the activities having
maximum and minimum certainty? Also find out the activities having the
normal distribution or skewed distribution.
7-9-10 10-12-15
20 50 80
5-8-10 4-6-8
0-0-0
30 8-9-11 90
10-14-17
70
Fig. 4.10
Table 4.8
86
6
Path-1 10-20 5 8 10 7.83 5 0.83 0.69
10-20-50-80- 20-50 7 9 10 8.83 3 0.50 0.25
100-110 50-80 10 12 15 12.17 41.66 5 0.83 0.69
80-100 4 6 8 6 4 0.67 0.44
100-110 5 7 8 6.83 3 0.50 0.25
Path-2 10-40 4 6 7 5.83 3 0.50 0.25
10-40-60-100- 40-60 6 8 11 8.17 5 0.83 0.69
26.83
110 60-100 5 6 7 6 2 0.33 0.11
100-110 5 7 8 6.83 3 0.50 0.25
Path-3 10-40 4 6 7 5.83 3 0.50 0.25
10-40-60-90- 40-60 6 8 11 8.17 5 0.83 0.69
31.00
110 60-90 7 9 12 9.17 5 0.83 0.69
90-110 6 8 9 7.83 3 0.50 0.25
Path-4 10-30 7 9 10 8.83 3 0.50 0.25
10-30-70-90- 30-70 11 14 17 14 6 1.00 1.00
39.83
110 70-90 8 9 11 9.17 3 0.50 0.25
90-110 6 8 9 7.83 3 0.50 0.25
Project Planning and Management with CPM & PERT
PERT–Network 87
Questions
1. What is the significance of three time estimates? How we arrive at
weighted average of the mean?
2. Define and explain the terms: (i) Most likely time (ii) Mean time and
(iii) Expected time as related to various activities of a project.
(ESE-2002 : 15 marks)
3. Define PERT and discuss its significance. Explain different time
estimates used in PERT. (CS-2015 : 10 marks)
4. What is the difference between average value and expected value?
How these values differ from the most likely value. Draw a β- curve and
show all the three time estimates on it.
5. What is frequency distribution curve? How it differs from probability
distribution curve?
88 Project Planning and Management with CPM & PERT
Problems
1. Draw a network diagram for “Road construction” with following events
and time estimates. Number the events as per Fulkerson’s rule and
derive expected values for the events and total completion time for the
project.
4-5-8 5-8-10
0-0-0 4-7-9
3-4-5
8-10-11 5-6-7
5-6-7
5.1 Introduction
In the previous chapter, we had discussed about time estimates i.e. optimistic
time (to), pessimistic time (tp), most likely time (tm) and expected time (te)
or average time. It may be seen that all these time estimates were for the
activities or job and not for the events. In a simple and linear network,
activities and events simply move from left towards right and has a single
path for accomplishing the entire project. In such a network, determining
the critical path and calculation of the time for accomplishing the project is
simple, easy and straightforward.
A network consists of the activities and events both. Accomplishment
of the event signifies major achievement which may be in terms of the
milestones or set targets. Events do not consume any resources but they
are as important in the network as activities, rather, they complement
each other. As, an event is the starting or finishing point of the activity, it is
important to know about its earliest expected time and latest occurrence
time. These times are denoted by TE and TL respectively and help in
understanding various issues related to network and completion time of the
project.
This refers to time when an event can take place at the earliest. Technically,
until all the activities leading to the said event have been completed, the
event cannot be said to have been reached at. Thus, earliest expected time
90 Project Planning and Management with CPM & PERT
for an event shall be the time by which all the activities reaching at the
event have been accomplished.
Example 5.1, A simple network: A network as shown in
Fig. 5.1 is considered wherein te values (in days) have been calculated from
the available three time estimates.
te = 0 te = 7 te = 15.17 te = 27.50
5-7-9 7-8-10 10-12-16
i j k l
teij = 0 jk
te = 8.17
kl
te = 12.33
Fig. 5.1
However, if the network is complex, and has multiple routes for arriving
at the final event with possibility of more than one critical path, it becomes
a challenging task for the planner and project manager to determine the
critical path and find out the time for completion of the project in totality.
This will be clear from the following example:
Earliest Expected Time (TE) and Latest Allowable Occurrence Time 91
3
T E = 15 T6E = 22.83
6-8-9
3 36
6
te = 7.83
6-8-10 15-16-17
23
te = 8 3-5-7 68
1
TE=0 T2E = 7 35 te = 16 8
T E = 38.83
te = 5
5-7-9 10-11-14 12-14-17
1 12
2 25
5 58
8
te = 7 te = 11.33 te = 14.17
5-6-8 T5E = 20
78
24
te = 6.17 9-11-12 te = 10.83
11-14-16
T4E = 13.17 4 7
47
te = 13.83 T7E = 27
Fig. 5.2
The figure shows two paths (1-2-3-5 and 1-2-5) entering at event-5
and four paths (1-2-3-6-8, 1-2-3-5-8, 1-2-5-8 and 1-2-4-7-8) at event-8.
Each path may give different values of earliest expected time to event-5 and
event-8, but we cannot have more than one value of earliest expected time
for an event. Therefore, such a situation requires closer look at the network
to arrive at the appropriate value of the earliest expected time (TE) for the
affected events. In the present case, TE values for the events have been
calculated as per the Equation 5.1, TjE = TiE + teij. Accordingly, those values
are derived as below:
T1E = 0
(This is the 1st event and assumed to have value as zero
signifying commencement of the project.)
T2E = T1E + te12 = 0 + 7 = 7 days
T3E = T2E + te23 = 7 + 8 = 15 days
T4E = T2E + te24 = 7 + 6.17 = 13.17 days
Event-5 is reached from two paths and shall have two values of T5E.
Which route shall give correct value of T5E? This is discussed as below:
(i) T5E = T2E + te25 = 7 + 11.33 = 18.33 days (Path 1-2-5) Which one is the
(ii) T5E = T3E + te35 = 15 + 5 = 20 days (Path 1-2-3-5) correct value of T5E?
92 Project Planning and Management with CPM & PERT
Event-8 is reached from four routes. Which route shall govern the
correct value of T8E shall be discussed as hereunder:
If T8E is taken as 34.17 days → All the activities along Route-1 and
Route-4 have not been accomplished.
If T8E is taken as 37.83 days → All the activities along Route-1 have not
been accomplished.
If T8E is taken as 38.83 days → All the activities along all the possible
routes reaching event-8 have been accomplished.
Therefore, T8E= 38.83 days. Note that it is the highest of the values
along the four possible routes.
5.2.1 General Rule for Evaluating Earliest Expected Time (TE): With
the discussion and calculations as above we conclude that for a simple
network value of TE for the events shall be derived by the following formula:
TE (successor event) = T
E (predecessor event) + te (activity connecting
the events)
Earliest Expected Time (TE) and Latest Allowable Occurrence Time 93
If predecessor event is ‘i’ and successor event is ‘j’ and they are
connected by an activity i-j, earliest expected time for the successor event
shall be calculated by the Equation 5.1:
i1 tei1 j
tei2 j j
i j i2
ij
te
j i ij
tei3 j j i
T E = Max of (T E + te )
ij
T E = T E + te i3
Fig. 5.3
Table 5.1
3 6 6 8 9 07.83 22.83
4 7 11 14 16 13.83 27
5 8 12 14 17 14.17 34.17 Higher value
6 8 15 16 17 16 38.83 is
The network has two significant points i.e. event-5 and event-8. Event-5
can be reached from two paths and preceding event to it are event-2 and
event-3. Higher of the two TE values shall be T5E. This is mentioned in the
‘Remark’ column and higher value is shown in bold under the respective
column.
Similarly, event-8 can be reached from four paths and preceding events
to event-8 are event-5, event-6 and event-7. Reason for three preceding
events from four available paths is the convergence of two paths at event-5.
The highest of the TE values from the three paths shall be T8E. This is
mentioned in the ‘Remark’ column and the highest value is shown in bold
under the respective column.
This is the second type of time estimate related to the events in a network.
The object of the planner and project manager shall be to complete the
project on the pre-decided time frame. Planning, organizing, coordinating,
monitoring and control of the project revolve around timely completion of
the project within estimated cost and acceptable quality standards. Latest
occurrence time for an event is the time by which the event must occur in
order to keep the project on schedule. It is denoted by TL.
In the simplest terms, if a project is planned to be completed in a
specific time period, say ‘N’ days, but due to various complex ground
conditions, entire team including the client decides that 15 extra days be
given for completing the project. Thus, the project must be completed in (N
+ 15) days. As per the original planning (i.e. when ‘N’ days were planned),
there would been specific dates for accomplishment or occurrence of
various events. However, due to change in schedule to (N + 15) days, a
margin or allowance of 15 days is permissible which implies that some or all
the events may have slippage in their individual occurrence time in such a
way that sum of all those slippages doesn’t exceed 15 days. It will put a cap
Earliest Expected Time (TE) and Latest Allowable Occurrence Time 95
Fig. 5.4
work. This value is equal to TjL – teij. Thus, latest event time for
1
event-i is TiL = 2 days.
2
Thus, in this case as a general rule, we noticed that TiL = TjL – teij.
Answer to such query is got from the latest occurrence time of the
event. In the instant case, latest occurrence time for event-k is TkL= 17.67
days. Also, the earliest time by which the event-k could have occurred is TkE
= 15.17 days. Therefore, there is a margin of 2.5 days (17.67 – 15.17 days)
by which the event-k can be delayed and that is the tolerable level if the
project has to be completed as per contractual obligation time of 30 days. In
other words, after the occurrence of the event-j, maximum delay that can
be tolerated is 2.5 days.
Similar analysis may be carried out for other activities and events.
It is however, not necessary that only one activity shall have such
possibility of time margin. In fact, the total available time margin may be
distributed among the requisite events in such a manner that sum of the
tolerable time of individual events doesn’t exceed the overall available time
margin.
Earliest Expected Time (TE) and Latest Allowable Occurrence Time 97
0 3 6 9 12 15 18 21 24 27 30
i j k l
TE = 0 TE = 7 T E = 15.17 T E = 27.50
5-7-9 7-8-10 10-12-16
A i j k l
ij jk kl
te = 7 te = 8.17 te = 12.33
i j j j
TL = 0 T L = 9.5 T K = 17.67 T L = 30
B i j k l
ij jk kl
te = 7 te = 8.17 te = 12.33
TiL = 2.5 TjL = 9.5 TjL = 17.67 TlL = 30
C i j k l
TiL = 1 j
TL = 9 TkL = 17.67 TlL = 30
D i j k l
Fig. 5.5
4 4
T E = 13 T L = 13
4
4-6-8 4-5-6
5
1
TE=0 2
TE=4 45 T E = 18
24
te = 6 te = 5
3-4-5 34 5
1 2 te = 3
12
te = 4 2-3-4 5
1
2
TL=4 5-7-9 T L = 18
TL=0 5-6-7
35
23
te = 6 te = 7
3
3 3
T E = 10 T L = 10
Fig. 5.6
In this network, there are two events (event-2 and event-3) from where
more than one activity is emerging. Thus, while calculating TL values for
these events, one has to be careful that will be clear as we proceed further.
In this figure, three time estimates are shown above the activity arrows
and expected values are shown below the activity arrows. TE values of the
events are shown near the respective event circles. TE value for the end
event (event-5) is 18 days and for the purpose of calculations and unless
otherwise specified, this value is considered as the latest occurrence time
(T5L) for the end event and that is taken as contractual obligation time.
Thus, T5L= 18 days.
Activity 4-5 takes 5 days (te45 = 5) for its completion, therefore, T4L shall
be = T5L – te45= 13 days from the equation TiL = TjL – teij.
Event-3 is the predecessor event to two events i.e. event-4 and event-5.
Therefore, T3L shall have two values i.e. one by considering path 3-5 and
another one by following path 3-4. Evidently, value of T3L shall be guided by
these both subsequent events and paths as below:
Path 3-5: T3L = T5L – te35 = 18 – 7 = 11 days
Path 3-4: T3L = T4L – te34 = 13 – 3 = 10 days
If T3L is taken as 11 days: This means that if event-5 cannot occur
later than 18 days from the start of the project, then event-3 cannot occur
later than 11 days from the start of the project as activity 3-5 takes 7 days.
If T3L is taken as 10 days: This implies that if event-4 cannot occur
later than13 days from the start of the project, then event-3 cannot occur
later than 10 days from the start of the project as activity 3-4 takes 3 days.
It is important to note that event-4 and event-5 can occur only once the
event-3 has occurred. This also implies that event-3 cannot be stretched
Earliest Expected Time (TE) and Latest Allowable Occurrence Time 99
beyond 10 days. Evidently, smaller of the T3L values derived above shall
fulfill this requirement. Therefore, T3L = 10 days.
Similarly, event-3 and event-4 are the subsequent to event-2. Therefore,
T L shall be paths 2-4 and 2-3 as hereunder:
2
T4L = 13
2
TL=7 4
4-5-6
2 4-6-8
te = 6 te = 5
3-4-5 5
1 2
te = 4 2-3-4 5
2 T L = 18
T1L = 0 TL=4 5-6-7 5-7-9
te = 3
te = 6 7
te =
T3L = 10 3 3 3
T L = 11
Fig. 5.7
Fig. 5.7 is the modified version of Fig. 5.6 to derive the value of TL for
event-2 and event-3 which have two TL values.
100 Project Planning and Management with CPM & PERT
Fig. 5.8
With the given te values, earliest expected time of the events shall be
calculated. However, since our focus is on calculating TL values, earliest
expected time of the end event only has been shown in the network i.e.
T10E = 21. Stipulated time or the contractual obligation time has not been
mentioned in this case, therefore, under such situation, earliest expected
time of the end event is considered as the latest occurrence time for the
end event i.e. T10L= 21= Ts=T10E. With this we will derive TL values for
different events of this network. Wherever, there is more than one activity
emerging out from an event, latest event time shall be calculated by the
following equation:
TiL = Minimum of (TjL – teij)
For event-9
T9L= T10L – te910 = 21 – 5 = 16
For event-8
T8L= T10L – te810 = 21 – 5 = 16
For event-7
T7L= T9L – te79 = 16 – 4 = 12
For event-6, there are two routes; Path 6-8 & 6-9
102 Project Planning and Management with CPM & PERT
Therefore, T6L = 10
For event-5
T5L= T8L – te58 = 16 – 3 = 13
For event-4
T4L= T7L – te47 = 12 – 5 = 7
For event-3, there are three routes: Path 3-4, 3-5 & 3-6
Path 3-4; T3L = T4L – te34 = 7 – 4 = 3
Minimum of the
Path 3-5; T3L = T5L – te35 = 13 – 8 = 5
values shall be T3L
Path 3-6; T3L = T6L – te36 = 10 – 3 = 7
Therefore, T3L = 3
For event-2
T2L= T5L – te25 = 13 – 5 = 8
For event-1, there are two routes: Path 1-2 & 1-3
Path 1-2; T1L = T2L – te12 = 8 – 4 = 4 Minimum of the
Path 1-3; T L = T L – te
1 3 13
= 3 – 3 = 0 values shall be T1L
Therefore, T1L = 0
Table 5.2
Activity (i-j) toij tmij tpij teij TjE@ TjE TiL TjL
Suc- Prede-
cessor cessor
Event (j) Event (i)
(1) (2) (3) (4) (5) (6) (7) (8) (9) (10)
10 9 3 5 7 5 21 21 16 21
10 8 4 5 6 5 19 21 16 21
9 7 2 4 6 4 16 16 12 16
9 6 4 6 8 6 12 16 10 16
8 6 0 0 0 0 6 14 16 16
8 5 2 3 4 3 14 14 13 16
7 4 3 5 7 5 12 12 7 12
6 3 2 3 4 3 6 6 7* 10
5 3 7 8 9 8 11 11 5* 13
5 2 4 5 6 5 9 11 8 13
4 3 3 4 5 4 7 7 3* 7
3 1 2 3 4 3 3 3 0 3
2 1 3 4 5 4 4 4 4 8
Note: TjE@ represents Earliest Expected Time of the event from each path
according to the rule.
TjE shows the appropriate value for Earliest Expected Time and derived from
the equation TjE = Maximum of (TiE + teij)
For easy understanding, entry for column (7) i.e. TjE@ has been
done from the bottom of the table. For any event which has more than
one predecessor event, the highest of the values has been considered
and shown in bold numbers. For example, event-5 is reached from two
predecessor events i.e. event-2 and event-3. From event-2, value of
T5E = 9, whereas, from event-3 we get T5E = 11. The maximum of them is
11 that is shown in bold letters.
To calculate TiL values i.e. column (9), we proceed from the top of the
table. As stipulated obligation time Ts in this case is 21 days, so, the latest
occurrence time for the event-9 shall be T9L = 21 – 5 = 16. Similarly, T8L =
21 – 5 = 16. (Note – time duration of activity 8-10 and 9-10 is 5 days each).
It is worth noting that in the tabular form, the entries under TiL refer to
predecessor event and calculation for the same is governed by the following
equation:
104 Project Planning and Management with CPM & PERT
Fig. 5.9
Fig. 5.9 has been derived from Fig. 5.8 with the difference that
it shows both TE and TL values of the events. Three time estimates over
the arrows have been deliberately removed and only te i.e. expected time
value as derived from the three time estimates has been shown. This is
done to make the network diagram easily readable and understandable.
It may be seen that the results derived in Table 5.2 are reflected in
Fig. 5.9.
Earliest Expected Time (TE) and Latest Allowable Occurrence Time 105
From Table 5.2, it may be seen that wherever, there is more than one
value for TE, they have been covered through a bracket. The highest of the
values has been considered as TE and the same has been marked in bold.
Similarly, for TL, whenever, there is more than one value, all those
have been covered through a bracket and the lowest of the values has
been considered as TL and marked in bold. However, for event-3 there are
three values of TL i.e. 7, 5 & 3 but as all these three values could not be
accommodated one after the other in a sequence, thus could not be covered
through a bracket, and therefore, these values are marked with * and the
lowest value is shown in bold with * mark.
Questions
1. Is it possible to analyze a network in totality by following either forward
pass or backward pass method? How?
2. Briefly answer the following:
(i) How can an existing bar chart be modified to depict the project
progress made?
(ii) Differentiate between the terms ‘Activity’ and ‘Dummy’.
(iii) Differentiate between ‘Forward Planning’ and ‘Backward Planning’
for network construction.
(iv) Differentiate between ‘Optimistic time estimate’ and ‘Pessimistic
time estimate. (ESE- 2017 : 5 x 4 = 20 marks)
Problems
1. Information on the activities required for a medium size Civil
Engineering project is as follows:
Name of A B C D E F G H I J K
Activity
Node No. 1-2 1-3 1-4 2-5 3-5 3-6 3-7 4-6 5-7 6-8 7-8
Duration in 02 07 08 03 06 10 04 06 02 05 06
(months)
Draw the network and calculate the followings:
(i) Earliest and latest event time.
(ii) Earliest and latest start time
(iii) Earliest and latest finish time.
(iv) Critical path (ESE-2009 : 20 marks)
2. The three time estimates for activities of a network are indicated as
below. Number the events of the network and Calculate
(i) The average or expected time te and variance for each activity.
(ii) Earliest expected time and latest occurrence time for each event .
(iii) Make the entries in a tabular form.
Earliest Expected Time (TE) and Latest Allowable Occurrence Time 107
3-5-8
4-6-9
2-4-5 1-2-3
0-0-0
2-3-4
6-8-10 3-4-5
2-4-6
5-7-9 2-3-4
0-0-0
3-4-7
3-4-6
2-4-6
6
Slack Value, Critical Path and
Probability of Completion
6.1 Introduction
The idea behind a network analysis is to have a systematic flow of events and
activities duly maintaining their interdependence and interrelationships
in a logical manner in order to complete the given work within stipulated
time period. To achieve this, it is necessary to identify the critical path
for the network. Critical path in the PERT network is identified through
slack values of the events and therefore, before coming to critical path, it is
necessary to understand slack value and procedure for its calculation.
6.2 Slack
E
i i
TE TE
i ij
j
te
TiL TiL
Fig. 6.1
TE = 7
30
TL = 10
te = 3 te = 4 TE = 14
TE = 0 TE = 4 TE = 17
10 20 50 60
te = 4 te = 10 te = 3
TL = 0 TL = 4 TL = 14 TL = 17
te = 6 TE = 10
te = 5
40
TL = 12
Fig. 6.2
To calculate slack time for the events, it is imperative to first derive the
earliest expected time (TE) and latest occurrence time (TL) of each event
in the network.
Forward Pass Method:
110
Table 6.1
Table 6.2
Tables 6.1 and 6.2 show slack time for event-30 as 3 days and for
event-40 as 2 days. This signifies that there is 3 days’ play/margin/space
available for the event-30. Similarly, for event-40, there is a play/margin/
space of 2 days.
These both slack values may be understood by Fig. 6.3:
TE = 7 TL = 10
30 30
te = 3 TE = 4
Slack = 3 days
TE = 0 TE = 4 TE = 17
TE = 14
10 20 50 60
te = 4 te = 10 te = 3
TL = 0 TL = 4 TL = 14
TL = 17
TE = 10 TL = 12
40 40
te = 6 te = 5
0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17
From Fig. 6.3, one can derive two interpretations from the slack values
so achieved:
(i) Earliest expected time for event-30 is 7 days. However, even if this
event occurs on completion of 10th day (latest occurrence time), the
overall schedule completion time of the project shall not change.
(ii) Earliest expected time for event-40 is 10 days. However, even if this
event occurs on completion of 12 days (latest occurrence time),
overall scheduled completion time of the project shall not change.
These interpretations can also be understood as below:
(a) Once the event-30 has occurred at its earliest expected time,
activity 30-50 can be delayed by 3 days.
(b) Once the event-40 has occurred at its earliest expected time,
activity 40-60 can be delayed by 2 days.
Slack Value, Critical Path and Probability of Completion 113
Slack values of the events have been shown through a dark arrow
The crux is that slack value of an event is the free time available within
which the event occurrence time or its subsequent activity’s time can be
varied without affecting the total completion time of the project.
While drawing the time scale version of a network, as far as possible,
efforts must be made to ensure that critical activities are placed in one line.
In this case, events 10, 20, 50 and 60 have slack value = 0 as TE and TL values
are equal for the individual event. These are therefore critical activities and
placed in one line for easy understanding and better appreciation.
Critical path is the route that takes the maximum time for completion of
the project. Evidently, it is the longest route in the network diagram for
successful implementation of the project. Ideally, the events falling in the
critical path must have zero slack values. However, if permitting slack to
critical events is unavoidable, then it should be the minimum along the
critical path.
In the network shown in Fig. 6.2 the entire project can be accomplished
through three paths:
Table 6.3
This table shows Path-2 as the longest path and events along this path
have zero slack values. These events having zero slack values are termed as
critical events and the path that is the longest and has critical events in it is
called as critical path. Thus, Path-2 is the critical path for this network and
has been shown with thick dark line.
114 Project Planning and Management with CPM & PERT
TE = 7
30
TL = 10
te = 3 te = 4
TE = 0 TE = 4 TE = 14 TE = 17
10 20 50 60
te = 4 te = 10 te = 3
TL = 0 TL = 4 TL = 14 TL = 17
te = 6 TE = 10
te = 5
40
TL = 12
Fig. 6.4
TE = 7
30
TL = 10
te = 4
TE = 0 te = 3 TE = 14
TE = 4 TE = 17
10 20 50 60
te = 4 te = 10 te = 3
TL = 0 TL = 4 TL = 14 TL = 17
te = 6 TE = 10
te = 5
40
TL = 10
Fig. 6.5
Slack Value, Critical Path and Probability of Completion 115
Table 6.4
To get familiar with critical path, certain more examples will be taken.
Example 6.2: For the network shown in Fig. 6.6 below, find the slack
values for events and critical path for the network.
TE = 6
TE = 2
40
20 te = 4
TL = 9
S=3
TL = 3 te = 9
S=1 te = 5
TE = 0 TE = 14 TE = 18
te = 2
10 te = 3 50 60
te = 4
TL = 0 TL = 14 TL = 18
S=0 S=0 S=0
TE = 6 te = 8
te = 6
te = 10
30
TL = 6
S=0
Fig. 6.6
Table 6.5
116
Events along the Path 10-30-50-60 have zero slack values, thus, those
are critical events. Also, this path is the longest path to complete the project
and thus, it is critical path. It may be noted that although the events along
the path 10-30-60 also have zero slack values, but this is not the longest
path, and thus, it is not the critical path. Table 6.6 shows various paths and
critical path for this network.
Table 6.6
Table 6.7
Solution:
TE = 24 TE = 26 TE = 27
S=4 S=4 S=4
50 70 90
TL = 28 TL = 30 TL = 31
TE = 0 TE = 1 TE = 3 TE = 15 TE = 25 TE = 28 TE = 31 TE = 32
10 20 30 40 60 80 100 110
1 2 12 10 3 3 1
TL = 0 TL = 1 TL = 3 TL = 15 TL = 25 TL = 28 TL = 31 TL = 32
S=0 S=0 S=0 S=0 S=0 S=0 S=0 S=0
TE = 4
TL = 4 TE = 10
S=0 2 6 TL = 10
te = 6 S=0
TE = 14
TL = 13 te = 3
te = 4
TE = 0 TE = 11 S=1
TL = 1 1 TL = 10 5 7 9
S=1 S=1 te =3 te =6
TE = 22
te = 3 TL = 21
te = 6 te = 2 te = 5 S=1
TE = 5 3 4 8 TE = 17
TL = 4 te = 3 te = 6
TL = 16
S=1 TE = 8
S=1
TL = 8
S=0
Fig. 6.8
Solution: In this network, values of TE, TL and slack (s) have been
shown against each event.
From the definition, path joining the events having minimum slack
values that corresponds to the maximum time for completion shall be the
critical path for the network. In this case minimum slack value is (–)1 and
corresponds to the events 1, 3, 5, 7, 8 and 9. Therefore, path 1-3-5-7-8-9 is
the critical path.
Next minimum slack value is zero and corresponds to events 2, 4 and
6. Therefore, paths passing through these events shall be sub-critical or
semi-critical. Accordingly, paths 1-2-6-7 and 3-4-5 shall be sub-critical
or semi-critical path(s). For identification, sub-critical path(s) have been
shown with one firm and one dotted line.
While defining the critical path for a network, minimum slack value for the
events is the focus of attention. One may come across negative slack values
for certain events (slack < 0) as in Fig. 6.8 above. In simple terms, negative
slack value of an event indicates TL< TE. This reveals that the said event is
behind the schedule by the time period equal to its slack value. Any further
delay in the said event(s) will cause more delay in project delivery time.
120 Project Planning and Management with CPM & PERT
CPM and PERT analysis are two closely related operation and research
techniques that make heavy use of networks to help plan and display the
coordination of all the activities. They also normally use a software package
to deal with all the data needed to develop schedule information and then
to monitor the progress of the project. The original version of PERT and
CPM had some important differences. However, they also had a great deal
in common, and the two techniques have gradually merged further over
the years. In fact, today’s software packages often include all the important
options from both original versions. Consequently, practitioners now
commonly use the two names interchangeably, or combine them into the
singly acronym PERT/CPM. Looking at the basic concepts of PERT and
CPM, they differ mainly on the following points:
(i) In CPM, time estimates for completion of activities are with fair
degree of accuracy, while in PERT system, time estimates are not
so accurate and finite.
(ii) In CPM, cost optimization is given prime importance. The time
duration for completion depends on this cost optimization.
The cost is not directly proportional to time, rather the cost is
minimum corresponding to a certain optimum time duration
and cost increases if the time duration is either increased or
decreased.
On the other hand, in PERT system, it is assumed that cost varies
directly with time. Attention is therefore paid to minimize the
time so that minimum cost is achieved.
Thus, in CPM, cost is direct controlling factor whereas, in PERT,
time is controlling factor.
(iii) Critical path in CPM plays an important role in planning and
scheduling. A critical path, time wise is the longest path in
the network. A critical path is the one passing through critical
activities which is determined on the basis of minimum float for
each activity.
Critical path in PERT is the path that joins the critical events,
which is determined on the basis of slack value at each event.
Slack Value, Critical Path and Probability of Completion 121
to + 4tm + tp
te =
6
Q
R
Probability
function
S
P T
to te X
Time elapsed
Probability
function
S
P T
TE TS
Modal value
Time elapsed
Fig. 6.10: Probability function for the entire Project (Normal distribution pattern)
Slack Value, Critical Path and Probability of Completion 123
Probability
function
Fig. 6.11
In this graph, λ and σ are parameters such that σ > 0 and λ lies between
+∞ to –∞. To have better appreciation of this curve, we may assume λ = 0
i.e., this denotes central point and values on its right side shall be +σ, + 2σ,
+ 3σ whereas on its left side values will be –σ, –2σ, –3σ respectively.
Having established this distribution of the available data, the task
becomes simpler. In Fig. 6.10, TE corresponds to the mean value and area
covered up to this value is 50% of the total area under PQT. When this Fig.
6.10 is superimposed over Fig. 6.11 i.e. normalized distribution, point ‘S’
may correspond to σ (assuming λ = 0). Thus, ‘S’ is at a distance of σ from
the mean value TE. These distances on either sides of the mean value are
taken in multiples of σ value for calculating the probability of completion of
the project by a pre-set date.
Table 6.8 gives the values of probability corresponding to normal
deviate in terms of multiple of σ and this is used to arrive at the probability
of completion of a project by stipulated time TS.
6.9.2 A
pplication of PERT Proability Table to Network through
Examples
Example 6.5: From the following network diagram, calculate the
probability of completing the project in 29 days.
126 Project Planning and Management with CPM & PERT
TE = 17 TE = 20
5 6
2-3-4
TL = 17 TL = 20
8-9-10
4-5-6 2-4-6
TE = 0 TE = 6 TE = 12 TE = 24 TE = 29
1 2 4 8 9
3-6-9 5-6-7 8-10-12 2-3-4
TL = 0 TL = 6 TL = 12 TL = 26 TL = 29
3-4-5 0-0-0
4-5-6
TE = 10 TE = 18
3 7
7-8-9
TL = 13 TL = 21
Fig. 6.12
σ2 = 1.44
σ for the network = √1.44 = 1.2
Value of TE for the network is 29 days and scheduled completion time is
also taken as TS = 29 days. In this case, TS – TE = 0
TS – TE
Thus, normal deviate ‘z’ = =0
σ
Slack Value, Critical Path and Probability of Completion 127
It implies that earliest expected time and stipulated time divide the
normal distribution curve into two equal halves. From Table 6.8, for normal
deviate of zero value, probability of completing the project in the stipulated
time is 50%.
However, if we take stipulated time for the project completion as TS =
27 days, the entire calculations for the network shall change. The same has
been reflected in Fig. 6.13 network which has been slightly modified from
Fig. 6.12 for better appreciation of the problem.
TE = 17 TE = 20
5 6
2-3-4
TL = 15 TL = 18
6-7-8 8-9-10
4-5-6 2-4-6
TE = 0 TE = 6 TE = 12 TE = 24 TE = 29
1 2 4 8 9
3-6-9 5-6-7 8-10-12 2-3-4
TL = 2 TL = 4 TL = 10 TL = 24 TL = 27
3-4-5 5-6-7
4-5-6 4-5-6
TE = 10 TE = 18
3 7
7-8-9
TL = 11 TL = 19
Fig. 6.13
Critical path in this network remains the same as was in Fig. 6.12 i.e.
1-2-4-5-6-9. Therefore, value of σ for this path also remains the same =
1.2. The probability of completing the project in 27 days shall be calculated
as below:
TS – TE 27 – 29
Normal deviate z = = = –1.67
σ 1.2
From Table 7.1, for normal deviate z = –1.67, probability of completion
within stipulated time period is 4.8%.
Thus, there is 4.8% probability that the project will be completed in 27
days.
Similarly, other probability scenarios can be calculated.
Example 6.6: Probability of the project finishing beyond the earliest
expected time such as 31 days can be derived as below: (assuming that the
critical path remains the same i.e. 1-2-4-5-6-9)
128 Project Planning and Management with CPM & PERT
TS – TE 31 – 29
Normal deviate z = = = 1.67
σ 1.2
From Table 6.8, for normal deviate z = 1.67, probability of completion
within stipulated time period is 95.2%.
Thus, there is 95.2% probability that the project will be completed in
31 days.
Example 6.7: It is desired to calculate the number of days to complete
the said project based on 80% probability. Find out the number of days for
the same.
From Table 6.8, for 80% probability, normal deviate z = 0.8428
TS – TE TS – 29
Normal deviate z = = = 0.8428
σ 1.2
TS = 30.01 days
Thus, there is 80% probability that the project will be completed by
30.01 days.
6.9.3 Probability for Assessing the Risk of Finishing the Project
ahead of or beyond the Expected Duration: From the analysis under
Examples 6.5, 6.6 and 6.7 above, following table is derived:
Table 6.10
S/N TE TS σ z Probability of
completion %
(i) 29 27 1.2 –1.67 4.8
(ii) 29 28 1.2 –0.833 20.83
(iii) 29 29 1.2 0 50
(iv) 29 30.01 1.2 +0.8428 80
iv) 29 31 1.2 +1.67 95.2
Fig. 6.14 shows the normal distribution pattern for these data values.
Fig. 6.15 is the graphical plot of probability versus project duration. This
curve provides the full range of probabilities for assessing the risks of
finishing the project ahead of or beyond the expected duration of 29 days
i.e. earliest expected time.
Slack Value, Critical Path and Probability of Completion 129
Probability
Function
(Not to
scale)
26 27 28 29 30 31 32
Duration in days
Fig. 6.14
100 0
75 25
Probability
of 50 50 Risk
completion
25 75
0 100
0 10 20 30 40 50 60 70 80 90 100
Duration in days
Fig. 6.15: Curve showing full range of probabilities for assessing the risks
TE = 7
3 TE = 10
2-3-4
TL = 9 5
TE = 0 TE = 3 3-4-5 5-6-7 TE = 16
TL = 12
1 2 0-0-0 7
2-3-4 0-0-0
TL = 2 TL = 5 TE = 10 TL = 18 = Ts
TE = 8
4-5-6 3-4-5
6
4
1-2-3
TL = 14
TL = 12
Fig. 6.16
Table 6.11
S/N TE TS σ z Probability of
completion %
(i) 16 14 0.66 –3.03 0
(ii) 16 15 0.66 –1.51 6.60
(iii) 16 16 0.66 0 50
(iv) 16 17 0.66 +1.51 93.40
(iv) 16 18 0.66 +3.03 100
100 0
75 25
Probability
of 50 50 Risk
completion
25 75
0 100
14 15 16 17 18
Duration in days
Fig. 6.17: Curve showing full range of probabilities for assessing the risks
Example 6.9: From the network shown below in Fig. 6.18 find the
probability of completion of the project in 22 days and 27 days respectively.
TE = 7 TE = 11
4 8
3-4-5
TL = 11 TL = 15
1 3 6 10
2-3-4 2-4-6 7-9-11
TL = 2 TL = 6 TL = 10 TL = 22
TE = 14
3-5-7 7 3-5-7
0-0-0
TE = 19
TE = 5 TE = 11 TL = 12
4-5-6 9
2-3-4
2 5
4-6-8 TL = 17
TL = 3 TL = 9
Fig. 6.18
132 Project Planning and Management with CPM & PERT
σ2 = 1.57
σ for the network = √1.57 = 1.25
TS – TE 22 – 24
Normal deviate z = = = –1.6
σ 1.25
From Table 6.8 for normal deviate z = –1.6, probability of finishing the
project in 22 days is about 5.5%.
When TS = 27 days:
For TS = 27 days, critical path remains the same i.e. 1-2-5-7-9-10,
therefore, σ remains the same i.e. 1.25.
TS – TE 24 – 24
Normal deviate z = = = + 2.4
σ 1.25
From Table 6.8 for normal deviate z = + 2.4, probability of finishing
the project in 27 days is about 99.2%.
Questions
1. Draw a comparison between PERT and CPM. (ESE-2005 : 10 marks)
2. Explain various steps involved in development of networks.
(ESE-2006 : 10 marks)
3. Define critical, semi critical, sub-critical and super critical paths in a
network. What is the significance of negative slack value?
Slack Value, Critical Path and Probability of Completion 133
4. What is a milestone chart? How does it differ from a Bar chart? Define
‘Earliest expected time’, ‘Latest allowable time’ and ‘slack’ for a PERT
network. (CS-1999 : 20 marks)
5. (i) Briefly discuss the Fulkerson rule of numbering events in a network.
(ii) What is the different between CPM and PERT in network analysis?
(CS-2009 : 6 + 6 marks)
6. What is the probability of completing an activity on its expected time te?
7. Which curve path is assumed to be followed by an activity individually
and a project in totality?
8. What is normal deviate and how it helps in finding the completion time
for a project?
9. What do you understand by a standardized normal curve?
10. While calculating the probability of finishing a project within the
scheduled time why only critical path activities are considered?
11. Why it is necessary to standardize the random curve obtained from a
network? How it is done?
12. Earliest expected time for a project is derived as TE. However, while
calculating the probability of completing the project within TE one gets
50% probability. How do you explain this statement?
13. If the stipulated completion date (TS) is ahead of or beyond the earliest
completion time of the project (TE), what effect will be on the critical
path and probability of completion of the project? Explain by an
example.
Problems
1. For the network shown below, find critical path and slacks for various
events, if the scheduled date of completion of the project in 36 days.
(CS-1996 : 20 marks)
3
tE = 12
tE = 8
tE = 3
1 2 4 7 8
tE = 5 tE = 9 tE = 12 tE = 5
tE = 4 tE = 2
tE = 10
5 6
tE = 8
134 Project Planning and Management with CPM & PERT
2. (a) Define ‘slack’. What does negative slack indicate in PERT network
analysis?
(b) The network shown in the figure below has the estimated duration
for each activity marked. Determine the total float for each activity
and establish the critical path.
E
2 t=5 6
A F
t=3 t=6 I t=1
B G
1 3 5
t=4 t=4
D t=3 H
C
t=1
t = 14
4
(ESE-1996 : 5 + 25 = 30 marks)
3. A building project comprises of seven activities and the relevant date is
given below:
Estimated Duration (days)
Activity Optimistic Most likely Pessimistic
Time time time
1-2 1 1 7
1-3 1 4 7
1-4 2 2 6
2-5 1 1 1
3-5 2 5 14
4-6 2 5 8
5-6 3 6 15
(i) Develop the network and identify the critical path.
(ii) Identify float and slack.
(iii) Calculate variance for each activity.
(iv) Calculate standard deviation of the project. (CS-2009 : 14 marks)
4. For a network as shown below, values of the expected time (in days) for
various activities have been shown along the arrows. If the scheduled
Slack Value, Critical Path and Probability of Completion 135
completion time of the project is 32 days, determine the slack time for
each event and identify the critical path and sub-critical path(s). Enter
the values in a tabular form.
tE = 9
2 4
tE = 6
tE = 0 tE = 8
1 6
tE = 12
tE = 5
tE = 6
tE = 9
3 5
5. For the network shown in figure below, three time estimates are shown
against each activity. Number the events and calculate the earliest
expected time for the project. Calculate earliest expected time and
latest occurrence time for each event and mark the critical path.
2-3-4
4-5-6
2-3-4
2-4-6
7-8-9 3-5-7
3-4-5 1-2-3
3-4-5
4-6-8
Draw the network and determine the probability of completing the job
in 35 days. (ESE–1995 : 15 marks)
9. A project is expected to take 20 months along the critical path having a
standard deviation of 2.5 months. What is the probability of completing
the project within (i) 20 months (ii) 25 months and (iii) 17.5 months?
The probability percentage for different values of probability factor is:
15.87% for –1; 50% for 0; 97.72 % for +2. (CS-1999 : 20 marks)
Slack Value, Critical Path and Probability of Completion 137
3-5-7
2 5 5-7-10
2-4-6
6
1 2-5-8
0-0-0
2-3-5
3-4-6
3-5-8 4
3
7
Project Time-Cost Trade Off
and Updating
7.1 Introduction
Time, cost and quality are the basic ingredients of a project and form the
three vertices of the project ‘Iron Triangle’ as shown in Fig. 8.1. Therefore,
completion of a project on time, on cost and with acceptable quality
standards has remained the basic principle to determine its success or
failure.
Cost
PROJECT
Time Quality
Despite all such problems, time-cost trade off has become the necessity
of the construction industry and forms one of the most important topics in
project management. The activity duration can be reduced by one of the
following actions:
The iron triangle shown in Fig. 7.1 is an equilateral triangle having three
vertices as time, cost and quality. It shows that change in any one of the
ingredients has corresponding impact on the remaining two ingredients. If
one goes through the evolution phases of a project; schedule and budgeted
cost were the initial two basic components of a project. Therefore, for the
purpose of this study i.e. project cost and time analysis, we will concentrate
mainly on two ingredients i.e. time and cost for which there are nine possible
combinations as below:
Such cases are rare, but a look at following example is worth noting:
Option-1: Excavation for a boundary wall is required to be done
wherein 12 labourers and 01 excavating machine complete the excavation
in 10 days. The rates for them are:
Labour rate per day ` 500
Machine rate per day ` 7000
Cost for excavation per day = 12 × 500 + 01 × 7000 = `13,000
Cost of excavation for 10 days = 10 × 13,000 = `130,000 →Basic cost
Now, let there is a requirement to complete the excavation work in 8
days. To achieve this, project manager will have to deploy extra manpower
and machinery. He will look into following options:
Option-2: Increase the manpower: This can be calculated by
simple mathematics.
Labourers Machine Days
12 01 10
A 01 8
A/12 = 10/8
A = 15
Thus, 15 labours and 01 machine will complete the work in 8 days.
The cost for this iteration shall be
Cost per day = 15 × 500 + 1 × 7000 = ` 14500
ost for 8 days = 8 × 14500 = ` 116,000 → This is less than the basic
C
cost.
Option- 3: Decrease the man power and increase machinery inventory:
In this case, PM may reduce manpower to 5 and depute 2 machines
to accomplish the given task in 8 days. Financial implications shall be as
below:
Cost per day = 5 × 500 + 2 × 7000 = ` 16,500
ost for 8 days = 8 × 16500 = ` 132,000 → This is more than the
C
basic cost.
Option- 4: Decrease the manpower to 9, deploy one machine for all 8
days and another one machine with an operator for last 3 days only i.e. 6th,
7th and 8th day (assuming hiring rates for additional machine and operator
are same as for earlier ones).
Project Time-Cost Trade Off and Updating 143
Table 7.1
below the normal value. These special measures might include using
overtime, hiring additional temporary help, hiring additional equipment
and machinery, using special time-saving materials, taking specialist
consultant’s services, etc. Crashing the project refers to crashing a number
of activities with an objective to reduce the overall duration of the project
below its normal value.
The CPM method of time-cost trade off is concerned with determining
how much (if any) to crash each of the activities with an eye to reduce the
anticipated duration of the project to a desired value. The data necessary for
this crashing is derived from the time-cost graph for the said activity. Figure
7.2 A and 7.2 B show typical time – cost graphs. In these figures, the normal
points on time- cost graph for an activity shows the time (duration) and cost
of the activity when it is performed in the normal manner. The crash point
at the other end shows the time and cost when the activity is fully crashed
which means that the activity is fully expedited with no further possibility
of time reduction. As an approximation, CPM assumes that these times and
costs can be reliably predicted without significant uncertainty.
7.3.2 Partial Crashing of the Activity: Project manager based on the
ground data may decide whether to crash an activity to the maximum
level or partially. Crashing the activity to its maximum level if not found
financially viable, partial crashing is resorted to. Such partial crashing of
the activity at any level will give a combination of time and cost that will
lie somewhere on the line segment between the two points i.e. normal and
crash points.
7.3.3 Time and Cost Pattern through Pictorial Representation:
There cannot be any universally accepted time-cost pictorial representation
for a project as it will depend on the client – consultant– contractor trio
as to what priority is fixed for the project and that decides the time-cost
pattern. The general practice however, is that reduction in the activity time
from its normal time shall result in cost escalation and that, time for an
activity cannot be curtailed beyond a certain limit due to inherent practical
necessity. A typical time-cost relationship for an activity is drawn in the Fig.
7.2 C below:
Project Time-Cost Trade Off and Updating 145
Crash Crash
Cost D
Activity cost
Normal Normal
cost C
B A
Activity duration
Fig. 7.2(a)
Crash
Crash
Cost D
Activity
cost
Normal Normal
cost C
B A
Fig. 7.2(b)
146 Project Planning and Management with CPM & PERT
Limit of analysis
Maximum trade off Point
In these figures, normal time for the activity is ‘A’ and corresponding
cost for it is ‘C’. However, if the activity is to be expedited for its completion
by time ‘B’ (crash time), cost escalates from ‘C’ to ‘D’. It may also be noted
that the activity cannot be crashed further since cost of further crashing
shall tend towards infinity and also, certain minimum time is essentially
required for physical completion of the activity. Therefore, further crashing
of the activity time shall be a futile effort. Another interesting point of this
relationship is that if the time for completion of this activity is stretched
beyond ‘A’, there is no significant reduction in its cost and consequently,
such an effort shall also prove to be futile. Cost corresponding to normal
time is called normal cost whereas the cost corresponding to crash time is
called crash cost.
7.3.4 Pattern of Time-Cost Graph-curve Linear, Straight Line or
Segmented: In Fig. 7.2A and 7.2B above, straight line and curve linear
approximation of time-cost pattern have been shown for explaining the
typical interrelationship between these two ingredients of a project. However,
the pattern if drawn on a graph, this relationship may be approximated to a
straight line or at times to various segments of linear relationship as shown
in Fig. 7.3A, 7.3B, 7.4A and 7.4B. It is up to the project manager as to which
pattern he assumes as the most probable approximation for the project
under consideration.
Project Time-Cost Trade Off and Updating 147
Crash A
Crash A
Cost B
Cost
C
B D
Normal Normal
E
Time Time
Fig. 7.3 A Fig. 7.3 B
Fig. 7.3(a) Fig. 7.3(b)
Crash A
A
Crash
Cost
Cost
B B
Normal
Normal C
Cost slope is the rate of increase in the cost of the activity per unit
decrease in time. Steeper cost slope means steeper rise in the cost per unit
decrease in time.
148 Project Planning and Management with CPM & PERT
In Figures 7.3A, 7.3B, 7.4A and 7.4B, an effort has been made to show
different time-cost graph possibilities which may be encountered by the
project manager. If linear pattern is followed as in Figure 7.3A and 7.3B,
there is option either to take a single line slope or slope of the different
segments, the choice rests with the observer who is either managing the
project or advising the management of the project. Taking a single line slope
is simple, easier and straight forward approach to expeditiously arrive at
the solution. Segmented approach due to its very nature is little difficult,
tedious and time consuming wherein the decision delivery may not be
as prompt as in the case of a non segmented approach. Evidently, single
line slope approach is too rough approximation but speedier one whereas,
segmented approximation might be more accurate, but it definitely makes
calculations more involved. The same logic applies to Figure 7.4A and 7.4B
depicting single line slope and segmented slope for a non-linear time-cost
graph.
Practically, use of a single cost slope or a multiple cost slope shall
depend how non-linear is the cost-time curve. Additionally, it is a matter
of judgment and experience of the project manager to take decision out
of the two available options i.e. between less accurate-but-convenient and
more accurate-but-involved calculations. If the cost slope curve appears as
in Figure 7.4A, a segmented approach shall be more accurate than a single
line slope curve. On the other hand if the cost slope curve is as per Figure
7.4B. a single straight line approximation would be quite satisfactory. Same
analogy shall apply to Figure 7.3A and 7.3B.
Cost forms one of the basic ingredients of a project and represents one of the
three vertices of its iron triangle. The very first question about project, its
conceptualization and feasibility revolves around the cost i.e. funds required
for its implementation. Feasibility Reports (FR), Conceptual Project Reports
(CPR) and Detailed Project Reports (DPR) of various projects do not see the
light of day in the absence of funds required for their implementation. Cost
of a project may be taken as sum total of the amount required for resource
deployment in the form of men, material, machinery and money, interest
to banks for the money borrowed, depreciation of the machinery involved,
possible market escalation and multiple over head charges in addition to
the amount required to meet administrative charges and unforeseen
contingencies. Some of such costs are direct whereas others are indirect
which can be categorized as below:
Project Time-Cost Trade Off and Updating 149
7.4.1 Direct Cost: This is the cost that impacts a project directly and can
be calculated by direct measurement without any ifs and buts. Under this
category shall be:
Direct cost for crashed time duration shall be higher than the one for
normal time duration due to obvious reasons.
7.4.2 Indirect Cost: This is the cost impacting a project indirectly through
known or unknown sources. Some of such costs can be measured through
available known techniques whereas others may be known only once the
amount has actually been spent. In short, indirect costs are the necessary
costs of doing work which cannot be related to a particular activity, and in
some cases cannot be related to a specific project. Following costs fall in this
category:
¾¾ Overhead charges
¾¾ General and administrative charges
¾¾ Amount for insurance and interest payments
¾¾ Depreciation costs
¾¾ Compensation for accidents etc.
Indirect cost for a project shall increase if its time duration increases. In
other words, indirect cost of a project shall reduce if the project completion
time is crashed from its normal time. It is assumed to follow almost a linear
path as shown in Figure 7.5A.
If each activity was scheduled for the duration that resulted in the
minimum direct cost, the time to complete the entire project might be
too long which shall invite substantial penalties or liquidated damages
associated with delayed completion causing huge loss to the organisation.
Therefore, there is necessity of time-cost trade off analysis to shorten the
project duration. This can be done by selecting certain activities on the
critical path to shorten their duration.
Looking at the typical cost-time relationship of a project in Figures 7.2,
7.3 and 7.4, it is noticed that crashing the activity causes cost escalation.
150 Project Planning and Management with CPM & PERT
Total Cost
Cost
Cost Direct
Indirect Cost
Cost Indirect
Cost
(v) Reduce the duration of the critical activities with least cost
slope until its crash duration is reached or until the critical path
changes.
(vi) When multiple critical paths are involved, the activity(ies) to
be shortened is determined by comparing the cost slope of the
activity (if any),that lies on all the critical paths with the sum of
cost slope for a group of activities, each of them lying on one of
the critical paths.
(vii) Having shortened a critical path, activities timings and floats
should be adjusted.
(viii) The cost increase due to activity shortening is calculated by cost
slope multiplied by the duration of the time units shortened.
(ix) Continue until no further shortening is possible, and then the
crash point is reached.
(x) The result may be represented graphically by plotting project
completion time against cumulative cost increase. This is the
project direct-cost-time relationship. By adding the indirect cost
of the project to this curve we obtain project-time cost curve. From
this curve, the optimum duration and corresponding minimum
cost of the project is arrived at.
Example 7.1: Table 7.2 below shows the data of a project. It is required
to crash the project duration from its original duration to a final duration
of 110 days. Daily indirect cost is $100. Prepare the crash schedule for it.
Prepare the Time-cost trade off schedule and show the variation of direct
cost, indirect cost and total cost. Find the optimum time for this project?
Table 7.2
A 5
1 120
E
50
D
B 3 30 4
20 C
F
40
60
2
Table 7.3
From Table 7.3, cost slope of each activity is calculated. Both the
crashability and cost slopes are shown in the table. The critical path for
the network is B-C-D-E and project duration is 140 days. Crashing shall be
performed on the critical path activities since crashing on the non- critical
activities shall not bring down the overall project duration.
(b) Duration through path B-C-D-E is also 130 days i.e. critical
path.
The project direct cost increased by 10 × 60 = $ 600
Thus, for project completion time of 130 days:
Direct cost = 48300 + 600 = $ 48900
Indirect cost = 130 × 100 = $ 13000
Step-2: Crash the activity having next higher cost slope than the
one in Step-1
(a) Activity ‘E’ has cost slope of $ 120 which is next to cost slope of
activity ‘D’ considered in Step-1. This activity can be crashed by
10 days. With this crashing project duration along the path B-C-
D-E becomes 120 days. It may be seen that although cost slope of
activity ‘A’ is $ 100 which is less than the slope of the activity ‘E’, yet
it has not been crashed as it doesn’t fall on the critical path.
(b) Duration along the path B-F-E also becomes 120 days.
The project direct cost increased by 10 × 120 = $ 1200
Thus, for project completion time of 120 days:
Direct cost = 48900 + 1200 = $ 50100
Indirect cost = 120 × 100 = $ 12000
Step-3: Crash the activity having next higher cost slope than the
one in Step-2
Still we have to crash 10 days to bring the project completion time to 110
days. Activity ‘B’ has cost slope of $ 200 and it can be crashed by 5 days only.
By crashing ‘B’ by 5 days, time along the path B-C-D-E shall be 115 days.
Similarly, time along the path B-F-E shall also be 115 days. But this crashing
necessitates crashing of activity ‘A’ by 5 days which otherwise becomes the
critical activity with 120 days time for completion of the project. Since
activity ‘A’ has duration of 120 days and it has 10 days’ crashing possibility
under its kitty, therefore, path-A shall also have a completion period of 115
days. Cost of such crashing shall be as below:
Crashing of activity ‘B’ by 5 days @ $ 200 = $ 1000
Crashing of activity ‘A’ by 5 days @ $ 100 = $ 500
Total = $ 1500
The project direct cost increased by $ 1500.
154 Project Planning and Management with CPM & PERT
Table 7.4
80000
70000
Total cost
60000
20000
Indirect cost
10000
0
100 110 120 130 140 150
Fig. 7.7
7.6 T
ime-Scale Version of the Project and Contracting the
Network
Fig. 7.8
156 Project Planning and Management with CPM & PERT
A
120
B C D E
1 2 3 4 5
20 40 20 50
F
60
Fig. 7.9
With this crashing we have now got two critical paths i.e. B-C-D-E with
130 days duration and path B-F-E also with 130 days duration.
Project Time-Cost Trade Off and Updating 157
Step-2: Crash the activity having next higher cost slope than the
one in Step-1
Activity ‘E’ has the next minimum slope @120 and it can be crashed by
10 days. Incidentally, this activity falls on the paths of B-C-D-E and B-C-E
and thus, even after crashing it, there are still two critical paths. By crashing
activity ‘E’ by 10 days, project duration comes down to 120 days.
Cost of crashing activity ‘E’ = 120 × 10 = $ 1200
Thus, direct cost of the project = 48900 + 1200 = $ 50100
Indirect cost = 120 × 100 = $ 12000
It may be noted that now there are three critical paths, B-C-D-E,
B-F-E and path-A all having total duration of 120 days.
A
120
B C D E
1 2 3 4 5
20 40 20 40
F
60
Fig. 7.10
Step-3: Crash the activity having next higher cost slope than the
one in Step-2
Activity ‘B’ has crashability of 5 days and it has the next minimum cost
slope on paths B-C-D-E and B-F-E. With this crashing of activity ‘B’ by 5
days, path-A still require 120 days’ for completion. Therefore, to reduce the
overall project duration it is imperative to crash the path-A also by 5 days.
By crashing activity ‘B’ by 5 days and activity ‘A’ by 5 days, project duration
comes down to 115 days.
Cost of crashing activity ‘B’ = 200 × 5 = $ 1000
Cost of crashing activity ‘A’ = 100 × 5 = $ 500
Total = $ 1500
158 Project Planning and Management with CPM & PERT
A
115
B C D E
1 2 3 4 5
15 40 20 40
F
60
Fig. 7.11
It may be noted that now there are three critical paths, B-C-D-E, B-F-E
and path-A, all having total duration of 115 days.
Step-4: Crash the activity having next higher cost slope than the
one in Step-3 to achieve completion time of 110 days
Since we have to bring overall project duration to 110 days, there is still
a requirement to crash the activities by 5 days. It is important to note that
we have three critical paths all with total duration of 115 days. Therefore,
any effort to bring down the project duration to 110 days on a path shall
have corresponding effect on other two paths.
Thus, activities, ‘A’, ‘C’ and ‘F’ shall be crashed by 5 days each to bring
down project duration to 115 days.
Cost of crashing activity ‘A’ = 100 × 5 = $ 500
Cost of crashing activity ‘C’ = 600 × 5 = $ 3000
Cost of crashing activity ‘F’ = 300 × 5 = $ 1500
Total = $ 5000
Thus, direct cost of the project = 51600 + 5000 = $ 56600
Indirect cost = 110 × 100 = $ 11000
Project Time-Cost Trade Off and Updating 159
A
110
B C D E
1 2 3 4 5
15 35 20 40
F
55
Fig. 7.12
In this Figure 7.12, there are three critical paths all having duration of
110 days. Cost so derived is shown in Table 7.4 and graphically represented
in Figure 7.7.
Table 7.5 shows what actions have been taken and what has been
achieved so far.
Table 7.5
S/N Activity Cost slope Duration Cost of Project
crashed Crashed crashing duration
(days) duration (days)
($)
1 None - - - 140
2 D 60 10 600 130
3 E 120 10 1200 120
4 B+A 200 + 100 5 1500 115
5 C+A+F 600 + 100 + 300 5 5000 110
Total 30 days $ 8300
Table 7.6
Example 7.2: For a project, normal and crash durations for activities
are shown as per Table 7.7 below. Determine the least cost for expediting
the project. Find out its optimum duration. Indirect cost per day is $ 125.
Table 7.7
3
D
B 5 E 23
8 4 23
A 6 G I
1 2 5 7 8
12 20 12
10 15 10
C H
15 13
12 11
F
4 6
5
4
Fig. 7.13
Table 7.8
For the network, A-C-G-I is the critical path and total project duration
is 59 days. Least cost of the project can be determined by progressively
crashing the activities and calculating the overall cost of the project.
Time-scale version of the project
162 Project Planning and Management with CPM & PERT
0 5 10 15 20 25 30 35 40 45 50 55 60
Time - days
D
B
3 E 23N
8N 23C
6C 5N
4C
A C 4 G I
1 2 7 8
12N 15N 5 20N 12N
10C 12C 15C 10C
5N
F
4N
H
6
13N
11C
Fig. 7.14
In Figure 7.14, events 4 and 5 have been kept in one circle for ease
since dummy activity connects them both. Crashability and cost slopes of
the activities have been shown in Table 7.8.
There are four possible paths for completing the project namely:
A-B-D-I (55 days)
A-B-E-G-I (57 days)
A-C-G-I (59 days)
A-C-F-H-I (57 days)
Evidently, critical path in this time-scale version is A-C-G-I and shown
by thick line. Total time for project completion is sum of the activities’
durations along the critical path and is equal to 59 days. Normal and
crash durations of the activities have been shown below the arrows. For
ease, normal duration (N) is put as numerator and crash duration (C) as
denominator in italics.
Indirect cost is $ 125 per day.
Total direct cost of the project is $ 36500 and total indirect cost for 59
days is $ 7375.
Total cost of the project = $ 43875
To optimize the project duration, step-by-step approach as below shall
be followed:
Project Time-Cost Trade Off and Updating 163
0 5 10 15 20 25 30 35 40 45 50 55 60
D
B
3 E 23
8 23
6 5
4
A C 4 G I
1 2 7 8
12 15 5 18 12
10 12 15 10
5
F
4
H
6
13
11
Fig. 7.15
Step-2: Crash the activity having next higher cost slope than the
one in Step-1
Activity ‘I’ has the next minimum slope @75 and it can be crashed by
2 days. Incidentally, this activity falls on all the paths and hence its crashing
by 2 days shall have reduction in the project completion time of 2 days from
all the four paths. By crashing activity ‘I’ by 2 days, project duration comes
down to 53 days.
0 5 10 15 20 25 30 35 40 45 50 55 60
D
B
3 E 23
8 23
6 5
4
A C 4 G I
1 2 7 8
12 15 5 18 10
10 12 15 10
5
F
4
H
6
13
11
Fig. 7.16
The project duration now becomes 55 days along the paths A-C-G-I
and A-C-F-H-I. Thus, we have two critical paths with project duration of 55
days as below:
A-B-D-I (53 days)
A-B-E-G-I (53 days)
A-C-G-I (55 days)
A-C-F-H-I (55 days)
With project duration = 55 days, we have:
Cost of crashing activity ‘I’ by 2 days = 75 × 2 = $ 150
Thus, direct cost of the project = 36620 + 150 = $ 36770
Indirect cost = 55 × 125 = $ 6875
Total cost = $ 43645
Project Time-Cost Trade Off and Updating 165
Step-3:Crash the activity having next higher cost slope than the
one in Step-2
Now we can crash either activity ‘A’ (by 2 days) with cost slope
@ 100 or G & H by 2 days each having combined cost slope @ 100 (Cost
slope of ‘G’ = 60 and ‘H’ = 40). However, if the activities ‘G’ & ‘H’ are
chosen, then another critical path is generated. Therefore, activity ‘A’ is
chosen for crashing by 2 days. Project duration comes down to 53 days.
0 5 10 15 20 25 30 35 40 45 50 55 60
D
B
3 E 23
8 23
6 5
4
A C 4 G I
1 2 7 8
10 15 5 18 10
10 12 15 10
5
F
4
H
6
13
11
Fig. 7.17
The project duration now becomes 53 days along the paths A-C-G-I
and A-C-F-H-I. Thus, we have two critical paths with project duration of 53
days as below:
A-B-D-I (51 days)
A-B-E-G-I (51 days)
A-C-G-I (53 days)
A-C-F-H-I (53 days)
With project duration = 53 days, we have:
Cost of crashing activity ‘A’ by 2 days = 100 × 2 = $ 200
Thus, direct cost of the project = 36770 + 200 = $ 36970
Indirect cost = 53 × 125 = $ 6625
Total cost = $ 43595
166 Project Planning and Management with CPM & PERT
Step-4: Crash the activity having next higher cost slope than the
one in Step-3
Now, activities ‘H’ and ‘G’ can be crashed by 2 days each with combined
cost slope @ 100. Time-scale version shall be as below:
0 5 10 15 20 25 30 35 40 45 50 55 60
D
B
3 E 23
8 23
6 5
4
A C 4 G I
1 2 7 8
10 15 5 16 10
10 12 15 10
5
F
4
H
6
11
11
Fig. 7.18
With such crashing, there are three critical paths having completion
time of 51 days as:
A-B-D-I (51 days)
A-B-E-G-I (49 days)
A-C-G-I (51 days)
A-C-F-H-I (51 days)
With project duration = 51 days, we have:
ost of crashing activity ‘H’ & ‘G’ by 2 days = (60+40) × 2 =100 × 2
C
= $ 200
Thus, direct cost of the project = 36970 + 200 = $ 37170
Indirect cost = 51 × 125 = $ 6375
Total cost = $ 43545
Step-5: Crash the activity having next higher cost slope than the
one in Step-4
At this stage, the network has three critical paths. The activities that
can be crashed are as below:
Project Time-Cost Trade Off and Updating 167
Case-1: Activities ‘B’ & ‘C’ by 2 days at a combined cost of $ 350 (i.e.
activity ‘B’ @ $ 150/day and ‘C’ @ $ 200/day).
Case-2: Activities ‘F’, ‘G’ and ‘B’ each by 1day. In this case, ‘F’ will be
crashed @ $ 300/day & ‘G’ will be crashed @ $ 60/day, i.e. combined @ $
360/day. Activity ‘B’ shall be crashed @ $ 150/day. Thus, cost of crashing per
day will be $ 510 which is more than case-1.
Therefore, case-1 is chosen wherein activities ‘B’ & ‘C’ are crashed by
2 days each. Following time scale version is arrived at:
0 5 10 15 20 25 30 35 40 45 50 55 60
D
B
3 E 23
6 23
6 5
4
A C 4 G I
1 2 7 8
10 13 5 16 10
10 12 15 10
5
F
4
H
6
11
11
Fig. 7.19
With such crashing, there are three critical paths having completion
time of 49 days as below
A-B-D-I (49 days)
A-B-E-G-I (47 days)
A-C-G-I (49 days)
A-C-F-H-I (49 days)
With project duration = 49 days, we have:
Cost of crashing activity ‘B’ & ‘C’ by 2 days = 350 × 2 = $ 700
Thus, direct cost of the project = 37170 + 700 = $ 37870
Indirect cost = 49 × 125 = $ 6125
Total cost = $ 43995
168 Project Planning and Management with CPM & PERT
Table 7.9
45500
40500
Total cost
35500
Direct cost
30500
Project 25500
Cost ($)
20500
15500
10500
Indirect cost
5500
48 50 52 54 56 58 60
Fig. 7.20
for the project in hand. Furthermore, crashing the schedule provides the
client with feasible options to choose from. At a glance they can review and
accept a range of time saving alternatives and their cost implications.
Essentially, the critical path in project schedule is the key that will
dictate the current finish date for the project. It will also identify the activities
that need to be reduced or crashed if the project is to be completed sooner
than what was first envisaged. By assessing the associated costs involved in
crashing or reducing the time duration of the critical activities, it is possible
to select the most cost effective crash sequence.
100
Progress ahead of
schedule
-
80
and updated Originally
planned
60 schedule
Progress % Progress behind
40 schedule–
and updated
20
0
0 10 20 30 40 50 60 70 80 90 100 110
T1 T0 T2
Time %
Fig. 7.21
(i) To delay the project and follow the original plan which definitely
is not desirable.
(ii) To maintain the present progress level and prepare fresh schedule
for completion of the project duly incorporating the prevailing
ground conditions and likely expected challenges.
100
80
Progress brought to
Originally planned original schedule by
60 schedule Updating and crashing
Progress %
40
Progress behind
20 schedule
0
0 10 20 30 40 50 60 70 80 90 100
Time %
TE = 11 TE = 13
5 6
2
3
TE = 0 TE = 3 TE = 7 4 TE = 16
1 2 3 7
3 4 5
6 4
4
TE = 9
Fig. 7.23
Project Time-Cost Trade Off and Updating 173
Table 7.10
Table 7.11
TE = 10 TE = 12
5 6
2
2
TE = 0 TE = 3 TE = 7 3 TE = 15
1 2 3 7
3 4 7
7 5
4
TE = 10
Fig. 7.24
TE = 10 TE = 12
60 80
2
2 2
TE = 8 TE = 15
20 100
6
2
5
40
TE = 10
Fig. 7.25
ctity
1-2
2-3
2-4
3-5
3-7
4-7
5-6
6-7
0 2 4 6 8 10 12 14 16
ration in ees
Fig. 7.26
1-2
2-3
ctity
2-4
3-5
3-7
4-7
5-6
6-7
0 2 4 6 8 10 12 14 16
ration in ees
Fig. 7.27
176 Project Planning and Management with CPM & PERT
Questions
1. Define iron triangle of a project. Is it possible to reduce the project cost
with reduction in project duration? Explain with an example.
2. What is cost slope? While crashing the activities in a network, planning
should begin with the activity(ies) having higher or lower cost slope and
why?
3. What are the components involved in direct and indirect costs. Name
a few. Why direct cost is assumed varying in curve-linear pattern and
indirect cost in linear pattern. Draw direct and indirect cost and show
how optimum duration for a project can be determined.
4. What does updating of a project signify?
5. What is the difference between updating and crashing?
Project Time-Cost Trade Off and Updating 177
Problems
1. The following table gives the activities involved in a pipeline project.
Duration and cost data are also given in the table. Indirect cost of the
project shall be taken as @ ` 120 per day. Draw the network diagram
for it. Calculate the minimum cost of the work corresponding to its
duration of 102 days.
Activity Description Prede- Normal Crash- Cost
cessor ability slope
Time Cost (`) (days)
A Preparation - 10 200 - -
B Move on to A 20 200 - -
site
C Obtain pipes A 40 1800 - -
D Obtain valves A 28 500 8 10
E Locate B 8 150 - -
pipelines
F Cut specials C 10 100 4 40
G Excavate E 30 3000 20 180
trench
H Prepare valve C, G 20 2800 12 50
chambers
I Layout joint C, G 24 1000 10 65
pipes
J Fit valves D, F, H 10 200 4 80
K Concrete I 8 520 1 80
anchors
L Backfill J, K 6 420 1 60
M Finish valve J, K 6 200 3 40
chambers
N Test pipelines J, K 6 150 2 70
O Clean up site L, N 4 300 - -
P Leave site M, O 2 180 - -
178 Project Planning and Management with CPM & PERT
2. Cost and other data for a project are given below. Assume an indirect
cost of ` 200 per day, develop the time-cost curve for this project and
determine the minimum project duration. If indirect cost increases to
` 400 per day what will be its impact on the project and also what will
be the optimum duration.
Activity Preceded Cost (`) Duration
by Crash Normal Crash Normal
A - 3900 3600 6 7
B A 6500 5500 3 5
C B 7200 6350 7 9
D B 4900 4700 18 19
E B 2200 2050 9 10
F C 1700 1200 6 8
G F 7200 7200 5 5
H E 10000 9450 10 11
I D, G, H 4700 4500 6 7
3. A simple project is comprised of 3 activities A, B and C in the given
sequence. Possible work duration (D) and the corresponding direct
costs (DC) for three activities are as under:
A B C
D DC D DC D DC
10 14 7 9 10 14
8 15 6 10 9 15
6 18 5 11 7 19
4 22 4 12
Overhead costs are uniformly 1.2 units (of money) per day. Draw a
variable table of Duration vs total cost for the whole project highlighting
the optimal project cost and the respective activity durations at this
total cost. (CS-2005 : 20 marks)
4. A small project consists of the jobs as shown in table below. Calculate
following:
(a) What is the normal length and minimum project length?
(b) Determine the minimum crashing cost schedule (for the work)
from normal length, by each one day for 7 days.
Project Time-Cost Trade Off and Updating 179
2 6
15
6 5
1 4 7
9 12
5
12
9
3
10 5
(d) Activity 4-5 is in progress and shall take another 14 days for
completion.
(e)
Activity 4-7 is in progress and shall take another 8 days for its
completion.
(f) Activity 6-7 has not commenced, but will take 7 days for its
completion.
(g) Activity 5-7 has not yet commenced but will take 6 days for its
completion.
8.1 Introduction
Men
Material
Resources Machinery
Money
Space
15
Resource limited
12
10
Laborers
(numbers)
Time limited
0 1 2 3 4 5 6
Time (days)
Fig. 8.2
Week 1 2 3 4 5 6 7 8 9
Activity
A 10 10
B 8 8 6
C 2 6
D 2 6 10 10 8
E 6 6
Total resource
requirement 10 18 8 10 12 10 10 14 6
Resource 20
unit 15
aggregation 10
chart 5
Fig. 8.3
There are two approaches to deal with resource limits and time
constraints; resource smoothing (or time limited resource scheduling) and
resource levelling (or resource limited scheduling). Essentially, both them
are resource optimization techniques.
Resource smoothing is used when the time constraint takes priority. The
objective is to complete the work by the required date while avoiding peaks
and troughs of resource demand. Thus, resource smoothing is part of the
resource optimization process and has following important features;
Example 8.2: Following Table shows the resources allocation for various
activities. Prepare a network diagram and allocate the resources to ensure
their economical utilization.
188 Project Planning and Management with CPM & PERT
Table 8.2
D A 10 4F + 4L M-Mason
E B 4 2M + 2L
F C 2 2W + 2L
G D 4 2F + 2L
H E, F, G 3 3F + 3L
TE = 3 TE = 13
D
TL = 3 2 5
10
A TL = 13 G
3 4
TE = 0 TE = 4 TE = 17 TE = 20
B E H
1 3 6 7
4 4 3
TL = 0 TL = 13 TL = 17 TL = 20
C F
6 TE = 6 2
4
TL = 15
Fig. 8.4
Resource Allocation 189
Path 1-2-5-6-7 is critical path for this network. Total time for project
completion is 20 days.
2M+2L 2M+2L
3
3F+3L
2F+2L 2F+2L
4F+4L 6 7
1 2 5
2W+2L 2W+2L
4
0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20
days
M 2 2 2 2 2 2 2 2 - - - - - - - - - - - -
L 6 6 6 8 8 8 8 8 4 4 4 4 4 2 2 2 2 3 3 3
F 2 2 2 4 4 4 4 4 4 4 4 4 4 2 2 2 2 3 3 3
W 2 2 2 2 2 2 2 2 - - - - - - - - - - - -
Fig. 8.5
From the above data, histogram for labour and fitter shall be as below:
6
Nos of
labors 4
0
2 4 6 8 10 12 14 16 18 20
Days
Nos 4
of
Fitters
2
0
0 2 4 6 8 10 12 14 16 18 20
Days
In Figure 8-5, routes 1-3-6 and 1-4-6 are non-critical paths. Therefore,
efforts have to be such that, resource smoothing is carried out through
shifting or splitting of the activities within their available slack times. In this
case, resources for activities 3-6 and 4-6 can be shifted as below:
0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20
days
M 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 - - - -
L 4 4 4 6 6 6 6 6 6 6 6 6 6 4 4 4 2 3 3 3
F 2 2 2 4 4 4 4 4 4 4 4 4 4 2 2 2 2 3 3 3
W 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 - - - -
Fig. 8.7
From the above data, histogram for labour shall be as below. However,
the histogram of fitter shall not change since there has not been any shifting
or splitting of this resource.
Resource Allocation 191
Nos of
laborers 4
0
2 4 6 8 10 12 14 16 18 20
engaging 8 regular labourers for the entire project duration shall prove to be
a costly affair. Similarly, engaging only 2 regular labourers and outsourcing
remaining labourers as per requirement shall not be a wise decision, as
availability of the tradesmen may not suit project requirement. In this
case, project manager after resource smoothing has brought down the
peak requirement to 6 (Fig. 8.8) whereas, the minimum requirement still
remains 2 that cannot be reduced further. Thus, PM, to effect economy
in deployment of resources can engage 4 labourers on regular basis and
put additional requirement through outsourcing. In this case, additional
requirement being less that can easily be managed from the market without
affecting project schedule. Resource smoothing, therefore, gives economical
solution to project manager to utilize available resources judiciously.
As can be seen that by following the right process and using a complete
resource management tool, one can make resource allocation easier and
benefit from it in many ways:
(i) Shift the start date of an activity within its slack time.
(ii) Split the activity within its slack time.
Shifting start date of an activity with the same resources will shift the
resources to new time horizon within its float time. Shifting of start date
shall be done such that the resources over the new time horizon are levelled
i.e. lowering of the peaks and troughs. In this technique, resources shall not
be split, rather they are shifted in totality.
Splitting the activity within its float duration is a sort of rearranging the
activity within its float time to create a more level profile of the resources.
Thus, splitting of the activity is done by spreading over longer time horizon
within its float, thereby reducing the peak demand of the resources. In Fig.
8.7 and 8.8 we have carried out splitting of the activities over a larger time
horizon to ensure smoothening of the resources. Fig. 8.9A and 8.9B below
shall make the concept clear.
2M+2L
1 2
4 days 4 days
(float time)
2M+2L
1 2
4 days 4 days
1M+1L 1M+1L
1 2
4 days 4 days
Prepare the network diagram for the project and allocate the resource
(compressors) through resource smoothing and resource levelling
techniques.
Solution: Network diagram for the project is as below:
4
C E
5 9
A B G
1 2 3 6 7
3 2 1
D F
4 2
5
Fig. 8.10
Critical path for this network is A-B-C-E-G and total time required for
its completion is 20 days. Time scale version of the network is shown in Fig.
8.10. (N represents number of resources)
C E
4
5N 4N
A B
1 2 3 6
6N 1N G
6N
7
D F
5
2N 4N
Fig. 8.11
Resource Allocation 195
days 0 1 2 3 4 5 6 7 8 9 10 1 1 12 13 14 15 16 17 18 19 20
N 6 6 6 1 1 7 7 7 7 5 8 8 4 4 4 4 4 4 4 6
9
Resource availability, N=6
0
0 5 10 15 20
C E
4
5N 4N
A B
1 2 3 6
6N 1N G
6N
7
D F
5
2N 4N
Fig. 8.13
196 Project Planning and Management with CPM & PERT
days 0 1 2 3 4 5 6 7 8 9 10 1 1 12 13 14 15 16 17 18 19 20
N 6 6 6 1 1 5 5 5 5 5 6 6 6 6 8 8 4 4 4 6
9
Resource availability,
N=6
6
0
0 5 10 15 20
From Fig. 8.14 it is evident that there is still resource conflict on 15th
and 16th days where compressor requirement is 8 as against availability of
6. This can be resolved by delaying either activity E or F. As F is not on the
critical path, it is prudent to delay this activity such that it starts on day 20.
This however, leads to delaying of activity G as F is its predecessor activity.
The network diagram shall be as below:
C E
4
5N 4N
A B
1 2 3 6 7
6N 1N
G 6N
D F
5 6A
2N 4N
Fig. 8.15
Resource Allocation 197
days 0 1 2 3 4 5 6 7 8 9 10 1 1 12 13 14 15 16 17 18 19 20 21 22
N 6 6 6 1 1 5 5 5 5 5 6 6 6 6 4 4 4 4 4 4 4 6
9
Resource availability, N=6
0
0 5 10 15 20
In Fig. 8.12, there are 6 resource conflicts i.e. on 6th, 7th, 8th & 9th days
and thereafter on 11th & 12th days. By postponing commencement of activity
D to 10th day, we find a smoother distribution of resources wherein, there
is resource conflict on 2 days only i.e. 15th & 16th days (Fig. 8.14). Further
changes in the commencement schedules of activities shall not fetch any
improved results and these 2 resource conflicts i.e. on 11th and 12th days
shall remain if the work is to be completed in 20 days. Time-scale version
of the network and histogram of resource deployment is given hereunder:
198 Project Planning and Management with CPM & PERT
C E
4
5N 4N
A B
1 2 3 6
6N 1N G
6N
7
D F
5
2N 4N
Fig. 8.17
days 0 1 2 3 4 5 6 7 8 9 10 1 1 12 13 14 15 16 17 18 19 20
N 6 6 6 1 1 5 5 5 5 5 6 6 6 6 8 8 4 4 4 6
9
Resource availability,
N=6
6
0
0 5 10 15 20
Questions
1. What are the challenges of resource allocation?
2. Differentiate resource levelling and resource smoothing.
(ESE-2011 : 5 marks)
3. What is Resource Levelling in Construction Projects Management and
how it is different than Resource Loading? (ESE-2018 : 8 marks)
Problems
1. Various activities required for a project are shown in the table below.
Activities’ duration and respective predecessor activities are also shown
in the table. Prepare a network diagram and allocate the resources for
economical utilization.
Activity Predecessor Duration Resources Remark
activity (weeks) required
A - 3 3M
B A 4 2M, 2C
C A 4 4C M, Mason
D A 3 2M C, Carpenter
E B 4 6C
F C 7 2M
G C 2 4C
H D 5 2M, 4C
J F 2 2C
K H 5 2C
L J 2 2M
M E, G, L 4 4M
N K, M 3 4M
9
Tendering and
Contract Management
9.1 Introduction
¾¾ First it is tender
¾¾ Then it is offer
¾¾ Offer + Acceptance = Agreement
¾¾ Agreement + enforceable by law = Contract
RFP is the document that solicits proposal often made through a bidding
process, by an agency or company interested in procurement of a commodity,
service or valuable asset to potential suppliers to submit business proposals.
It outlines the bidding process and contract terms and guides how the bid
should be formulated. RFP are used primarily by government agencies to
get the lowest possible bid.
Technically, an RFP is a formal request in which the issuer asks vendors
to submit proposals demonstrating how a project or service they offer can
address the issuer’s key business needs. Following are the standard steps of
RFP process:
This is the notice to prospective bidders for quoting their rates for the
subject work. It specifies details on all aspects of the proposed work, advance
payment, earnest money deposit, price of tender documents etc. NIT is
brought to the attention of a wide numbers of bidders through tendering
process in the form of advertisement in select newspapers and through
e-tendering on the website of the concerned department. The place and
time for submission of the bid are set forth in the NIT.
In simple terms, EMD is the amount a seller takes to check the earnestness/
seriousness of the bidders in case they are selected as winners. Bidders have
to pay this EMD amount along with the bid response. It is also known as a
binder, token money or good – faith deposit. It is one of the most important
document/instrument which a bidder has to submit along with other
documents. If the party withdraws its tender before the date of validity, such
EMD shall be forfeited. Thus, provision of EMD is meant to dissuade the
frivolous parties getting into the arena.
The format/instrument through which the EMD can be submitted
depends upon the client’s preference. Generally, EMD is sought in the form
of demand draft. However, in high value tenders it can be in the form of
BG. The EMD value can be a fixed amount or a certain percentage of the
bid price for which the bidder is quoting. This varies from 1% to 5%, but
the typical value is 2%. In order to avoid any leakage of information among
the bidders and bring more transparency and efficiency in bidding process,
the clients are asking for a fixed value instead of % age of bid price. EMD
instrument is returned to all unsuccessful bidders once the evaluation is
completed and the contract is signed by the successful bidder. In case of the
successful bidder, EMD is exchanged by Security Deposit (around 10% of
the bid price). However, if the successful bidder refuses to sign the contract
and fails to submit security deposit, the EMD is forfeited.
terms and conditions of the bidding document. In case, the bidder does not
complete the task as per the work order, the client can recover the loss by
forfeiting his security deposit. The most preferred mode of SD is through
Bank Guarantee (BG).Typically, the amount of SD is much higher than the
amount of EMD and generally varies from 5% to 10% of the bid value. It is
the normal practice among the clients to return the EMD and take SD at
the time of signing of the contract.
Or
two works equal to certain %age (as decided by the client) of the
value of the work for which bid has been submitted.
Or
three works equal to certain %age (as decided by the client) of the
value of the work for which bid has been submitted.
(b) Equipment and machinery: Bidder must submit a list of
equipment and machinery either owned by him or his proposed
plan to hire the same for execution of the work.
(c) Financial status of bidder: This is insisted by the project
authorities to know the financial health of the bidder. This is sought
in the form of annual turnover of the firm during previous five years
duly authenticated by a chartered accountant. Another document
to verify the financial status of the bidder is in the form of certified
true copies of the Income Tax return filed by it during last three
assessment years. Additionally, a certificate from the banker is
necessarily required to verify solvency status of the bidder.
(d) Bid capacity: It is the capacity of the bidder that is derived on the
basis of certain pre-decided formula that forms the part of the bid
document. Generally following formula is followed;
Assessed bid capacity = (A × N × M) – B
Where;
‘A’ is the maximum value of construction works executed in any one
year during the last five years, taking into account the completed as
well as works in progress.
‘N’ is number of years prescribed for completion of the work for
which bids have been invited.
‘M’ is taken as 2
‘B’ is the value of existing commitments and ongoing works to be
completed during the period of completion of work for which bids
have been invited.
as bid submission start date (BSSD), bid submission end date (BSED), bid
opening start date (BOSD) and bid opening end date (BOED). Prospective
bidders having read the conditions mentioned in the tender documents
submit their bids for the work. Submission of bids may be in the form of
single-stage one envelope system, single-stage two envelope system or two
stage bidding system as the case may be. These systems are described below:
Having gone through the tendering process and identified the L-1 bidder
duly scrutinizing the authenticity of documents, reasonability of rates and
other parameters prescribed in the bid documents, accepting authority
accepts the contract and a communication to this effect is sent to the
concerned bidder. In other words, award must be made to that responsible
bidder whose bid, conforming to the invitation for the bid, is found to be the
most advantageous to the project authorities/client after considering price
and other factors. After the work is awarded, a formal contract is to be
signed between the parties. The validity of Contract is governed by the law
applicable to Contract.
¾¾ Bilateral contract
¾¾ Multilateral contract
¾¾ Unenforceable contract
9.14.2 Item Rate Contract: This is also known as unit price contract.
In this type of contract, complete BOQ is prepared in advance and that
forms the part of contract document. Bidders are required to quote rates for
individual items of work mentioned in the BOQ. This type of contract is most
commonly used in almost all types of engineering works of the government
departments. It is suitable for the works which can be distinctly split into
various items and quantities for them can be estimated accurately. Working
under this method is detailed but more realistic almost matching to ground
requirements. Payment to the contractor is done after actual measurement
on ground and recording the same in the measurement books (MBs). As a
result time required for payment to contractor is more than that of a lump-
sum contract. Allowance for variations if required during execution stage,
is covered through appropriate clause in the contract document. The main
demerit of this method lies in the fact that contractor may quote high rates
for the items which are likely to increase and less for the items that are
likely to decrease during execution stage.
9.14.3 EPC Contract: “Engineering, Procurement and Construction”
(EPC) is a particular form of contracting arrangement wherein the EPC
Contractor is made responsible for all the activities from design, engineering,
212 Project Planning and Management with CPM & PERT
This model, however, has its own shortcoming i.e. like privatization,
PPPs often increase fees or charges to maximize their profit margins. They
often undermine the public interest in other ways too viz. despite generous
incentives and other privileges from the government, they often compromise
and undermine the State's obligation to regulate in public interest.
214 Project Planning and Management with CPM & PERT
clauses are most commonly seen in conjunction with labour, fuel, steel,
and asphalt costs. It is important to note that escalation clauses are meant
to protect contractors from sharp increases that are beyond the normal
fluctuation of market prices.
9.15.9 Completion of the Contract: A contract is said to have been
completed when both parties have performed their obligations under the
agreement. In another terms the contract is said to have been executed if it
meets the technical specifications and accomplishes specific performance
within the specified time limit and the contracting party makes the payment
in full.
There may be another situation also, wherein substantial performance
is accomplished, but due to conditions beyond the control of either party,
specific performance is impossible but the contracted party has substantially
completed its obligation under the contract and is entitled to receive
payment in full, or with only minor deduction. The contract is said to have
been foreclosed with the mutual consent of both the parties.
Contract may also be regulated by agreement based on the following
conditions:
(i) Waiver: When both parties agree to waive their rights and
obligations at a specific time.
(ii) Substitute Agreement: A new contract is concluded that
replaces the original agreement.
(iii) Novation: Under this, a new party is added to the substituted
agreement.
(iv) Payment in lieu of Performance: In this system, one party
pays a negotiated amount to other party to be released from its
remaining obligations.
(v) Accord and Satisfaction: In this type, one party agrees to
accept a substitution in the obligation of the other.
Questions
1. What is the difference between ‘security deposit’ and ‘mobilization
advance’ in a construction contract? (ESE-2014 : 4 marks)
2. Define the following terms briefly in the context of construction
contracts.
(i) Beta distribution in PERT
(ii) EPC contract
(iii) PPP
(iv) Escalation clause (ESE-2014 : (4 + 2 + 2 + 2) marks)
3. Write brief answers to the following questions (not exceeding 50 words
in each case):
(i) What is ‘escalation’ in the context of construction contracts?
(ii) What is EPF in the context of welfare measures for construction
workers?
(iii) In what kind of construction is a ‘tremie’ used?
(CSE-2017 : 5 × 3 = 15 marks)
3. Explain the different types of contracts adopted in construction.
(ESE-2019 : 20 marks)
Tendering and Contract Management 221
4. Write the full form and very briefly explain the underlined terms in
the following sentences (Not more than 20 words should be written for
each term).
(i) The DPR for the project had to be revised.
(ii) The contractor should provide appropriate PPE to the workers at
site.
(iii) Building bye- laws may permit a different FAR depending on the
use of a building.
(iv) The project is being executed under the PPP scheme.
(v) An adjustment for TDS had to be made in the final bill paid.
(CSE-2016 : 2 × 5 = 10 marks)
5. Explain briefly the highlighted terms in the following sentence (not
more than twenty words).
The contractor and the client agreed to send the matter for arbitration.
OR
The contractor was informed that his plea of force majeure for the
delay in the completion was not acceptable. (ESE-2013 : 5 marks)
6. Details of a construction project comprising of three activities are given
in the following table:
S/N Activity Unit Estimated Estimated Rate of
quantity rate per unit award
1 A M3 5000 1000 850
2 B MT 4500 4000 4200
3 C M 2
7000 5000 4800
Based on the information provided in the table, answer the following
questions:
(i) What should be the cost of the project for which an “approval” is
obtained from the competent authority before proceeding with the
advertisement for the job etc.
(ii) If at a certain point in time, the work done for the activities A, B
and C is 2700, 3000 and 4000 in the corresponding units, what is
the percentage of the financial completion of the project?
(iii) Clearly state the assumption in calculating (ii) above.
(ESE-2014 : 2 + 4 + 2 = 8 marks)
222 Project Planning and Management with CPM & PERT
10.1 Introduction
Construction Equipment
Industry
Loaders Bulldozers
Tankers Conveyors
Slurry
Wheeled
Crawler Pavers Seal
loading
Loader machine
shovels
10.4.1.1 Excavators: These heavy machines consist of a base cabin and a long arm
Construction Equipment and Machinery 227
with a bucket attached at its end. They use a hydraulic system to function. The operator
controls the excavator from the base cabin which is capable of rotating 360 degrees.
on base
The a supporting structure
cabin is placed that maystructure
on a supporting be either
thatwith
may wheels
be eitheror tracks.
with wheelsThese
or
machines
tracks. These are widelyare
machines used in small
widely assmall
used in well as
as well
largeasconstruction project
large construction sites.
project
Their
sites. applications
Their include
applications includemultiple
multiple activities suchasas digging
activities such diggingfor
forfoundation,
foundation,
demolition
demolition of existing
of existing structures,
structures, grading, heavy
grading, landscaping, landscaping, heavy
lifting, mining, lifting,
dredging
mining, dredging etc.
etc.
Operator’s
Operator’s
Cabin
Cabin
Bucket
Bucket
attachment
attachment
Fig.10.1:
Fig. 10.1-Excavator
Excavator
A power
A shovel
power(also known
shovel as stripping
(also knownshovel or electricshovel
as stripping mining shovel) is a bucket
or electric mining
equipped
shovel)excavator machine.
is a bucket This isexcavator
equipped usually electrically
machine. powered and
This is used for
usually digging
electrically
and loading earth
powered and orused
fragmented rock including
for digging mineral extraction.
and loading earth orTechnically,
fragmentedpower
rock
including
shovel mineral
is a type extraction.
of rope cable Technically,
excavator power
wherein digging shovel
arm is is aand
controlled type of rope
powered
bycable excavator
winches and steelwherein digging
ropes, rather arm is controlled
than hydraulics andexcavators.
as in hydraulic powered
by winches
and steel ropes, rather than hydraulics as in hydraulic excavators.
There are various types of excavators in use at construction sites viz. compact
There
excavator, are excavator,
wheeled various types
crawlerof excavators
excavator, in use
drag line at construction
excavator, sites
backhoe loader,
viz. compact
bucket excavator,
wheel excavator, powerwheeled excavator,
shovel, and crawler excavator,
suction excavator. dragareline
Some of them
excavator,
described backhoe
as below; loader, bucket wheel excavator, power shovel, and
suction excavator. Some of them
10.4.1.2 Drag line Excavator: This are described
machine as its
derives below;
name from its basic
characteristic
10.4.1.2 i.e. dragging the
Dragline bucket against
Excavator: Thisthe machine
material to derives
be excavated. This is from
its name a
its basic
heavy characteristic
equipment i.e. dragging
that is generally used for the bucketat against
excavating the material
larger depth. It is used to
be to
excavated. This is a heavy equipment 262 that is generally used for excavating
at larger depth. It is used to excavate earth and load it into haul units,
such as trucks, trailors etc. or to deposit it on spoil banks and embankments
near the place from where it is excavated. Draglines are amongst the largest
mobile equipment that have ever been built on land. They weigh in the
vicinity of 2000 MT. However, specimens of draglines weighing up to 13,000
MT have also been manufactured.
Dragline has a long boom and digging bucket that is suspended from
the top of the boom through a cable. The operator lowers the bucket down
up to the material that is supposed to be excavated. Thereafter, the operator
draws the cable so that the bucket gets dragged along the ground surface
and digs into the material that is to be excavated or cleared.
excavate earth and load it into haul units, such as trucks, trailors etc. or to deposit it on
spoil banks and embankments near the place from where it is excavated. Draglines are
amongst the largest mobile equipment that have ever been built on land. They weigh in
the vicinity of 2000 MT. However, specimens of draglines weighing up to 13,000 MT
have also been manufactured.
Dragline has a long boom and digging bucket that is suspended from the top of the
boom through a cable. The operator lowers the bucket down up to the material that is
supposed to be excavated. Thereafter, the operator draws the cable so that the bucket
228 Project
gets dragged along Planning
the ground and
surface andManagement with
digs into the material thatCPM &excavated
is to be PERT
or cleared.
Hoist Hoist
cable cable
Hoist chain
Hoist chain
Crane boom
Crane boom
Backhoe
Cab
Stick
Tractor
Bucket
Boom
Stabilizer Legs Loader
When it used to dig at moderate depth, the output of the hoe may
be as much as of a power shovel of similar size digging in similar type of
soil. However, at more depth, its output reduces significantly. Most effective
digging action of this machine occurs when the dipper stick is at right angle
to the hoe.
10.4.1.4 Clamshell: This equipment can be termed as combination of
dragline and crane wherein digging is done through the clamshell buckets
and thereafter material excavated is transported through the crane part. Its
bucket is divided into two halves which are hinged at the top. Buckets have
teeth which are helpful in digging harder type of material. Capacity of the
bucket is specified in cum.
Clamshell is especially suited for vertical lifting of materials and
is mainly used for handling loose material such as gravel, crushed stone
and sand at the site. They are also used for removing the material from
cofferdams, deep narrow excavation and pier foundations.
Clamshell buckets Compact clamshell
Fig. 10.4: Clamshell
A comparison of different types of excavating machines is given below:
230
Table 10.2
4 Efficiency of loading Very good Good Moderately good Precise but slow
5 Footing required Close to work Close to pit Fairly away from pit Fairly away from pit
6 Digging level Digs at or above the Digs below the footing Digs below the footing Digs at or below the
footing level level level footing level
7 Cycle time Short Slightly more than the More than the power More than other three
power shovel shovel equipment
Project Planning and Management with CPM & PERT
Construction Equipment and Machinery 231
Fuel tank
Mould blade
Towing hook
Steel
track
shoes
10.4.1.6 Skid-Steer Loader: A skid loader also known as skid steer or skid-
steer loader is a small rigid-frame, engine-powered machine with lift arms
that is used to attach various types of labour-saving tools or attachments.
These are tyre mounted machines which can skid on their own axis and
therefore, are suitable for use at space-constrained locations. The tread
pattern used in their tyres ensures that they have minimum impact on the
finished work or surface. These machines provide a good grip on snow and
mud as well. Most of the skid-steer loaders available in the market have
an added advantage that they can be retrofitted with different attachments
and can be used for a wide range of applications viz. moving snow or mud,
excavation work, drilling holes, lifting loads, and compacting soil etc.
Fig. 10.6: Skid-steer loader
The material dug by the machine is deposited besides the trench by its own
conveyor system. Trenchers are generally mounted either on tracks or on
wheels and can dig any type of material except rock. These machines may
range in size from walk-behind models to attachments for a skid loader,
tractor or to heavy tracked equipment.
Different types of trenchers are available in the market, which may
vary according to their applicability for construction work or the sturdiness
of the surface to be trenched. Broadly, two types of trenchers are available;
wheel type trenching machine and ladder type trenching machine.
(a) Wheel type trenching machine: These are suitable for shallow
and narrow trenches in firm soil. The excavating portion of the
machine is provided with a power driven wheel on which a number
of removable buckets are mounted. These buckets are equipped
with cutter teeth. The machine is operated by lowering the said
wheel to the desired depth while the unit moves forward slowly. The
earth is picked up by the bucket and deposited on a belt conveyor
that can be suitably adjusted to discharge the earth on either sides
of the trench or into a tractor pulled trailor unit.
Fig. 10.7: Trenchers
Fig. 10.8: Graders
material. The bowl has a cutting edge attached at its bottom to make shallow
cut on ground. Size of scrapper is decided by the size of its bowl. The bowl
is provided with a wall at its front that opens and closes to regulate the flow
of earth. The front edge cuts into the soil and fills the hopper. Once the
hopper is full, it is raised and closed and thereafter scraper can transport its
load to the area where it is dumped. In an elevating scraper, a conveyor belt
moves material from the cutting edge into the hopper for further disposal.
Types of scraper: Scrappers are classified as below which is based on
the type of tractor used in it.
Wheel tractor scraper: For short and difficult haul
Crawler tractor scraper: For short and difficult haul
Motor scraper: It has its own engine and motoring arrangement
Fig. 10.9: Wheel Tractor Scrapper
Fig. 10.10: Tower Crane
Mast
Cab Enclosure
Steering
Wheel Seat
Lift Cylinders
Load Backrest
Fig. 10.11: Telehandlers
Fig. 10.13: Belt Conveyor
The major shortcoming of this system is its very high initial cost,
requirement of skilled labour force and continuous supply of electric supply
for its operation.
10.4.2.5 Hoist: Hoisting is lifting a weight from one location and moving
it to another location which is at a reasonable distance. Big projects such as
construction of dam, industrial buildings etc. require hoisting equipment
for moving the items from one location to the other. Hoisting may be done
with a wide range of equipment from a small hand-operated simple screw
or hydraulic jack to modern specialized high powered cranes and elevators.
Construction Equipment and Machinery 239
Upper Sheave
Hock
Hoist rope
Boom guy lines
Upper Sheave
Winding drum
Slewing platform
Outrigger
•• Movable pulley
•• Rope and pulley
•• Chain hoist
•• Mobile crane
•• Electric winch
•• Tower crane
•• Overhead crane gantry girder.
240 Project Planning and Management with CPM & PERT
Fig. 10.15: Dump-Trucks
Construction Equipment and Machinery 241
Rear Dump-Truck: They are provided with gate at the rear of the body
or alternatively body may have a chute like shape to facilitate dumping. They
are extensively used for transporting free flowing materials like aggregate,
gravel, ore, coal etc.
Bottom Dump-Truck: In these trucks, body of the truck remains in
the same position and discharge of the loaded material takes place through
its bottom. At the bottom, there is an arrangement for opening of two
longitudinal gates made of thick plate, resting with channel sections and
swinging on steel hinges. These trucks are useful when material is to be
spread in layers; as on roads, fill of a dam etc. The best feature of such
trucks is that material is discharged while the unit is moving, thus saving
the precious time.
Side Dump-Truck: In these trucks, body is hinged on both sides such
that they can dump the material in a long narrow stretch or on one or both
sides of the road.
10.4.4 Construction Equipment: Broadly, equipment and machinery
as described under above mentioned three categories viz. earth-moving,
material handling and construction vehicle are required for excavation and
hauling/transportation and dumping of the excavated material from the
site in addition to moving the construction material within the site. In this
section, however, certain specific equipment pertaining to a construction
project that are necessary to give final shape to the site shall be discussed.
For example, in a road construction project, following flow- chart of activities
and corresponding machinery may be of good use to readers.
242 Project Planning and Management with CPM & PERT
1. Excavator
2. Backhoe
Excavation 3. Dragline excavator
4. Bulldozer
Leveling Graders
Compaction 1. Compactor
2. Rollers
(a) Asphalt paving: In case of the asphalt road, the asphalt is added
from a dump truck into the paver's hopper. Thereafter, conveyor
carries the asphalt from hopper to the auger. The auger then places
a stockpile of material in front of the screed. The screed takes the
stockpile of material and spreads it over the desired area and also
provides initial compaction. The paver must provide a smooth
uniform surface behind the screed for which a free floating screed
is used. The height of the screed is controlled by several factors
viz. attack angle of the screed, material head and the towing force,
weight and vibration of the screed.
Construction Equipment and Machinery 243
To achieve the required elevation for the final grade of road, modern
paver machines use automatic screed controls that generally
control the screed's angle of attack as per the information received
from a grade sensor. Similarly, controls are also used to correct the
slope, crown or super-elevation of the finished surface. To attain a
smooth surface, the paver must move at a constant speed and have
a consistent stockpile of material in front of the screed. Increase
in material stockpile or paver speed will cause the screed to rise
resulting in excess quantity of asphalt that will make a thicker mat
of material and an uneven final surface. On the same pattern, a
decrease in material or a drop in speed will result in less quantity
and make the mat thinner.
To achieve constant speed and material supply it is desirable to use
a material transfer unit in combination with a paver. Such a unit
ensures constant material feed to the paver without any contact,
thus, providing a better end surface. However, when a dump truck
is used to fill the hopper of the paver, it can make contact with the
paver unit and cause it to change speed, thus, affecting the screed
height.
(b) Concrete paving: Large freeways are often paved with concrete
and this is done by using a slipform paver. Trucks dump the loads of
ready-mix concrete in heaps in front of the machine and thereafter
the slipform paver spreads the concrete and levels it using a screed.
Fig. 10.17: Paver
Road roller Sheep foot roller
Compactor-Road roller Vibratory Plate compactor
Fig. 10.18: Different types of Compactors
Construction Equipment and Machinery 245
Fig. 10.19: Concrete Mixing Plant
Fig. 10.20: Feller bunchers
Questions
1. What are the important criteria for classification of construction
equipment? List out the most commonly used earth-moving equipment
with their relative advantages.
2. Indicate the performance of power shovel, backhoe, dragline and clam-
shell for the following conditions in terms of very good, good, fair and
poor.
(i) Excavation in hard soil or rock
(ii) Excavation in wet soil or mud
(iii) Loading efficiency (ESE-2010 : 6 marks)
3. List the different types of equipment used for excavation work.
(ESE- 2011 : 5 marks)
4. List out the reasons for use of equipment and machinery in construction.
What are the main criteria for selection of construction equipment?
5. Describe the method of conveying materials with belt conveyors. List
the components. (ESE-2011 : 5 marks)
6. Enlist major concreting equipment required to carry out following
operations: Mixing, transportation, delivery and compacting equipment.
(ESE-2012: 4 marks)
7. Describe briefly five different types of earthwork equipment (rollers)
used for compacting soil. (ESE-2014 : 10 marks)
8. What is meant by cost of owning and operation of equipment? Which
are responsible factors for it?
9. Which equipment is also known as ‘Carry all Equipment’? What are its
limitations for use?
10. Consider the following equipment:
Dragline, Hoe, Bulldozer and Power Shovel
Which of these equipment may be used for excavation of materials and
loading them in a carrying vehicle?
11. Briefly explain the five important factors which should be considered
for selection of equipment for a construction project.
(ESE-2017 : 10 marks)
References