Network Diagram
Network Diagram
COSTRUCTION
MANGEMENT
DEVELOPING THE PROJECT NETWORK
CONSTRCUTING A
PROJECT NETWORK
Terminology:
Activity : It is an element of the project that requires
time. Activities usually represent one or more tasks
from a work package.
Merge Activity: this is an activity that has more than
one activity immediately preceding it (more than
one dependency arrow flowing to it).
Parallel Activities: activities that can take place at
the same time, if the manager wishes.
Path: A sequence of connected dependent activities.
Critical Path: the longest path through the network.
APPROACHES
The two approaches used to develop project
networks are known as activity on node (AON)
and activity on arrow (AOA).
Arrows on networks indicate precedence and flow. Arrows can cross over each
other.
Experience suggests that when there are multiple starts a common start node
can be used to indicate a clear project beginning on the network similarly
ending.
AON FUNDAMENTALS
AON method is also sometimes called
precedence diagramming method.
AON FUNDAMENTALS
Activities that must be completed immediately
before an activity are called predecessor
activities.
X
Z
J
AA
CLASS ASSIGNMENT
KOLL BUSINESS CENTRE
ACTIVITY
DESCRIPTION
PRECEDING ACTIVITY
APPLICATION
APPROVAL
NONE
CONSTRUCTION
PLANS
TRAFFIC STUDY
SERVICE AVALIABLITY A
STAFF REPORT
B,C
COMMISION
APPROVAL
B,C,D
WAIT FOR
CONSTRUCTION
OCCUPANCY
E,G
NETWORK COMPUTATION
PROCESS
Performing a few simple computations allows
the project manager to complete a process
known as the forward and backward pass.
Forward pass:
How soon can the activity start? Early start- ES
How soon can the activity finish? Early finish- EF
How soon can the project be finished? Expected
Time-TE
NETWORK COMPUTATIONS
Backward pass:
How late can the activity start? Late start- LS
How late can the activity finish? Late finish- LF
Which activities represent the critical path?
How long the project can be delayed? Slack or
float-SL
FORWARD PASS
Forward pass starts with the first project activity
( ies ) and traces each path through the network
to the last project activity ( ies ).
FORWARD PASS
KOLL BUSINESS CENTER
ACITVITY
DESCRIPTION
PRECEDING
ACTIVITY
ACTIVITY TIME
APPLICATION
APPROVAL
NONE
CONSTRUCTIO
N PLANS
15
TRAFFIC STUDY
10
SERVICE
AVALIABLITY
STAFF REPORT
B,C
15
COMMISION
APPROVAL
B,C,D
10
WAIT FOR
CONSTRUCTIO
N
170
ES
SL
LS
ID
EF
DESCRIPTION
DUR
LF
FORWARD PASS
You add activity times along each path in the
network ( ES + Dur = EF )
BACKWARD PASS
The backward pass starts with the last project
activity on the network. You trace backward on
each path subtracting activity times to find the
late start LS and late finish times LF for each
activity. Before backward pass can be
computed , the late finish for the last project
activity must be selected.
BACKWARD PASS
You subtract activity times along each path
starting with the project end activity ( LF Dur =
LS)
BACKWARD PASS
KOLL BUSINESS CENTER
ACITVITY
DESCRIPTION
PRECEDING
ACTIVITY
ACTIVITY TIME
APPLICATION
APPROVAL
NONE
CONSTRUCTIO
N PLANS
15
TRAFFIC STUDY
10
SERVICE
AVALIABLITY
STAFF REPORT
B,C
15
COMMISION
APPROVAL
B,C,D
10
WAIT FOR
CONSTRUCTIO
N
170
ES
SL
LS
ID
EF
DESCRIPTION
DUR
LF
DETERMINING
SLACK(FLOAT)
It is possible to determine which activities can
be delayed by computing slack or float.
DETERMINING SLACK
(FLOAT)
After the slack for each activity is computed, the
critical path is easily identified.
CLASS ASSIGNMENT
ID
DESCRIPTION
PREDECESSO
R
TIME
EXTERNAL SPECIFICATION
NONE
REVIEW DESIGN
WRITE SOFTWARE
60
60
REVIEW MANUAL
ALPHA SITE
E,F
20
PRINT MANUAL
10
BETA SITE
H,I
10
MANUFACUTRE
12
FORWARD PASS?
BACKWARD PASS?
SLACK?
CRITICAL PATH?
A: 4 weeks
B: 6 weeks
C: 11 weeks
D: None of the Above.
A: 5.5 weeks
B: Eighteen weeks
C: 33.33 Days
D: Three weeks