Time Planning and Control

Activity on Arrow
(Arrow Diagramming Method)

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

1.Visualize
1. Visualizeand
anddefine
definethe
the activities.
activities.
2.Sequence
2. Sequencethe
the activities
activities(Job
(Job Logic).
Logic).
3.Estimate
3. Estimate the
the activity
activity duration.
duration.
4.Schedule
4. Schedule the
the project
project or
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 update
update
asnecessary.
as necessary.
7.Control
7. Control the
thetime
time schedule
schedulewith
withrespect
respect to
to changes.
changes.

2 4/28/20 03:12 PM
ARROW DIAGRAM
1)Each
1) Each time-consuming
time-consuming activity
activity (task)
(task) isis portrayed
portrayed by
by an
an
arrow.
arrow.
Order and deliver the
Activity new machine
] Duration] ] 30]

2)The
2) The tail
tailand
andhead
head ofof the
the arrow
arrow denote
denote the
the start
start and
andfinish
finishof
of
theactivity
the activitywhilst
whilstits
itsduration
durationisisshown
shownininbrackets
bracketsbelow.
below.

3)The
3) The length
length of
of the
the arrow
arrow has
has no
no significance
significance neither
neither has
has its
its
orientation.
orientation.

3 4/28/20 03:12 PM
ARROW DIAGRAM
4)As
4) Asmeans
meansof offurther
furtherdefining
definingthe
thepoint
pointin
intime
timewhen
whenananactivity
activity
startsor
starts orfinishes,
finishes,start
startand
andfinish
finishevents
eventsare
areadded.
added.

5)An
5) An event
event (=
(= node
node == connector),
connector), unlike
unlike an
an activity,
activity, does
does not
not
consume time
consume time or
or resources,
resources, itit merely
merely represents
represents aa point
point in
in
timeat
time atwhich
whichsomething
somethingor
orsome
somethings
thingshappen.
happen.

6)Numbers
6) Numbers are
are given
given to
to the
the events
events to
to provide
provide aa unique
unique identity
identity
toeach
to eachactivity.
activity.

7)The
7) Thefirst
first event
eventininaa project
project schedule
schedule isisthe
thestart
startof
ofthe
the project.
project.
Thelast
The lastevent
eventin
inaaproject
projectschedule
scheduleisisthe
theend
endof ofthe
theproject.
project.

4 4/28/20 03:12 PM
Activity Identification
Start Event Finish Event

Activity
10 20
[Duration]

Activity identification numbers

called event numbers

5 4/28/20 03:12 PM
i-j Numbers of Events

i j

Activity

Duration

The node at the tail of an arrow is the i-node.

The node at the head of an arrow is the j-node

6 4/28/20 03:12 PM
Rules of Making Arrow Diagram
1)The
1) The network
network (the
(the graphical
graphical representation
representation of
of aa project
project plan)
plan) must
must
havedefinite
have definitepoints
pointsofofbeginning
beginningand andfinish.
finish.
(The accuracy
(The accuracy and
and usefulness
usefulness of of aa network
network isis dependent
dependent mainly
mainly
upon intimate
upon intimate knowledge
knowledge of
of the
the project
project itself,
itself, and
and upon
upon the
the general
general
qualitiesof
qualities ofjudgment
judgmentand
andskill
skillof
ofthe
theplanning
planningpersonnel.)
personnel.)

2)The
2) Thearrows
arrowsoriginate
originateat
atthe
theright
rightside
sideof
ofaanode
nodeand
andterminate
terminateat
atthe
the
leftside
left sideof
ofaanode.
node.

3)Any
3) Any two
two events
events may
may be
be directly
directly connected
connected by
by no
no more
more than
than one
one
activity.
activity.

4)Use
4) Usesymbols
symbolsto
toindicate
indicatecrossovers
crossoversto
toavoid
avoidmisunderstanding.
misunderstanding.

7 4/28/20 03:12 PM
Logical Relationships

A B
10 20 30

 Node “20” is the j-node for activity “A” and it is also

the i-node for activity “B” then activity “A” is a
predecessor to activity “B”.
 In other words activity “B” is a successor to activity
“A”.
 Activity B depends on activity A.

8 4/28/20 03:12 PM
Logical Relationships
Succeeding activities
30

10 20 40

50

 Event numbers must not be duplicated in a network.

 j-node number greater than i-node number.

9 4/28/20 03:12 PM
Logical Relationships
Concurrent activities

80
180

120 170

190
160

10 4/28/20 03:12 PM
Rules of Making Arrow Diagram
5) The
5) The network
network must
must be
be aa logical
logical representation
representation ofof all
all the
the
activities. Where
activities. Where necessary,
necessary, "dummy
"dummy activities"
activities" are
are used
used
for:
for:
 Unique
Uniquenumbering
numberingand
and
 Logical
 Logicalsequencing.
sequencing.

Dummy activity
Dummy activity isis an
an arrow
arrow that that represents
represents merely
merely aa
dependency of
dependency of one
one activity
activity upon upon another.
another. AA dummy
dummy
activity carries
activity carries aa zero
zero time.
time. ItIt isis also
also called
called dependency
dependency
arrow.
arrow.

11 4/28/20 03:12 PM
Dummy Activities
 The following network shows incorrect activity numbering.

A 90

50 70 80 100

60 110

12 4/28/20 03:12 PM
Dummy Activities
 For unique numbering, use dummies.

75 90
A

50 70 80 100

60 110

13 4/28/20 03:12 PM
Dummy Activities
For representing logical relationships, you may need dummies.

10 30 50 70 90 110

20 40 60 80 100 120

14 4/28/20 03:12 PM
Rules of Making Arrow Diagram
There must
There must be be no
no "looping"
"looping" inin the
the network.
network. The
The loop
loop isis an
an
indication of
indication of faulty
faulty logic.
logic. The
The definition
definition of
of one
one or
or more
more of
of the
the
dependencyrelationships
dependency relationshipsisisnot
notvalid.
valid.

90 100 120 130

110

15 4/28/20 03:12 PM
Rules of Making Arrow Diagram
Thenetwork
The networkmust
mustbe
becontinuous
continuous(without
(withoutunconnected
unconnectedactivities).
activities).

30 60 100

10 20 50 90 120

40 70 110

80

16 4/28/20 03:12 PM
Rules of Making Arrow Diagram
Networksshould
Networks shouldhave
haveonly
onlyone
oneinitial
initialevent
eventand
andonly
onlyone
oneterminal
terminalevent.
event.

30 60

10 20 50 90 120

40 70 110

17 4/28/20 03:12 PM
Rules of Making Arrow Diagram
6. Before
6. Before anan activity
activity may
may begin,
begin, all
all activities
activities preceding
preceding itit
must be
must be completed
completed (the(the logical
logical relationship
relationship between
between
activities isis finish
activities finishto
to start).
start).

18 4/28/20 03:12 PM
Network Analysis (Computation)
1. Occurrence times of Events = Early and late
timings of event occurrence = Early and late
event times

Earliest
Event

Activity Time Activity

Event
Label Latest
Event
Head Tail
Time

Standard layout for recording data

19 4/28/20 03:12 PM
Early Event Time (EET = E =TE)
Early Event Time (Earliest occurrence time for event) is the earliest time
at which an event can occur, considering the duration of precedent activities.

Forward Pass for Computing EET

Each activity starts as soon as possible, i.e., as soon as all of its
predecessor activities are completed.
1. Direction: Left to right, from the beginning to the end of the project
2. Set: EET of the initial node = 0
3. Add: EETj = EETi + Dij
4. Take the maximum
The estimated project duration = EET of the last node.

EETi Activity EETj

i j
Dij

20 4/28/20 03:12 PM
Early Event Times (EET = E =TE)

0 A 3 B 4 C 12
10 20 30 40
3 1 8

21 4/28/20 03:12 PM
Early Event Times (TE)

4 K
40

15 L
70 24
80
9

12 M
50

22 4/28/20 03:12 PM
Early Event Times (TE)

20 50
3

2 3
4

30 70
10
4
5

7
60
3

40 1

23 4/28/20 03:12 PM
Early Event Times (TE)
2
20 50 8
3

2 3
4

0 4 16
30 70
10
4
5

9 7
60
3
3
40 1

24 4/28/20 03:12 PM
Late Event Time (LET = L =TL)
Late Event Time (Latest occurrence time of event) is the latest
time at which an event can occur, if the project is to be completed on
schedule.

Backward Pass for Computing LET

1. Direction: Right to left, from the end to the beginning of the project
2. Set: LET of the last (terminal) node = EET for it
3. Subtract: LETi = LETj - Dij
4. Take the minimum

EETi Activity EETj

i j
LETi Dij LETj

25 4/28/20 03:12 PM
Late Event Times (TL)

8
50
13

16
60
9 16
40 7

26 4/28/20 03:12 PM
Late Event Times (TL)
2
20 50 8

2
3
4

0 4 16
10 30 70
4

9 7
60
3
3
40 1

27 4/28/20 03:12 PM
Late Event Times (TL)
2
20 50 8
10 3 13

2
3
4

0 4 16
10 30 70
0 4 4 16

9 7
60
3 9
3
40 1
8

28 4/28/20 03:12 PM
Network Analysis (Computation)
2. Activity Times (Schedule)
1. Early Start (ES): The earliest time at which an activity can
be started.
ESij = EETi
2. Early Finish (EF): The earliest time at which an activity can
be completed.
EFij = ESij + Dij
3. Late Finish (LF): The latest time at which an activity can be
completed without delaying project completion.
LFij = LETj
4. Late Start (LS): The latest time at which an activity can be
started.
LSij = LFij  Dij

29 4/28/20 03:12 PM
Example: Activity Times
2
20 50 8
10 3 13

2
3
4

0 4 16
10 30 70
0 4 4 16

9 7
60
3 9
3
40 1
ES20-50 = EET20 = 2
8
EF20-50 = ES + D = 2 + 3 = 5
LF20-50 = LET50 = 13
LS20-50 = LF – D = 13 – 3 = 10

30 4/28/20 03:12 PM
Network Analysis (Computation)
3. Activity Floats

1. Total Float (TF)

 Total float or path float is the amount of time that

an activity’s completion may be delayed without
extending project completion time.

 Total float or path float is the amount of time that

an activity’s completion may be delayed without
affecting the earliest start of any activity on the
network critical path.

31 4/28/20 03:12 PM
Network Analysis (Computation)
3. Activity Floats

1. Total Float (TF)

 Total path float time for activity (i-j) is the total float
associated with a path.
 For arbitrary activity (ij), the total float can be
written as:
Path Float =Total Float (TFij)
= LSij  ESij
= LFij  EFij
= LETj – EETi  Dij

32 4/28/20 03:12 PM
Example: Total Float Times
2
20 50 8
10 3 13

2 3
4

0 4 16
10 30 70
0 4 4 16

9 7
3 60

9 TF20-50 = LS20-50 - ES20-50

3 TF20-50 = 10 – 2 = 8
40 1
8 TF20-50 = LF20-50 - EF20-50
TF20-50 = 13 – 5 = 8
TF20-50 = LET50 – EET20 - D20-50
TF20-50 = 13 – 2 - 3 = 8

33 4/28/20 03:12 PM
Network Analysis (Computation)
3. Activity Floats
2. Free Float (FF)
 Free float or activity float is the amount of time that an
activity’s completion time may be delayed without affecting
the earliest start of succeeding activity.
 Activity float is “owned” by an individual activity, whereas path
or total float is shared by all activities along a slack path.
 Total float equals or exceeds free float (TF ≥ FF).
 For arbitrary activity (ij), the free float can be written as:
Activity Float = Free Float (FFij)
= ESjk  EFij
= EETj – EETi  Dij

34 4/28/20 03:12 PM
Example: Free Float Times

2
20 50 8
10 3 13

2 3
4

0 4 16
10 30 70
0 4 4 16

9 7
3 60

9
3
40 1 FF20-50 = ES50-70 - EF20-50
8 FF20-50 = 8 – 5 = 3
FF20-50 = EET50 – EET20 - D20-50
FF20-50 = 8 – 2 - 3 = 3

35 4/28/20 03:12 PM
Network Analysis (Computation)
3. Activity Floats
3. Interfering Float (ITF)
 Interfering float is the difference between TF and FF.
 If ITF of an activity is used, the start of some succeeding
activities will be delayed beyond its ES.
 In other words, if the activity uses its ITF, it “interferes” by this
amount with the early times for the down path activity.
 For arbitrary activity (ij), the Interfering float can be written
as:
Interfering Float (ITFij)
= TFij  FFij
= LETj  EETj

36 4/28/20 03:12 PM
Example: Interfering Float Times

2
20 50 8
10 3 13

2 3
4

0 4 16
10 30 70
0 4 4 16

9 7
3 60

9
3
40 1 ITF20-50 = TF20-50 - FF20-50
8 IFF20-50 = 8 – 3 = 5
ITF20-50 = LET50 – EET50
ITF20-50 = 13 – 8 = 5

37 4/28/20 03:12 PM
Network Analysis (Computation)
3. Activity Floats
4. Independent Float (IDF)
 It is the amount of float which an activity will always possess
no matter how early or late it or its predecessors and
successors are.
 The activity has this float “independent” of any slippage of
predecessors and any allowable start time of successors.
Assuming all predecessors end as late as possible and
successors start as early as possible.
 IDF is “owned” by one activity.
 In all cases, independent float is always less than or equal to
free float (IDF ≤ FF).

38 4/28/20 03:12 PM
Network Analysis (Computation)
3. Activity Floats
4. Independent Float (IDF)
 For arbitrary activity (ij), the Independent Float can be
written as:
Independent Float (IDFij)
= Max (0, EETj  LETi – Dij)
= Max (0, Min (ESjk) - Max (LFhi)  Dij)

39 4/28/20 03:12 PM
Example: Independent Float Times

2
20 50 8
10 3 13

2 3
4

0 4 16
10 30 70
0 4 4 16

9 7
3 60

9
3
40 1
8
IDF20-50 = Max. (0, [EET50 – LET20 - D20-50])
IDF20-50 = Max. (0, [8 – 10 – 3]) = 0

40 4/28/20 03:12 PM
Network Analysis (Computation)
4. Critical Path

 Critical path is the path with the least total float = The
longest path through the network.

5. Subcritical Paths

 Subcritical paths have varying degree of path float and hence

depart from criticality by varying amounts.
 Subcritical paths can be found in the following way:
1. Sort the activities in the network by their path float, placing
those activities with a common path float in the same group.
2. Order the activities within a group by early start time.
3. Order the groups according to the magnitude of their path float,
small values first.

41 4/28/20 03:12 PM
Example
Draw an
Draw an arrow
arrow diagram
diagram toto represent
represent the the following
following project.
project. Calculate
Calculate
occurrencetimes
occurrence timesof
ofevents,
events,activity
activitytimes,
times,andandactivity
activityfloats.
floats.Also
Alsodetermine
determine
thecritical
the criticalpath
pathand
andthe
thedegree
degreeofofcriticality
criticalityofofother
otherfloat
floatpaths.
paths.

Activity Preceding Activity Time (days)

A None 5
B A 7
C A 4
D A 8
E B 6
F D 8
G E, C, F 3
H G 4
I G 6

42 4/28/20 03:12 PM
Example
Activity on
Activity onarrow
arrownetwork
networkand
andoccurrence
occurrencetimes
timesof
of events
events

12
30 28
70
15 30
B E
[6] H
[7] [4]
0 A 5 C 21 G 24 I 30
10 20 50 60 80
0 5 [4] 21 24 6 30
[5] [3]
D F
[8] [8]
13
40
13

43 4/28/20 03:12 PM
Example
Activity times
Activity timesand
andactivity
activityfloats
floats

Activity ES EF LF LS TF FF ITF IDF

A 0 5 5 0 0 0 0 0
B 5 12 15 8 3 0 3 0
C 5 9 21 17 12 12 0 12
D 5 13 13 5 0 0 0 0
E 12 18 21 15 3 3 0 0
F 13 21 21 13 0 0 0 0
G 21 24 24 21 0 0 0 0
H 24 28 30 26 2 2 0 2
I 24 30 30 24 0 0 0 0

44 4/28/20 03:12 PM
Example
Criticalpath
Critical pathand
andsubcritical
subcriticalpaths
paths

Activity ES EF LF LS TF Criticality
A 0 5 5 0 0
D 5 13 13 5 0
Critical Path
F 13 21 21 13 0
G 21 24 24 21 0
I 24 30 30 24 0
H 24 28 30 26 2 a “near critical” path
B 5 12 15 8 3 Third most critical path
E 12 18 21 15 3
C 5 9 21 17 12 Path having most float

45 4/28/20 03:12 PM
Case Study

Installationof
Installation ofaanew
newmachine
machineand
andtraining
trainingthe
theoperator
operator

Activity Activity Description Depends Level Duration

Code on (day)
100 Inspect the machine after installation 300 4 1
200 Hire the operator None 1 25
300 Install the new machine 500, 400 3 2
400 Inspect and store the machine after delivery 700 2 1
500 Hire labor to install the new machine None 1 20
600 Train the operator 200, 300 4 3
700 Order and deliver the new machine None 1 30

46 4/28/20 03:12 PM
 Case Study: Installation of a New Machine and Training the Operator

33
50
33
or
perat

Tr era
the o

op
ain tor
Hire

th
e
3
25

Install Inspect
Hire labor to install the new machine 31 33 36
0 the m. the m.
10 30 40 60
0 O 20 31 33 1 36
m rde 2

ne
hi
ac r
r y ac
hi &
ne ve m
de
eli he
liv
rd t

er
te ct
af spe

th
e
In

30
20
30

47 4/28/20 03:12 PM
 Case Study: Installation of a New Machine and Training the Operator

 Activity
Activitytimes
timesand
andactivity
activityfloats
floats
Activity i-j number ES EF LS LF TF FF ITF IDF
Hire the operator 10-50 0 25 8 33 8 8 0 8
Hire labor to install the machine 10-30 0 20 11 31 11 11 0 11
Order and deliver the machine 10-20 0 30 0 30 0 0 0 0
Inspect the m. after delivery 20-30 30 31 30 31 0 0 0 0
Install the machine 30-40 31 33 31 33 0 0 0 0
Inspect the machine 40-60 33 34 35 36 2 2 0 2
Train the operator 50-60 33 36 33 36 0 0 0 0

 Criticalpath:
Critical path:10-20,
10-20,20-30,
20-30,30-40,
30-40,50-60.
50-60.
 Nearcritical
Near criticalpath:
path:40-60
40-60
 Thirdmost
Third mostcritical
criticalpath:
path:10-50
10-50
 Pathhaving
Path havingmost
mostfloat:
float:10-30
10-30

48 4/28/20 03:12 PM