(Aoa) and (aon) networks

Project Management
Dr. Mahmoud Abbas Mahmoud
Asst. Prof.
2016 - 2017
Activity on Arrow (AOA) and
Activity on Node (AON) Networks
1

Identify for Each Activity:
• Which other activities must be completed
previously (predecessors) ?
• How long time required for completion ?
• What are the required resources ?
2

Project Scheduling
Commonly used techniques:
• Gantt Chart
• Critical Path Method (CPM)
• Program Evaluation and Review Technique
(PERT)
3

Drawing the Project Network
• AOA – Activity on Arrow: networks show
each activity as an arrow, and the nodes
represent the starting and ending points
• AON – Activity on Node: networks show
each activity as a node and arrows show
the immediate predecessor activities
4

A Comparison of AON and
AOA Network Conventions
Activity on Activity Activity on
Node (AON) Meaning Arrow (AOA)
A comes before
B, which comes
before C
(i) A B C
BA C
A and B must both
be completed
before C can start
(ii)
A
C
C
B
A
B
B and C cannot
begin until A is
completed
(iii)
B
A
C
A
B
C
5

A Comparison of AON and AOA
Network Conventions
C and D cannot
begin until both
A and B are
completed
(iv)
A
B
C
D B
A C
D
C cannot begin
until both A and B
are completed; D
cannot begin until
B is completed. A
dummy activity is
introduced in AOA
(v)
CA
B D
Dummy activity
A
B
C
D
6

A Comparison of AON and AOA
Network Conventions
B and C cannot
begin until A is
completed. D
cannot begin
until both B and
C are completed.
A dummy
activity is again
introduced in
AOA.
(vi)
A
C
DB A B
C
D
Dummy
activity
7

Example:
Activity
Immediate
Predecessors
A —
B —
C A
D A, B
E C
F C
G D, E
H F, G

AOA Network
9

AON Network
10

Example:
General Foundry
• Have 16 weeks to install a complex air
filter system on its smokestack
• May be forced to close if not completed
within 16 weeks due to environmental
regulations
• Have identified 8 activities
11

AON Network for General Foundry
13

Activity Time Estimates
14

Determining the Project Schedule
• Some activities can be done simultaneously
so project duration should be less than 25
weeks (the total time of all activities)
• Critical path analysis is used to determine
project duration
• The critical path (CP) is the longest path
through the network
15

Critical Path Analysis
Need to find the following for each activity:
• Earliest Start Time (ES)
• Earliest Finish Time (EF)
• Latest Start Time (LS)
• Latest Finish Time (LF)
16

Performing a Critical Path Analysis
Activity Description Time (weeks)
A Build internal components 2
B Modify roof and floor 3
C Construct collection stack 2
D Pour concrete and install frame 4
E Build high-temperature burner 4
F Install pollution control system 3
G Install air pollution device 5
H Inspect and test 2
Total Time (weeks) 25
Earliest start (ES) = earliest time at which an activity can
start, assuming all predecessors have
been completed
Earliest finish (EF) = earliest time at which an activity can
be finished (completed)
Latest start (LS) = latest time at which an activity can
start so as to not delay the completion
time of the entire project
Latest finish (LF) = latest time by which an activity has to
be finished (completed) so as to not
delay the completion time of the entire
project
AON Network for General
Foundry

A
Activity Name
or Symbol
Earliest
Start ES
Earliest
FinishEF
Latest
Start
LS Latest
Finish
LF
Activity Duration
2

Forward Pass
Begin at starting event and work forward
Earliest Start Time Rule:
 If an activity has only a single immediate
predecessor, its ES equals the EF of the
predecessor
 If an activity has multiple immediate
predecessors, its ES is the maximum of
all the EF values of its predecessors
ES = Max {EF of all immediate predecessors}

Forward Pass
Begin at starting event and work forward
Earliest Finish Time Rule:
 The earliest finish time (EF) of an activity
is the sum of its earliest start time (ES)
and its activity time
EF = ES + Activity time

ES / EF Calculations
Start
0
0
ES
0
EF = ES + Activity time
+
=

Start
0
0
0
A
2
2
EF of A =
(ES of A) + 2
0
ES
of A

B
3
Start
0
0
0
A
2
20
3
EF of B =
(ES of B) + 3
0
ES
of B

C
2
2 4
B
3
0 3
Start
0
0
0
A
2
20

C
2
2 4
B
3
0 3
Start
0
0
0
A
2
20
D
4
73
= Max (2, 3)2 3

D
4
3 7
C
2
2 4
B
3
0 3
Start
0
0
0
A
2
20

E
4
F
3
G
5
H
2
4 8 13 15
4
8 13
7
D
4
3 7
C
2
2 4
B
3
0 3
Start
0
0
0
A
2
20

Backward Pass
Begin with the last event and work backwards
Latest Finish Time Rule:
 If an activity is an immediate predecessor
for just a single activity, its LF equals the
LS of the activity that immediately follows it
 If an activity is an immediate predecessor
to more than one activity, its LF is the
minimum of all LS values of all activities
that immediately follow it
LF = Min {LS of all immediate following activities}

Backward Pass
Begin with the last event and work backwards
Latest Start Time Rule:
 The latest start time (LS) of an activity is
the difference of its latest finish time (LF)
and its activity time
LS = LF – Activity time

LS / LF Calculations
E
4
F
3
G
5
H
2
4 8 13 15
4
8 13
7
D
4
3 7
C
2
2 4
B
3
0 3
Start
0
0
0
A
2
20
LF = EF
of Project
15

E
4
F
3
G
5
H
2
4 8 13 15
4
8 13
7
13 15
D
4
3 7
C
2
2 4
B
3
0 3
Start
0
0
0
A
2
20
13
LS = LF – Activity time

E
4
F
3
G
5
H
2
4 8 13 15
4
8 13
7
13 15
D
4
3 7
C
2
2 4
B
3
0 3
Start
0
0
0
A
2
20
13
13

E
4
F
3
G
5
H
2
4 8 13 15
4
8 13
7
13 15
10 13
8 13
D
4
3 7
C
2
2 4
B
3
0 3
Start
0
0
0
A
2
20
84

E
4
F
3
G
5
H
2
4 8 13 15
4
8 13
7
13 15
10 13
8 13
4 8
D
4
3 7
C
2
2 4
B
3
0 3
Start
0
0
0
A
2
20
LF = Min(4, 10)
42

E
4
F
3
G
5
H
2
4 8 13 15
4
8 13
7
13 15
10 13
8 13
4 8
D
4
3 7
C
2
2 4
B
3
0 3
Start
0
0
0
A
2
20
42
84
20
41
00

Computing Slack Time
After computing the ES, EF, LS, and LF times
for all activities, compute the slack or free
time for each activity
 Slack is the length of time an activity can
be delayed without delaying the entire
project
Slack = LS – ES or Slack = LF – EF

Computing Slack Time
Earliest Earliest Latest Latest On
Start Finish Start Finish Slack = Critical
Activity ES EF LS LF (LS – ES) = (LF – EF) Path
A 0 2 0 2 0 Yes
B 0 3 1 4 1 No
C 2 4 2 4 0 Yes
D 3 7 4 8 1 No
E 4 8 4 8 0 Yes
F 4 7 10 13 6 No
G 8 13 8 13 0 Yes
H 13 15 13 15 0 Yes

Critical Path
E
4
F
3
G
5
H
2
4 8 13 15
4
8 13
7
13 15
10 13
8 13
4 8
D
4
3 7
C
2
2 4
B
3
0 3
Start
0
0
0
A
2
20
42
84
20
41
00

Critical Path
A – C – E – G – H
Completion Time = 15 weeks

(Aoa) and (aon) networks

More Related Content

What's hot (20)

Similar to (Aoa) and (aon) networks (20)

More from Dr. Mahmoud Al-Naimi (20)

Recently uploaded (20)

(Aoa) and (aon) networks