Lag
Lag
Developing a
Project Plan
6-2
1
Developing the Project Plan
The Project Network
❑A flow chart that graphically depicts the
sequence, interdependencies, and start and finish
times of the project job plan of activities that is the
critical path through the network
o Provides the basis for scheduling labor and
equipment
o Provides an estimate of the project’s duration
o Provides a basis for budgeting cash flow
o Highlights activities that are “critical” and should not
be delayed
o Help managers get and stay on plan
6-3
FIGURE 6.1
6-4
2
From Work Package to Network (cont’d)
WBS/Work Packages to Network (cont’d)
6-5
6-6
3
Constructing a Project Network (cont’d)
Terminology
A B D
❑ Activity-on-Arrow (AOA)
o Uses an arrow to depict an activity D
6-8
4
Basic Rules to Follow in Developing
Project Networks
Networks typically flow from left to right.
An activity cannot begin until all of its activities are
complete.
Arrows indicate precedence and flow and can cross
over each other.
Identify each activity with a unique number; this
number must be greater than its predecessors.
Looping is not allowed.
Conditional statements are not allowed.
Use common start and stop nodes.
6-9
Activity-on-Node Fundamentals
FIGURE 6.2
6-10
5
Activity-on-Node Fundamentals (cont’d)
6-11
Network Information
TABLE 6.1
6-12
6
Koll Business Center—Partial Network
FIGURE 6.3
6-13
FIGURE 6.4
6-14
7
Network Computation Process
Forward Pass—Earliest Times
❑ How soon can the activity start? (early start—ES)
❑ How soon can the activity finish? (early finish—EF)
❑ How soon can the project finish? (expected time—
ET)
Backward Pass—Latest Times
❑ 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 can it be delayed? (slack or float—SL)
6-15
Network Information
TABLE 6.2
6-16
8
Activity-on-Node Network
FIGURE 6.5
6-17
FIGURE 6.6
6-18
9
Forward Pass Computation
Add activity times along each path in the
network (ES + Duration = EF).
Carry the early finish (EF) to the next
activity where it becomes its early start
(ES) unless…
The next succeeding activity is a merge
activity, in which case the largest EF of all
preceding activities is selected.
6-19
FIGURE 6.7
6-20
10
Backward Pass Computation
Subtractactivity times along each path in
the network (LF - Duration = LS).
Carrythe late start (LS) to the next activity
where it becomes its late finish (LF)
unless...
The next succeeding activity is a burst
activity, in which case the smallest LF of
all preceding activities is selected.
6-21
6-22
11
Sensitivity of a Network
The likelihood the original critical path(s)
will change once the project is initiated.
❑ Function of:
oThe number of critical paths
oThe amount of slack across near critical
activities
6-23
FIGURE 6.8
6-24
12
Practical Considerations
Network logic errors
Activity numbering
Use of computers to develop networks
Calendar dates
Multiple starts and multiple projects
6-25
Illogical Loop
FIGURE 6.9
6-26
13
Air Control Project
FIGURE 6.10
6-27
FIGURE 6.11
6-28
14
Extended Network Techniques
to Come Close to Reality
Laddering
❑ Activities are broken into segments so the following
activity can begin sooner and not delay the work.
Lags
❑ The minimum amount of time a dependent activity
must be delayed to begin or end
o Lengthy activities are broken down to reduce the delay
in the start of successor activities.
o Lags can be used to constrain finish-to-start, start-to-
start, finish-to-finish, start-to-finish, or combination
relationships.
6-29
FIGURE 6.12
6-30
15
Use of Lags
Finish-to-Start Relationship
FIGURE 6.13
Start-to-Start Relationship
FIGURE 6.14
6-31
Use of Lags to
Reduce Detail
FIGURE 6.15
6-32
16
New Product
Development
Process
FIGURE 6.16
6-33
Finish-to-Finish
Relationship
FIGURE 6.17
Start-to-Finish
Relationship FIGURE 6.18
6-34
17
Network Using Lags
FIGURE 6.20
6-35
Hammock Activities
Hammock Activity
6-36
18
Hammock Activity Example
FIGURE 6.21
6-37
Key Terms
Activity Gantt chart
Activity-on-arrow (AOA) Hammock activity
Activity-on-node (AON) Lag relationship
Burst activity Merge activity
Concurrent engineering Network sensitivity
Critical path Parallel activity
Early and late times Slack/float—total and free
6-38
19
Activity-on-Arrow Network
Building Blocks
FIGURE A6.1
6-39
Activity-on-Arrow Network
Fundamentals
FIGURE A6.2
6-40
20
Activity-on-Arrow Network
Fundamentals
6-41
TABLE A6.1
6-42
21
Partial Koll Business Center
AOA Network
FIGURE A6.3
6-43
FIGURE A6.4
6-44
22
Partial AOA Koll Network (cont’d)
6-45
Activity-on-Arrow Network
FIGURE A6.5
6-46
23
Activity-on-Arrow Network
Forward Pass
FIGURE A6.6
6-47
Activity-on-Arrow Network
Backward Pass
FIGURE A6.7
6-48
24
Activity-on-Arrow Network Backward
Pass, Forward Pass, and Slack
FIGURE A6.8
6-49
FIGURE A6.9
6-50
25
Comparison of AON and AOA Methods
26