drawing aoa and aon networks
DESCRIPTION
Drawing AOA and AON networks. Project Management (lecture). Activity on Arrow (AoA) diagrams. Elements of an AoA (Activity-on-Arrow) diagram. Activity (arrow) Work element or task Can be real or not real Name or identification of the tasks (label) must be added Event (node) - PowerPoint PPT PresentationTRANSCRIPT
![Page 1: Drawing AOA and AON networks](https://reader033.vdocuments.site/reader033/viewer/2022061520/56812ef2550346895d949450/html5/thumbnails/1.jpg)
Drawing AOA and AON networks
Project Management
(lecture)
![Page 2: Drawing AOA and AON networks](https://reader033.vdocuments.site/reader033/viewer/2022061520/56812ef2550346895d949450/html5/thumbnails/2.jpg)
Activity on Arrow (AoA)diagrams
![Page 3: Drawing AOA and AON networks](https://reader033.vdocuments.site/reader033/viewer/2022061520/56812ef2550346895d949450/html5/thumbnails/3.jpg)
Elements of an AoA (Activity-on-Arrow) diagram• Activity (arrow)
– Work element or task– Can be real or not real– Name or identification of the tasks (label)
must be added
• Event (node)– The start and/or finish of one or more
activities– Tail (preceding) and head (succeeding) nodes
![Page 4: Drawing AOA and AON networks](https://reader033.vdocuments.site/reader033/viewer/2022061520/56812ef2550346895d949450/html5/thumbnails/4.jpg)
Conventions• Time flows from left to right
– Arrows’ direction
– Labels’ order
• Head nodes always have a number (or label) higher that of the tail node. This is the same with the arrow labels (alphabetic order).
• Activity labels are placed below the arrow (despite the pictures in the textbook), duration of activity is based above the arrow
• A network has only one starting and only one ending event.• These conventions are not universal. There are many other
to choose from.
![Page 5: Drawing AOA and AON networks](https://reader033.vdocuments.site/reader033/viewer/2022061520/56812ef2550346895d949450/html5/thumbnails/5.jpg)
Graphical representation
• Arrows, nodes, bending
• Identification of activities
• Representation of time
• Representation of deadlines (external constraints)
![Page 6: Drawing AOA and AON networks](https://reader033.vdocuments.site/reader033/viewer/2022061520/56812ef2550346895d949450/html5/thumbnails/6.jpg)
Dependency rule
b depends on a (b is a successor of a):
b and c are independent from each other:
1 2 3a b
3
4
21
b
c
a
12 13
13
12
8
![Page 7: Drawing AOA and AON networks](https://reader033.vdocuments.site/reader033/viewer/2022061520/56812ef2550346895d949450/html5/thumbnails/7.jpg)
Consequences of the dependency rule
• An event cannot be realised until all activities leading to it are complete.
• No activity can start until its tail event is realised.
![Page 8: Drawing AOA and AON networks](https://reader033.vdocuments.site/reader033/viewer/2022061520/56812ef2550346895d949450/html5/thumbnails/8.jpg)
Merge and burst nodes
• Merge nodes:– Events into which a number of activities enter
and one (or several) leave.
• Burst nodes:– Events that have one (or more) entering
activities generating a number of emerging activities.
![Page 9: Drawing AOA and AON networks](https://reader033.vdocuments.site/reader033/viewer/2022061520/56812ef2550346895d949450/html5/thumbnails/9.jpg)
Two typical errors in logic
• Looping: underlying logic must be at fault
• Dangling: an activity is undertaken with no result
2 4 5enda c d
1star
t
3
b
5 6
7
e
fg
![Page 10: Drawing AOA and AON networks](https://reader033.vdocuments.site/reader033/viewer/2022061520/56812ef2550346895d949450/html5/thumbnails/10.jpg)
Interfacing
• When an event is common to two or more subnetworks it is said to be an ‘interface’ event between those subnetworks and is represented by a pair of concentric circles.
11 13
13
aa
acab
21ba
24bc
24bb bd
1222
![Page 11: Drawing AOA and AON networks](https://reader033.vdocuments.site/reader033/viewer/2022061520/56812ef2550346895d949450/html5/thumbnails/11.jpg)
Milestones
• Events which have been identified as being of particular importance in the progress of the project.
• Identified by an inverted triangle over the event node (occasionally with an imposed time for the event)
1 2 3a b
1/1/20141/1/2014
![Page 12: Drawing AOA and AON networks](https://reader033.vdocuments.site/reader033/viewer/2022061520/56812ef2550346895d949450/html5/thumbnails/12.jpg)
Multiple starts and finishes
• Only used in computer programs
• All starting activities can occur at the start and all finish activities will occur at the end of the project.
![Page 13: Drawing AOA and AON networks](https://reader033.vdocuments.site/reader033/viewer/2022061520/56812ef2550346895d949450/html5/thumbnails/13.jpg)
Hammock activities
• Artificial activities created for the representation of the overhead cost with the aim of cost control.
• Embrace activities belong to the same cost centre
• Zero duration time (not taking part in the time analysis)
• Overhead cost rate is assumed to be constant over the life of the hammock.
![Page 14: Drawing AOA and AON networks](https://reader033.vdocuments.site/reader033/viewer/2022061520/56812ef2550346895d949450/html5/thumbnails/14.jpg)
Hammock activity
1 2 3 4ba c
h(hammock)
h(hammock)
12 1 2
0
![Page 15: Drawing AOA and AON networks](https://reader033.vdocuments.site/reader033/viewer/2022061520/56812ef2550346895d949450/html5/thumbnails/15.jpg)
Dummy activities
• Activities that do not require resources but may in some cases take time.
• They are drawn as broken arrows.
• They are always subject to the basic dependency rule.
• Thre occassions to use dummies:– Identity dummies– Logic dummies– Transit time dummies
![Page 16: Drawing AOA and AON networks](https://reader033.vdocuments.site/reader033/viewer/2022061520/56812ef2550346895d949450/html5/thumbnails/16.jpg)
Identity dummies
• When two or more parallel activities have the same tail and head nodes.
1 3
2
a
b
4
3
![Page 17: Drawing AOA and AON networks](https://reader033.vdocuments.site/reader033/viewer/2022061520/56812ef2550346895d949450/html5/thumbnails/17.jpg)
Logic dummies
• When two chains of activities have a common node yet they are at least partly independent of each other. Hint: examine ANY crossroads.
• Example:– Activitiy c depends on activity a– Activity d depends on activities a and b
• Solution: – separate c from b with a dummy activity
![Page 18: Drawing AOA and AON networks](https://reader033.vdocuments.site/reader033/viewer/2022061520/56812ef2550346895d949450/html5/thumbnails/18.jpg)
Logic dummy example:What is the difference?
2 5
4
a
b3 6
71
g
f
e
d
c
h
2 64
a
b3 7
81
g
f
e
d
c
h5
![Page 19: Drawing AOA and AON networks](https://reader033.vdocuments.site/reader033/viewer/2022061520/56812ef2550346895d949450/html5/thumbnails/19.jpg)
Transit time dummies
• If a delay must occur after the competition of an activity before the successor activity can start.
22 4
a
b3
1
d
c
5
2
2 2
1
![Page 20: Drawing AOA and AON networks](https://reader033.vdocuments.site/reader033/viewer/2022061520/56812ef2550346895d949450/html5/thumbnails/20.jpg)
Overlapping activities• If the activities are not fully discrete
• The second activity can start before the first is completed but not before it is at least partly completed.
1 2a 3b
10 15
b
1 2 3a1 a2
5
3 7
15
![Page 21: Drawing AOA and AON networks](https://reader033.vdocuments.site/reader033/viewer/2022061520/56812ef2550346895d949450/html5/thumbnails/21.jpg)
Activity on Node (AoN)diagrams
![Page 22: Drawing AOA and AON networks](https://reader033.vdocuments.site/reader033/viewer/2022061520/56812ef2550346895d949450/html5/thumbnails/22.jpg)
Graphical representation• Rectangles instead of circles
• Representation of dependency time: lags(no dummy activities are used)
• Artifical Start and Finish activities are used when needed, to have only one beginning and end of the diagram
a2
b2
c1
d2
START FINISH
2
2 4
a
b3
1
d
c
5
2
2 2
1
2
Convert the AoA network above to an AoN diagram
![Page 23: Drawing AOA and AON networks](https://reader033.vdocuments.site/reader033/viewer/2022061520/56812ef2550346895d949450/html5/thumbnails/23.jpg)
Elements of an AoN diagram
• Activity (node)– Work element or task– Name or identification of the tasks must be
added– No need for dummy (unreal) activities
• Dependency or sequence arrow– Shows the interrelationship between activities
![Page 24: Drawing AOA and AON networks](https://reader033.vdocuments.site/reader033/viewer/2022061520/56812ef2550346895d949450/html5/thumbnails/24.jpg)
CPA, CPM and PERT• Critical Path Analysis (CPA), Critical
Path Method (CPM)– deterministic with only one estimation
• Program Evaluation and Review Technique (PERT)– probabilistic with three estimated durations
![Page 25: Drawing AOA and AON networks](https://reader033.vdocuments.site/reader033/viewer/2022061520/56812ef2550346895d949450/html5/thumbnails/25.jpg)
Readings
• Lockyer – Gordon (2005) Chapter 11-12
![Page 26: Drawing AOA and AON networks](https://reader033.vdocuments.site/reader033/viewer/2022061520/56812ef2550346895d949450/html5/thumbnails/26.jpg)
Thanks for the attention!