CONSTRUCTION PLANNING AND

MANAGEMENT (CLE 2008)

Dr. Roshan Srivastav
roshan@vit.ac.in

VIT University roshan@vit.ac.in 1

 Project Planning
Most important phase in project management
Project activities that will be performed
Products that will be produced
How activities will be accomplished and managed

VIT University roshan@vit.ac.in 2

 Project Planning
Defines
Each major task
Estimates the time, resources and cost required
Provides framework for management review and
control
Involves
Identifying and documenting scope, tasks, schedules,
cost, risk, quality and staffing needs

VIT University roshan@vit.ac.in 3

 Project Planning
Techniques
Gantt Chart
Critical Path Method (CPM)
Program Evaluation and Review Technique(PERT)

VIT University roshan@vit.ac.in 4

 Project Planning
Techniques
Monitor Progress and cost against resource budgets
Gantt Chart
Critical Path Method (CPM)
Program Evaluation and Review Technique(PERT)

VIT University roshan@vit.ac.in 5

 Project Planning
Gantt Chart
Bar Charts
Developed by Henry Gantt
Scheduling the tasks
Tracking the progress

VIT University roshan@vit.ac.in 6

 Project Planning
CPM Critical Path Method
Developed by DuPont
Scheduling the tasks
Tracking the progress
Sequential/Parallel activities
Project as a Network

VIT University roshan@vit.ac.in 7

 Project Planning
CPM Critical Path Method
Activities NODES
Events beginning and ending - LINES

VIT University roshan@vit.ac.in 8

 Project Planning
CPM Critical Path Method
Specify the individual activities
All the activities in the project are listed. This list can be
used as the basis for adding sequence and duration
information in later steps.
Determine the sequence of the activities
Draw the Network Diagram
Estimate the activity completion time
Identify the Critical Path

VIT University roshan@vit.ac.in 9

 Project Planning
CPM Critical Path Method
Specify the individual activities
Determine the sequence of the activities
Some activities are dependent on the completion of
other activities. A list of the immediate predecessors of
each activity is useful for constructing the CPM network
diagram.
Draw the Network Diagram
Estimate the activity completion time
Identify the Critical Path

VIT University roshan@vit.ac.in 10

 Project Planning
CPM Critical Path Method
Specify the individual activities
Determine the sequence of the activities
Draw the Network Diagram
Once the activities and their sequences have been
defined, the CPM diagram can be drawn. CPM originally
was developed as an activity on node network.
Estimate the activity completion time
Identify the Critical Path

VIT University roshan@vit.ac.in 11

 Project Planning
CPM Critical Path Method
Specify the individual activities
Determine the sequence of the activities
Draw the Network Diagram
Estimate the activity completion time
The time required to complete each activity can be
estimated using past experience. CPM does not take into
account variation in the completion time.
Identify the Critical Path

VIT University roshan@vit.ac.in 12

 Project Planning
CPM Critical Path Method
Specify the individual activities
Determine the sequence of the activities
Draw the Network Diagram
Estimate the activity completion time
Identify the Critical Path
The critical path is the longest-duration path through the
network. The significance of the critical path is that the
activities that lie on it cannot be delayed without delaying the
project. Because of its impact on the entire project, critical
path analysis is an important aspect of project planning.

VIT University roshan@vit.ac.in 13

 Project Planning
CPM Critical Path Method
Identify the Critical Path Parameters
ES - earliest start time: the earliest time at which the
activity can start given that its precedent activities must
be completed first.
EF - earliest finish time: equal to the earliest start time
for the activity plus the time required to complete the
activity.
LF - latest finish time: the latest time at which the
activity can be completed without delaying the project.
LS - latest start time: equal to the latest finish time
minus the time required to complete the activity.

VIT University roshan@vit.ac.in 14

 Project Planning
CPM Critical Path Method
Slack time for an activity is the time between its
earliest and latest start time, or between its
earliest and latest finish time.
the amount of time that an activity can be delayed
past its earliest start or earliest finish without
delaying the project.

VIT University roshan@vit.ac.in 15

 Project Planning
CPM Critical Path Method

LIMITATIONS
It does not consider the time variations that can have a great impact on the
completion time of a complex project.
CPM was developed for complex but fairly routine projects with minimum
uncertainty in the project completion times.
For less routine projects there is more uncertainty in the completion times, and
this uncertainty limits its usefulness.

VIT University roshan@vit.ac.in 16

 Problems
CPM

VIT University roshan@vit.ac.in 17

 Problems
Critical Path
Slack determination
Early Start and Early Finish
Late Start and Late Finish

VIT University roshan@vit.ac.in 18

 Problems
Critical Path

VIT University roshan@vit.ac.in 19

 Problems
Critical Path

VIT University roshan@vit.ac.in 20

 Problems
Slack: amount of time an activity can be
delayed before it causes your project to be
delayed

VIT University roshan@vit.ac.in 21

 Problems
Slack: amount of time an activity can be
delayed before it causes your project to be
delayed

VIT University roshan@vit.ac.in 22

 Problems
Early Start (ES) and Early Finish (EF)
Forward Pass
First activity is One; EF is its ES plus its duration
minus one

VIT University roshan@vit.ac.in 23

 Problems
Early Start (ES) and Early Finish (EF)
Forward Pass
First activity is One; EF is its ES plus its duration
minus one
Activity 2 is the first activity on the critical path: ES
= 1, EF = 1 + 5 -1 = 5.

VIT University roshan@vit.ac.in 24

 Problems
Early Start (ES) and Early Finish (EF)
Forward Pass
First activity is One; EF is its ES plus its duration
minus one
Activity 2 is the first activity on the critical path: ES
= 1, EF = 1 + 5 -1 = 5.
Activity 3 ES = 5 + 1 = 6. Its EF is calculated the
same as before: EF = 6 + 7 - 1 = 12.

VIT University roshan@vit.ac.in 25

 Problems
Early Start (ES) and Early Finish (EF)
Forward Pass
First activity is One; EF is its ES plus its duration
minus one
Activity 2 is the first activity on the critical path: ES
= 1, EF = 1 + 5 -1 = 5.
Activity 3 ES = 5 + 1 = 6. Its EF is calculated the
same as before: EF = 6 + 7 - 1 = 12.

VIT University roshan@vit.ac.in 26

 Problems
Latest Start (LS) and Latest Finish (LF)
Backward Pass
Latest Finish (LF) for the last activity in every path
is the same as the last activity's EF in the critical
path. The Latest Start (LS) is the LF - duration + 1.

VIT University roshan@vit.ac.in 27

 Problems
Latest Start (LS) and Latest Finish (LF)
Backward Pass
Latest Finish (LF) for the last activity in every path
is the same as the last activity's EF in the critical
path. The Latest Start (LS) is the LF - duration + 1.
Example: Activity 4 is the last activity on the
critical path. Its LF is the same as its EF, which is
14. To calculate the LS, subtract its duration from
its LF and add one. LS = 14 - 2 + 1 = 13.

VIT University roshan@vit.ac.in 28

 Problems
Latest Start (LS) and Latest Finish (LF)
Backward Pass
You then move on to the next activity in the path.
Its LF is determined by subtracting one from the
previous activity's LS. In our example, the next
Activity in the critical path is Activity 3. Its LF is
equal to Activity 4 LS - 1. Activity 3 LF = 13 -1 = 12.
Activity 3 LS = 12 - 7 + 1 = 6.

VIT University roshan@vit.ac.in 29

 Problems
Latest Start (LS) and Latest Finish (LF)
Backward Pass
You then move on to the next activity in the path.
Its LF is determined by subtracting one from the
previous activity's LS. In our example, the next
Activity in the critical path is Activity 3. Its LF is
equal to Activity 4 LS - 1. Activity 3 LF = 13 -1 = 12.
Activity 3 LS = 12 - 7 + 1 = 6.

VIT University roshan@vit.ac.in 30