CPE520

PROJECT
ChapterMANAGEMENT
4: Project Scheduling
(Network Techniques)
 Planning

Interdependent

Scheduling Budgeting
4
How to prepare Project
Schedule??

Typical
PERT/CP formats/method Gantt
M s of preparing a Charts
Networks Project Schedule
 PERT/CPM
Networks
Convenient analytical and visual techniques of project scheduling. Proven
to be extremely valuable in assisting the PM in managing the projects

PERT : Project Evaluation and Review Technique

- Developed in late 1950’s by the US Navy. The technique was
developed and used in conjunction with the planning and designing of
the Polaris missile project

CPM : Critical Path Method

- Developed also in 1950’s by the DuPont Company and applied first to
the construction projects in the chemical industry
Difference between PERT/CPM
Networks
Similarities between PERT/CPM
Networks
 The Framework of
PERT/CPM
PERT and CPM both follow 6 basic steps:

Define the project and prepare the WBS

Develop the relationships among the activities/tasks.

Decide which activities must precede and which must
follow others

Draw the network connecting all the activities

Assign time/or cost estimates to each activities

Compute the longest time path through

the

network. This is called the critical path

First….we must understand the language
of PERT/CPM
Project Network Diagram: Arrows &
Nodes
 Project Network
Diagram

AOA AON
(activity-on-arrow) (activity-on-node)
EXAMPLE 1- AON, AOA
Task/Activity Predecessor

a -
b -
c a
d b
e b
f c,d
g e
SOLUTION (AON NETWORK
DIAGRAM)
SOLUTION (AOA NETWORK
DIAGRAM)
To find the critical path, we calculate two distinct starting and
ending times for each activity, as defined below:

•Earliest Start Time (ES) = earliest time at which an activity can

start, assuming all predecessors
have been completed.
•Earliest Finish Time (EF) = earliest time at which an activity
can
be finished.

•Latest Start Time (LS) = latest time at which an activity can

start so as to not delay the
completion time of entire project.
• Latest Finish Time (LF) = latest time by which an activity has
to
finish so as not to delay the
completion time of the entire
project.
NOTATIONS USED IN NODES FOR CP ANALYSIS

Forward Pass
Process

Backward Pass
Process
Activities on the critical path cannot be delayed, because it
will cause the entire project to be delayed

What about activities not

on the critical path? Can
they be delayed without
causing delay to the
entire project?

Yes, they can be delayed,

but with a certain limit. The
amount of time a
noncritical path can be
delayed without delaying a
project is known as float or
slack
Float = Slack = LS – ES = LF -
EF
GANTT CHART : EXAMPLE 1
GANTT CHART: EXAMPLE 2
GANTT CHART: EXAMPLE 3
Source: Maria
 CONSTRUCTING GANTT CHART

1. Schedule critical task

Source: Maria
 CONSTRUCTING GANTT CHART

2. Place time window for non critical task

Source: Maria
CONSTRUCTING GANTT CHART

3. Indicate precedence relationship between tasks.

Source: Maria