Time Planning and

Control

Activity on Node Network and

Precedence Diagramming

4/28/20 03:12 PM
1
Processes of Time Planning and Control

1.Visualize
1. Visualizeand
anddefine
definethe
the activities.
activities.
2.Sequence
2. Sequence the
the activities
activities(Job
(Job Logic).
Logic).
3.Estimate
3. Estimatethe
the activity
activityduration.
duration.
4.Schedule
4. Schedule of
ofthe
theproject
projector
or phase.
phase.
5.Allocate
5. Allocateand
andbalance
balance resources.
resources.
6.Compare
6. Compare target,
target, planned
planned and
and actual
actual dates
dates and
and
updateas
update as necessary.
necessary.
7.Control
7. Control the
thetime
time schedule
schedule with
withrespect
respect to
to changes.
changes.

4/28/20 03:12 PM
2
Activity on Node Notation
Each
 Each time-consuming
time-consuming activity
activity isis portrayed
portrayed by
by aa
rectangularfigure.
rectangular figure.
The
 The dependencies
dependencies between
between activities
activities are
are indicated
indicated by
by
dependency lines
dependency lines (arrows)
(arrows) going
going form
form one
one activity
activity to
to
another.
another.
Each
 Each activity
activity duration
duration in
in terms
terms of
of working
working days
days isis
shownin
shown inthe
thelower,
lower,central
central part
part of
ofthe
theactivity
activity box.
box.
The
 The principal
principal advantage
advantage of
of the
the activity
activity on
on node
node network
network
isisthat
thatitit eliminates
eliminatesthe
theneed
needfor
for dummies.
dummies.

4/28/20 03:12 PM
3
Activity Box

Earliest Earliest
Activity Starting Activity Finishing
Date Number Date
Description

EF Code ES
Description
LF D LS

Latest Duration Latest

Starting Finishing
Date Date

The
The left
left side
side of
of the
the activity
activity box
box (node)
(node) is
is the
the start
start side,
side,
while
while the
the right
right side
side is
is the
the finish
finish (end)
(end) side.
side.

4/28/20 03:12 PM
4
Activity on Node Network
Each
 Eachactivity
activityininthe
thenetwork
networkmust
mustbe
bepreceded
precededeither
eitherby
bythe
thestart
startof
of
theproject
the projector
orby
bythe
thecompletion
completionof
ofaaprevious
previousactivity.
activity.

Each
 Eachpath
paththrough
throughthe
thenetwork
networkmust
mustbe
becontinuous
continuouswith
withno
nogaps,
gaps,
discontinuities,or
discontinuities, ordangling
danglingactivities.
activities.

All
 All activities
activities must
must have
have at
at least
least one
one activity
activity following,
following, except
except the
the
activitythat
activity thatterminates
terminatesthe
theproject.
project.

Each
 Each activity
activity should
should have
have aaunique
uniquenumerical
numericaldesignation
designation(activity
(activity
code). Activity
code). Activity code
code isis shown
shown inin the
the upper,
upper, central
central part
part of
of the
the
activity box,
activity box, with
with the
the numbering
numbering proceeding
proceeding generally
generally from
from project
project
startto
start tofinish.
finish.

4/28/20 03:12 PM
5
Network Format
AAhorizontal
 horizontaldiagram
diagramformat
formatisisthe
thestandard
standardformat.
format.
The
 The general
general developing
developing ofof aa network
network isis from
from start
start to
to finish,
finish, from
from project
project
beginningon
beginning onthe
theleft
leftto
toproject
projectcompletion
completionononthe
theright.
right.
The
 The sequential
sequential relationship
relationship ofof one
one activity
activity toto another
another isis shown
shown by
by the
the
dependencylines
dependency linesbetween
betweenthem.
them.
The
 Thelength
lengthof
ofthe
thelines
linesbetween
betweenactivities
activitieshas
hasno
nosignificance.
significance.
Arrowheads
 Arrowheadsare
arenot
notalways
alwaysshown
shownon
onthe
thedependency
dependencylines
linesbecause
becauseofofthe
the
obviousleft
obvious lefttotoright
rightflow
flowofoftime.
time.
Dependency
 Dependencylines linesthat
thatgo
gobackward
backwardfrom
fromone
oneactivity
activityto
toanother
another(looping)
(looping)
shouldnot
should notbebeused.
used.
Crossovers
 Crossovers occur
occur when
when one
one dependency
dependency line
line must
must cross
cross over
over another
another to
to
satisfyjob
satisfy joblogic.
logic.

4/28/20 03:12 PM
6
Example
The activity
The activity list
list shown
shown below
below represents
represents the
the activities,
activities, the
the job
job logic
logic and
and
the activities’
the activities’ durations
durations of
of aa small
small project.
project. Draw
Draw an an activity
activity onon node
node
networkto
network torepresent
representthe theproject.
project.

Activity Depends on Duration

(days)
A D 4
B R 5
C D 8
E R, S, A 7
F B, C 3
D None 4
S A, C 2
R A, C 9

4/28/20 03:12 PM
7
Example

A S
4 2

D E END
4 7 0

C R B F
8 9 5 3

4/28/20 03:12 PM
8
Network Computations
Thepurpose
The purposeof
ofnetwork
networkcomputations
computationsisisto
todetermine:
determine:

The
Theoverall
overallproject
projectcompletion
completiontime
timeand
and
The
 The time
time brackets
brackets within
within which
which each
each activity
activity must
must be
be
accomplished(Activity
accomplished (ActivityTimes
Times).).
In activity
In activity on
on node
node network,
network, allall of
of the
the numbers
numbers associated
associated withwith anan
activity are
activity are incorporated
incorporated inin the
the oneone node
node symbol
symbol forfor the
the activity,
activity,
whereas the
whereas the arrow
arrow symbols
symbols contain
contain eacheach activity’s
activity’s data
data inin the
the
predecessorand
predecessor andsuccessor
successornodes,
nodes,as aswell
wellas
ason
onthe
thearrow
arrowitself
itselfor
orinin
aatable.
table.
ES Activity code EF
Activity Description
LS Duration LF

4/28/20 03:12 PM
9
 EARLY ACTIVITY TIMES

1. The
1. The "Early
"Early Start"
Start" (ES)
(ES) or
or "Earliest
"Earliest Start"
Start" of
of an
an activity
activity isis
the earliest
the earliest time
time that
that the
the activity
activity can
can possibly
possibly start
start
allowing for
allowing for the
the time
time required
required to
to complete
complete thethe preceding
preceding
activities.
activities.

2. The
2. The "Early
"Early Finish"
Finish" (EF)
(EF) or
or "Earliest
"Earliest Finish"
Finish" of
of an
an activity
activity
isis the
the earliest
earliest possible
possible time
time that
that itit can
can bebe completed
completed
and isis determined
and determined by by adding
adding that
that activity's
activity's duration
duration toto
itsearly
its earlystart
starttime.
time.

4/28/20 03:12 PM
10
 COMPUTATIONS OF EARLY ACTIVITY TIMES

 Direction:
Direction:Proceed
Proceedfrom
fromproject
projectstart
startto
toproject
projectfinish,
finish,from
fromleft
leftto
toright.
right.

 Name:
Name:This
Thisprocess
processisiscalled
calledthe
the"forward
"forwardpass".
pass".

 Assumption:
Assumption: every
every activity
activity will
will start
start as
as early
early as
as possible.
possible. That
That isis to
to say,
say,
each activity
each activity will
will start
start just
just as
as soon
soon as as the
the last
last of
of its
its predecessors
predecessors isis
finished.
finished.
 The
TheES
ESvalue
valueofofeach
eachactivity
activityisisdetermined
determinedfirst.
first.

 The
TheEF
EFtime
timeisisobtained
obtainedby
byadding
addingthe
theactivity
activityduration
durationto
tothe
theES
EStime.
time.

EF== ES
EF ES++ DD
 In
In case
case ofof merge
merge activities
activities the
the earliest
earliest possible
possible start
start time
time isis equal
equal to
to the
the
latest(or
latest (orlargest)
largest)ofofthe
theEF
EFvalues
valuesofofthe
theimmediately
immediatelypreceding
precedingactivities.
activities.

4/28/20 03:12 PM
11
Example
Calculate the early activity times (ES and EF) and determine project time.

A S
4 2

D E END
4 7 0

C R B F
8 9 5 3

4/28/20 03:12 PM
12
Example

4 8 12 14
A S
4 2

0 4 21 28 29 29
D E END
4 7 0

4 12 12 21 21 26 26 29
C R B F
8 9 5 3

4/28/20 03:12 PM
13
LATE ACTIVITY TIMES

3. The
3. The "late
"late finish"
finish" (LF)
(LF) oror "Latest
"Latest Finish"
Finish" of
of an
an activity
activity isis
the very
the very latest
latest that
that itit can
can finish
finish and
and allow
allow the
the entire
entire
projectto
project tobebecompleted
completedby byaadesignated
designatedtime
timeoror date.
date.

4. The
4. The “late
“late start”
start” (LS)
(LS) oror "Latest
"Latest Start"
Start" of
of an
an activity
activity isis the
the
latest possible
latest possible timetime that
that itit can
can be
be started
started ifif the
the project
project
target completion
target completion date date isis toto be
be met
met and
and isis obtained
obtained by by
subtracting the
subtracting the activity's
activity's duration
duration from
from its
its latest
latest finish
finish
time.
time.

4/28/20 03:12 PM
14
 COMPUTATIONS OF LATE ACTIVITY TIMES

 Direction:
Direction:Proceed
Proceedfrom
fromproject
projectend
endto
toproject
projectstart,
start,from
fromright
rightto
toleft.
left.

 Name:
Name:This
Thisprocess
processisiscalled
calledthe
the“backward
“backwardpass".
pass".

 Assumption:
Assumption: EachEach activity
activity finishes
finishes as
as late
late as
as possible
possible without
without
delayingproject
delaying projectcompletion.
completion.

 The
The LF
LF value
value of
of each
each activity
activity isis obtained
obtained first
first and
and isis entered
entered into
into the
the
lowerright
lower rightportion
portionofofthe
theactivity
activitybox.
box.

 The
The LS
LS isis obtained
obtained by
by subtracting
subtracting the
the activity
activity duration
duration from
from the
the LF
LF
value.
value.
LS==LF
LS LF--DD

 In
Incase
caseof
ofburst
burstactivities
activitiesLF
LFvalue
valueisisequal
equalto
tothe
theearliest
earliest(or
(orsmallest)
smallest)
ofthe
of theLS
LStimes
timesof
ofthe
theactivities
activitiesfollowing.
following.

4/28/20 03:12 PM
15
Example
Calculate the late activity times (LS and LF).

4 8 12 14
A S
4 2

0 4 21 28 29 29
D E END
4 7 0

4 12 12 21 21 26 26 29
C R B F
8 9 5 3

4/28/20 03:12 PM
16
Example

4 8 12 14
A S
8 4 12 20 2 22

0 4 21 28 29 29
D E END
0 4 4 22 7 29 29 0 29

4 12 12 21 21 26 26 29
C R B F
4 8 12 12 9 21 21 5 26 26 3 29

4/28/20 03:12 PM
17
 FLOAT Time

 Float
 Float oror leeway
leeway isis aa measure
measure of
of the
the time
time available
available
for aa given
for given activity
activity above
above and
and beyond
beyond its its estimated
estimated
duration.
duration.
 Two
 Two classifications
classifications of
of which
which are
are in
in general
general usage:
usage:
totalfloat
total float and
andfree
freefloat.
float.

4/28/20 03:12 PM
18
 TOTAL FLOAT

 The
The total
total float
float of
of an
an activity
activity isis obtained
obtained by
by subtracting
subtracting its
its ES
ES
timefrom
time fromitsitsLS
LStime.
time.Subtracting
Subtractingthe theEF
EFfrom
fromthe
theLF
LFgives
givesthethe
sameresult.
same result.

Total float
Total float (TF)
(TF) == LS
LS-- ES
ES== LF
LF--EF
EF
 An activity
An activity with
with zero
zero total
total float
float has
has no
no spare
spare time
time and
and is,
is,
therefore,one
therefore, oneofofthe
theoperations
operationsthat
thatcontrols
controlsproject
projectcompletion
completion
time.
time.
 Activities
Activitieswith
withzero
zerototal
totalfloat
floatare
arecalled
called"critical
"criticalactivities“.
activities“.

4/28/20 03:12 PM
19
 CRITICAL PATH

 Critical
 Criticalactivity
activityisisquickly
quicklyidentified
identifiedas
asone
onewhose
whosetwo
twostart
starttimes
timesatatthe
theleft
left
ofthe
of theactivity
activitybox
boxare
areequal.
equal.Also
Alsoequal
equalare
arethe
thetwo
twofinish
finishtimes
timesat
atthe
theright
right
ofthe
of theactivity
activitybox.
box.

 The
 The critical
critical activities
activities must
must form
form aa continuous
continuous path
path from
from project
project beginning
beginning
toproject
to projectend,
end,this
thischain
chainofofcritical
criticalactivities
activitiesisiscalled
calledthe
the"critical
"criticalpath".
path".

 The
 The critical
critical path
path isis normally
normally indicated
indicated on
on the
the diagram
diagram inin some
some distinctive
distinctive
waysuch
way suchas
aswith
withcolors,
colors,heavy
heavylines,
lines,or
ordouble
doublelines.
lines.

 The
 Thecritical
criticalpath
pathisisthe
thelongest
longestpath
pathininthe
thenetwork.
network.

 Any
 Any delay
delay inin the
the finish
finish date
date ofof aa critical
critical activity,
activity, for
for whatever
whatever reason,
reason,
automaticallyprolongs
automatically prolongsproject
projectcompletion
completionby
bythe
thesame
sameamount.
amount.

4/28/20 03:12 PM
20
 FREE FLOAT

 The
The free
free float
float of
of an
an activity
activity isis the
the amount
amount ofof time
time by
by which
which the
the
completion of
completion of that
that activity
activity can
can be be deferred
deferred without
without delaying
delaying the
the
earlystart
early startof
ofthe
thefollowing
followingactivities.
activities.

 The
Thefree
freefloat
floatof
ofan
anactivity
activityisisfound
foundbybysubtracting
subtractingitsitsearliest
earliestfinish
finish
timefrom
time fromthe
theearliest
earlieststart
starttime
timeof ofthe
theactivities
activitiesdirectly
directlyfollowing.
following.

 FF
FF == The
The smallest
smallest of
of the
the ESES value
value ofof those
those activities
activities immediately
immediately
following--EF
following EFof
ofthe
theactivity.
activity.

==the
thesmallest
smallestof
ofthe
theearliest
earlieststart
starttime
timeof ofthe
thesuccessor
successoractivities
activities
minusthe
minus theearliest
earliestfinish
finishtime
timeofofthe
theactivity
activityininquestion.
question.

FFi == Min.
FF Min. (ES
(ES)j) -- EF
EFi
i j i

4/28/20 03:12 PM
21
CALENDAR-DATE SCHEDULE

 Activity
Activity times
times (ES,
(ES, EF,
EF, LS,
LS, LF)
LF) obtained
obtained from
from previous
previous
calculationsare
calculations areexpressed
expressedininterms
termsof
ofexpired
expiredworking
workingdays.
days.

 For
For purposes
purposes of of project
project directing,
directing, monitoring
monitoring and
and control,
control, itit isis
necessary to
necessary to convert
convert these
these times
times to
to calendar
calendar dates
dates on
on which
which
eachactivity
each activityisisexpected
expectedto tostart
startand
andfinish.
finish.

 This
This isis done
done with
with the
the aid
aid of
of aa calendar
calendar on on which
which the
the working
working
days are
days arenumbered
numberedconsecutively,
consecutively,starting
starting with
with number
number11ononthe
the
anticipatedstart
anticipated startdate
dateand
andskipping
skippingweekends
weekendsand andholidays.
holidays.

4/28/20 03:12 PM
22
Precedence Diagramming
 An important extension to the original activity-on-node
concept appeared around 1964.
 The sole relationship used in PERT/CPM network is
finish to start type of dependency, with Fsij = 0 .
 Precedence diagramming includes precedence
relationships among the activities. In Addition, one
may specify a “lag time” associated with any of the
precedence relationships, which can be used to
account for overlapping times among activities.
 The computation of activity times (published in 1973)
is more complex than AON.

4/28/20 03:12 PM
23
Lag / Lead Times
 In
Inmany
manycases,
cases, therethereisisaadelay
delaybetween
betweenthe thecompletion
completionofofoneoneactivity
activity
and the
and the start
start ofof another
another following
following or
or there
there isis aa need
need toto show
show that
that one
one
activitywill
activity willoverlap
overlapanother
anotherininsome
somefashion.
fashion.

 AA successor
successor "lags"
"lags" aa predecessor,
predecessor, but
but aa predecessor
predecessor "leads"
"leads" aa
successor.
successor.

 Lag
Lag time
time can
can be
be designated
designated on
on aa dependency
dependency line
line with
with aa positive,
positive,
negative,or
negative, orzero
zerovalue.
value.

 Limitations
Limitationsand
andDisadvantages
Disadvantagesof ofLag:
Lag:

 Lag
Lagwould
wouldcomplicate
complicatethe
thescheduling
schedulingprocess.
process.
 Lags
 Lagsare
arenot
notextensively
extensivelyused
usedexcept
exceptwhere
wherethe
thetime
timeeffects
effectsare
are
substantialfor
substantial forspecial
specialproject
projecttype.
type.

4/28/20 03:12 PM
24
Precedence Diagramming Relationships
1. Start-to-Start (SSij)
SSij is equal to the minimum number of time units that
must be complete on the preceding activity (i) prior to the
start of the successor (j). “Lag” is always applied to SS
relation.
2. Finish-to-Finish (FFij)
FFij is equal to the minimum number of time units that must
remain to be completed on the successor (j) after the
completion of the predecessor (i).
3. Finish-to-Start (FSij)
FSij is equal to the minimum number of time units that must
transpire from the completion of the predecessor (i) prior to
the start of the successor (j).
4/28/20 03:12 PM
25
Precedence Diagramming Relationships
4. Start-to-Finish (SFij)
SFij is equal to the minimum number of time units that
must transpire from the start of the predecessor (i) to
the completion of the successor (j).

5. Start-to-Start and Finish-to-Finish (ZZij):

ZZij is a combination of two constraints, i.e., a start-to-
start and finish-to-finish relationship. It is written with
the SSij time units first, followed by the FFij time units.

4/28/20 03:12 PM
26
Precedence Diagram Computation

Forward Pass Computations

Initial Time
EFi + FSij
[1] ESj = Max. all i ESi + SSij
EFi + FFij – Dj
ESi + SFij - Dj

[2] EFj = ESj + Dj

4/28/20 03:12 PM
27
Precedence Diagram Computation

Backward Pass Computations

Terminal Time
LSj - FSij
[3] LFi = Min. all j LFj - FFij
LSj - SSij + Di
LFj - SFij + Di

[4] LSi = LFi  Di

4/28/20 03:12 PM
28
Example
Given the
Given the precedence
precedence network
network for for aa small
small engineering
engineering project
project with
with activity
activity
durations inin working
durations working days,
days, itit isis required
required toto compute
compute the
the activity
activity times
times (ES,
(ES,
EF,LS,
EF, LS,and
andLF) LF)and
andtotal
totalfloats
floats(TF)(TF)andandthen
thenindicate
indicatethe
thecritical
criticalactivities.
activities.

C FF 5 F FS 3 I
3 8 5
SS 8

A FS 2 D ZZ 3,2 J FF 5 L
5 10 6 10

SF 3,4 FS 4
SS 5
E FS 0 H K
4 13 7

4/28/20 03:12 PM
29
Example

C FF 5 F FS 3 I
3 8 5
SS 8

A FS 2 D ZZ 3,2 J FF 5 L
5 10 6 10

SF 3,4 FS 4
SS 5
E FS 0 H K
4 13 7

4/28/20 03:12 PM
30
Example

8 6 11 8 6 16 19 6 24
C FF 5 F FS 3 I
14 3 17 14 8 22 25 5 30
SS 8

0 0 5 7 6 17 13 6 19 20 0 30
A FS 2 D ZZ 3,2 J FF 5 L
0 5 5 13 10 23 19 6 25 20 10 30

SF 3,4 FS 4
SS 5 5 0 9 9 0 22 9 0 16
E FS 0 H K
5 4 9 9 13 22 9 7 16

4/28/20 03:12 PM
31
HAMMOCK ACTIVITY

 An
An activity
activity that
that extends
extends from
from one
one activity
activity to
to another,
another, but
but which
which
hasno
has noestimated
estimatedduration
durationofofits
itsown.
own.

 ItIt isis time-consuming

time-consuming and and requires
requires resources,
resources, but
but its
its duration
duration isis
controlled, not
controlled, not byby its
its own
own nature,
nature, but
but by
by the
the two
two activities
activities
betweenwhich
between whichititspans.
spans.

 Its
Its ES
ES and
and LS LS times
times are
are determined
determined by by the
the activity
activity where
where itit
begins and
begins and its
its EF
EF and
and LF
LF times
times are
are dictated
dictated by
by the
the activity
activity at
at its
its
conclusion.
conclusion.

 Examples:
Examples:Dewatering,
Dewatering,Haul
Haulroad
roadmaintenance
maintenance

4/28/20 03:12 PM
32
MILESTONES

 Milestones
 Milestones are
are points
points inin time
time that
that have
have been
been identified
identified as
as being
being
important intermediate
important intermediate reference
reference pointspoints during
during the the
accomplishmentof
accomplishment ofthe
thework.
work.
 Milestone
 Milestoneevents
eventscan caninclude
includedates
datesimposed
imposedby bythe
thecustomer
customerfor for
the finishing
the finishing of
of certain
certain tasks
tasks as
as well
well as
as target
target dates
dates set
set by
by the
the
project manager
project manager for for the
the completion
completion ofof certain
certain segments
segments of of the
the
work.
work.
 Distinctive
 Distinctivegeometric
geometricfigure
figureisispreferred
preferredto
torepresent
representaamilestone
milestone
(circles,ovals,
(circles, ovals,or
orother
othershapes)
shapes)can canbe
beused.
used.
 Any
 Any information
information pertaining
pertaining to
to aa milestone
milestone and
and considered
considered to
to be
be
usefulmay
useful maybebeentered.
entered.

4/28/20 03:12 PM
33