Activity-On-Arrow

Networks
 Introduction
• The Activity-on-Arrow (AOA) network model was
the original network format used in network
scheduling.
• It is sometimes referred to as arrow diagramming,
activity on arc, or I-J.
• The AOA network model supports only
conventional finish-to-start relationships between
activities.
 Basic Elements of an Activity-on-
Arrow (AOA) Networks
Figure below illustrates the basic elements of an
activity-on-arrow network, which include
activities, events, and restraints (dummies).
Activities are noted by arrows, events are
denoted by numbered nodes in the form of a
circle.
Restraints (dummies) , imaginary activities
consume no time or resources, are shown as
dashed arrows, they are included in the
network to maintain schedule logic and
provide a mechanism by which all activities
cab be uniquely identified by their beginning
and ending event numbers.
Primary rule:
All activities that enter a node must be
completed before any activity leaving the node
may be started
 Activity logic
Activity logic is an important part of any
network schedule because it determines the
sequence that activities can or will be carried
out during construction.
 1. Sequential Logic
Sequential activity logic requires that all
activities that logically precede a given activity
be complete before the given activity can be
start. Likewise, all activities that logically
succeed a given activity cannot start until the
given activity is complete.
 Activity Predecessor
A -
B A
C A, B

A B C
 2. Concurrent Logic
Once activity A is completed, activity B and
activity C can begin concurrently and proceed
independent of one another

Activity Predecessor
A -
B A A B
C A

C
 3. Multiple Successor Logic
Any activity in a network can, and often does,
have more than one successor activity. The
completion of activity A preceded the start of
both activities B and C
Activity Predecessor
A -
B A A B
C A

C
 4. Multiple Predecessor Logic
Both activities A and B must be finished before
activity C start.

Activity Predecessor
A -
B - A C
C A, B

B
 5. Combinational Logic
Combinational logic occurs when activities have
both multiple predecessors and successors.

Activity Predecessor
A -
B -
A C
C A, B
D A, B
B D
 Logic Errors and Problems
1. Incorrect logic
The activity logic included in the network
schedule must be correct for the network
schedule to accurately represent the actual
construction process.
2. Redundant logic
Redundant logic is not incorrect but should be
avoided when constructing activity networks.
Redundant logic tends to unnecessarily complicate
an activity network, making modifying and
analyzing more difficult.
3. Logic loops
Activity networks used in construction normally
have a unidirectional flow from the start to
completion of the project. Logic loops violate this
basic premise and result in an impossible
situation where a predecessor activity cannot
start until a successor activity is completed.
 Numbering Restraints
Each activity in an AOA network must have a unique set
of node numbers, which sometimes requires the use of
dummy activities (numbering restrains) that are inserted
into a network logic for the sole purpose of providing a
unique set of node numbers for parallel or concurrent
activities.
Numbering restraints can either be pre-activity or post-
activity restraints. Both methods achieve the objective of
assigning unique node numbers to each activity.
 Activity Predecessor B
A - 5 A 10 15 D 20
B A
C A C
12
D B, C

12 B
B
5 A 10 15 D 20
5 A 10 15 D 20

C
12
C
12
B
5 A 10 15 D 20

C
 Activity Predecessor Activity Predecessor
A - A -
B - B -
C A, B C B
D A D A,B

A D A D

B C B C

Dummy activities are inserted into a network to preserve the logic

between activities .
Hint:
Any time you have too many activities going in
and out of a node double check the logic
Example: Draw the AOA network for the
following project
Activity A B C D E F
Depends upon - A A B C D, E
Example: Draw the AOA network for the
following project
Activity C D F G L M Z
Depends upon - - C, D D F, G F, G M
Example: construct an Activity-on-Arrow network based on the activity
description below. Remove any redundant dependencies and label
dummy activities dummy1, dummy2, etc.
1. A represents starting of the job
2. B, C, D follows A and can be carried out at the same time
3. E follows D
4. F depends on both C and D
5. G follows B
6. H follows E
7. Z cannot be taken up before completion of F, G and H
Example: construct an Activity-on-Arrow network based on the activity
description below. Remove any redundant dependencies and label
dummy activities dummy1, dummy2, etc.
1. Activities D, M and B start the project.
2. Activity E1 depends on activity M.
3. The successors to activity B are activities E1, S, W and D2.
4. Activity C can start when activities D, E1 and S are completed
5. Activity R cannot begin until activity W is finished.
6. Activity E follows activities C and R.
7. Activity Y follows activities C and R and followed by activity L.
8. The predecessors to activity Z2 are activities L, C and R.
9. Activities U and F follow activities W and D2, and precede activities E
and R1
10. Activity I follow activity D and precede activity L.
Activity Predecessors
B, D, M -
E1 M, B
W B
S B
D2 B
C D, E1, S
R W
E C, R, U, F
Y C, R
C and R are
L Y, I redundant
Z2 L, C, R
R1 U, F
U W, D2
F W, D2
I D
Example: Draw the Activity-on-Arrow network for the following activities.
Remove any redundant dependencies and label dummy activities as
dummy1, dummy2, etc.

Activity A B C D E F G H I J K L
Predecessor - - A, B B C C, D F F F G H, I, J E, K

C E
A
Dummy1 Dummy2 J K L
B G
D F H
Dummy3
I
Test your self: construct an Activity-on-Arrow network based on the
activity description below. Remove any redundant dependencies and
label dummy activities dummy1, dummy2, etc.
1. A and B represent starting of the job and can be carried out at the
same time
2. C follows A
3. D and E can be executed at the same time after completion of B
4. K and F can be executed at the same time after completion of A and
D
5. G follows E
6. J cannot start before completion of C and K
7. H follows F and J
8. Z can be started when G and H are finished
9. Z is the last activity