Professional Documents
Culture Documents
18
Project Planning
• Gantt Chart
• Critical Path Method (CPM)
• Program Evaluation and Review Technique (PERT)
Gantt Chart Graph or bar chart with a bar for each project activity that shows passage of time.
It provides visual display of project schedule.
PERT / CPM
• It is a control tool for defining the parts of construction job and then putting them together
in a network form.
• Its serves as an aid to the project manager but it does not make decision for him nor
does it guarantee good management. It only serves the project manager to see the
whole picture of the entire job.
3 Phases of PERT/CPM
1. Planning
2. Scheduling
3. Control - Monitor
19
History of PERT/CPM
• Critical Path Method (CPM)
o E I Du Pont de Nemours & Co. (1957) for construction of new chemical plant and
maintenance shut-down
o Deterministic task times
o Activity-on-node network construction
o Repetitive nature of jobs
• Project Evaluation and Review Technique (PERT)
o U S Navy (1958) for the POLARIS missile program
o Multiple task time estimates (probabilistic nature)
o Activity-on-arrow network construction
o Non-repetitive jobs (R & D work)
Project Network
Network analysis is the general name given to certain specific techniques which can be used for
the planning, management and control of projects
20
Activity-on-arrow (AOA) - arrows represent activities and nodes are events for points in
time
A must finish before B can start both A and C must finish before D can
start
Concurrent Activities
21
Defining Precedence Relationships among Activities
Once work activities have been defined, the relationships among the activities can be specified.
Precedence relations between activities signify that the activities must take place in a particular
sequence. Diagramatically, precedence relationships can be illustrated by a network or graph in
which the activities are represented by arrows as in Figure below. The arrows are called branches
or links in the activity network, while the circles marking the beginning or end of each arrow are
called nodes or events. In this figure, links represent particular activities, while the nodes
represent milestone events.
• First, a circle of activity precedences will result in an impossible plan. For example, if
activity A precedes activity B, activity B precedes activity C, and activity C precedes
activity A, then the project can never be started or completed
Suppose that a site preparation and concrete slab foundation construction project consists of
nine different activities:
22
TABLE 6-1 Precedence Relations for a Nine-Activity Project Example
With this information, the next problem is to represent the activities in a network diagram and to
determine all the precedence relationships among the activities. One network representation of
these nine activities is shown in Figure, in which the activities appear as branches or links between
nodes. The nodes represent milestones of possible beginning and starting times. This
representation is called an activity-on-branch diagram. Note that an initial event beginning activity
is defined, while node 5 represents the completion of all activities.
Alternatively, the nine activities could be represented by nodes and predecessor relationships
by branches or links,. The result is an activity-on-node diagram.
23
Network example
From the following table of information, (a) Draw the precedence diagram, (b) Find the critical
path, (c) Determine the expected duration of the project.
A C,B 4
C D 12
D I 2
B I 5
E F 3
F J 8
I J 12
J End 9
G H 1
H K 3
K End 15
24
CPM calculation
• Path
• A connected sequence of activities leading from the starting event to the ending
event
• Critical Path
• The longest path (time); determines the project duration
• Critical Activities
• All of the activities that make up the critical path
Forward Pass
• Earliest Start Time (ES)
• earliest time an activity can start
• ES = maximum EF of immediate predecessors
• Earliest finish time (EF)
• earliest time an activity can finish
• earliest start time plus activity time
EF= ES + t
Backward Pass
Latest Start Time (LS)
Latest time an activity can start without delaying critical path time
LS= LF - t
Latest finish time (LF)
latest time an activity can be completed without delaying critical path time
LF = minimum LS of immediate predecessors
25
26
PERT/CPM Example 2
From the following data of information, prepare a data sheet development showing (a) Earliest
and Latest Start, (b) Earliest and Latest Finish, (c) Total and Free Float or Slack and (d) Critical
Activities
Activities Time Duration in Days
1-2 Demolition and clearing 8
2-3 Excavation 14
2-5 Underground installation 6
3-4 Foundation and columns 5
4-5 Dummy 0
4-6 Construction of 2nd floor 6
4-7 Roof framing and flooring 6
5-7 Ground floor slab 4
5-8 Mechanical and Electrical Services 12
6-7 Construction of exterior walls 12
7-8 Dummy 0
7-9 Construction of interior partitions 10
8-9 Mech. & Elect. Equipment & fixtures 12
9-10 Painting and finishing work 8
27
28
29
Benefits of CPM/PERT
30
TIME-SCALED EVENT
31
32
MANPOWER LEVELING
33
34
35
36
37
38