Drawing AOA and AON networks Project Management lecture
![Drawing AOA and AON networks Project Management (lecture) Drawing AOA and AON networks Project Management (lecture)](https://slidetodoc.com/presentation_image_h/844285b5cca44ff87169c943a663e710/image-1.jpg)
![Activity on Arrow (Ao. A) diagrams Activity on Arrow (Ao. A) diagrams](https://slidetodoc.com/presentation_image_h/844285b5cca44ff87169c943a663e710/image-2.jpg)
![Elements of an Ao. A (Activity-on-Arrow) diagram • Activity (arrow) – Work element or Elements of an Ao. A (Activity-on-Arrow) diagram • Activity (arrow) – Work element or](https://slidetodoc.com/presentation_image_h/844285b5cca44ff87169c943a663e710/image-3.jpg)
![Conventions • Time flows from left to right – Arrows’ direction – Labels’ order Conventions • Time flows from left to right – Arrows’ direction – Labels’ order](https://slidetodoc.com/presentation_image_h/844285b5cca44ff87169c943a663e710/image-4.jpg)
![Graphical representation • • Arrows, nodes, bending Identification of activities Representation of time Representation Graphical representation • • Arrows, nodes, bending Identification of activities Representation of time Representation](https://slidetodoc.com/presentation_image_h/844285b5cca44ff87169c943a663e710/image-5.jpg)
![Dependency rule b depends on a (b is a successor of a): 12 a Dependency rule b depends on a (b is a successor of a): 12 a](https://slidetodoc.com/presentation_image_h/844285b5cca44ff87169c943a663e710/image-6.jpg)
![Consequences of the dependency rule • An event cannot be realised until all activities Consequences of the dependency rule • An event cannot be realised until all activities](https://slidetodoc.com/presentation_image_h/844285b5cca44ff87169c943a663e710/image-7.jpg)
![Merge and burst nodes • Merge nodes: – Events into which a number of Merge and burst nodes • Merge nodes: – Events into which a number of](https://slidetodoc.com/presentation_image_h/844285b5cca44ff87169c943a663e710/image-8.jpg)
![Two typical errors in logic • Looping: underlying logic must be at fault 5 Two typical errors in logic • Looping: underlying logic must be at fault 5](https://slidetodoc.com/presentation_image_h/844285b5cca44ff87169c943a663e710/image-9.jpg)
![Interfacing • When an event is common to two or more subnetworks it is Interfacing • When an event is common to two or more subnetworks it is](https://slidetodoc.com/presentation_image_h/844285b5cca44ff87169c943a663e710/image-10.jpg)
![Milestones • Events which have been identified as being of particular importance in the Milestones • Events which have been identified as being of particular importance in the](https://slidetodoc.com/presentation_image_h/844285b5cca44ff87169c943a663e710/image-11.jpg)
![Multiple starts and finishes • Only used in computer programs • All starting activities Multiple starts and finishes • Only used in computer programs • All starting activities](https://slidetodoc.com/presentation_image_h/844285b5cca44ff87169c943a663e710/image-12.jpg)
![Hammock activities • Artificial activities created for the representation of the overhead cost with Hammock activities • Artificial activities created for the representation of the overhead cost with](https://slidetodoc.com/presentation_image_h/844285b5cca44ff87169c943a663e710/image-13.jpg)
![Hammock activity 1 12 a 2 1 b 0 h (hammock) 3 2 c Hammock activity 1 12 a 2 1 b 0 h (hammock) 3 2 c](https://slidetodoc.com/presentation_image_h/844285b5cca44ff87169c943a663e710/image-14.jpg)
![Dummy activities • Activities that do not require resources but may in some cases Dummy activities • Activities that do not require resources but may in some cases](https://slidetodoc.com/presentation_image_h/844285b5cca44ff87169c943a663e710/image-15.jpg)
![Identity dummies • When two or more parallel activities have the same tail and Identity dummies • When two or more parallel activities have the same tail and](https://slidetodoc.com/presentation_image_h/844285b5cca44ff87169c943a663e710/image-16.jpg)
![Logic dummies • When two chains of activities have a common node yet they Logic dummies • When two chains of activities have a common node yet they](https://slidetodoc.com/presentation_image_h/844285b5cca44ff87169c943a663e710/image-17.jpg)
![Logic dummy example: What is the difference? 2 5 c a g e 4 Logic dummy example: What is the difference? 2 5 c a g e 4](https://slidetodoc.com/presentation_image_h/844285b5cca44ff87169c943a663e710/image-18.jpg)
![Transit time dummies • If a delay must occur after the competition of an Transit time dummies • If a delay must occur after the competition of an](https://slidetodoc.com/presentation_image_h/844285b5cca44ff87169c943a663e710/image-19.jpg)
![Overlapping activities • If the activities are not fully discrete • The second activity Overlapping activities • If the activities are not fully discrete • The second activity](https://slidetodoc.com/presentation_image_h/844285b5cca44ff87169c943a663e710/image-20.jpg)
![Activity on Node (Ao. N) diagrams Activity on Node (Ao. N) diagrams](https://slidetodoc.com/presentation_image_h/844285b5cca44ff87169c943a663e710/image-21.jpg)
![Graphical representation • Rectangles instead of circles • Representation of dependency time: lags (no Graphical representation • Rectangles instead of circles • Representation of dependency time: lags (no](https://slidetodoc.com/presentation_image_h/844285b5cca44ff87169c943a663e710/image-22.jpg)
![Elements of an Ao. N diagram • Activity (node) – Work element or task Elements of an Ao. N diagram • Activity (node) – Work element or task](https://slidetodoc.com/presentation_image_h/844285b5cca44ff87169c943a663e710/image-23.jpg)
![CPA, CPM and PERT • Critical Path Analysis (CPA), Critical Path Method (CPM) – CPA, CPM and PERT • Critical Path Analysis (CPA), Critical Path Method (CPM) –](https://slidetodoc.com/presentation_image_h/844285b5cca44ff87169c943a663e710/image-24.jpg)
![Readings • Lockyer – Gordon (2005) Chapter 11 -12 Readings • Lockyer – Gordon (2005) Chapter 11 -12](https://slidetodoc.com/presentation_image_h/844285b5cca44ff87169c943a663e710/image-25.jpg)
![Thanks for the attention! Thanks for the attention!](https://slidetodoc.com/presentation_image_h/844285b5cca44ff87169c943a663e710/image-26.jpg)
- Slides: 26
![Drawing AOA and AON networks Project Management lecture Drawing AOA and AON networks Project Management (lecture)](https://slidetodoc.com/presentation_image_h/844285b5cca44ff87169c943a663e710/image-1.jpg)
Drawing AOA and AON networks Project Management (lecture)
![Activity on Arrow Ao A diagrams Activity on Arrow (Ao. A) diagrams](https://slidetodoc.com/presentation_image_h/844285b5cca44ff87169c943a663e710/image-2.jpg)
Activity on Arrow (Ao. A) diagrams
![Elements of an Ao A ActivityonArrow diagram Activity arrow Work element or Elements of an Ao. A (Activity-on-Arrow) diagram • Activity (arrow) – Work element or](https://slidetodoc.com/presentation_image_h/844285b5cca44ff87169c943a663e710/image-3.jpg)
Elements of an Ao. A (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
![Conventions Time flows from left to right Arrows direction Labels order Conventions • Time flows from left to right – Arrows’ direction – Labels’ order](https://slidetodoc.com/presentation_image_h/844285b5cca44ff87169c943a663e710/image-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.
![Graphical representation Arrows nodes bending Identification of activities Representation of time Representation Graphical representation • • Arrows, nodes, bending Identification of activities Representation of time Representation](https://slidetodoc.com/presentation_image_h/844285b5cca44ff87169c943a663e710/image-5.jpg)
Graphical representation • • Arrows, nodes, bending Identification of activities Representation of time Representation of deadlines (external constraints)
![Dependency rule b depends on a b is a successor of a 12 a Dependency rule b depends on a (b is a successor of a): 12 a](https://slidetodoc.com/presentation_image_h/844285b5cca44ff87169c943a663e710/image-6.jpg)
Dependency rule b depends on a (b is a successor of a): 12 a 1 2 13 b and c are independent from each other: 1 12 a 13 b 3 8 c 4 2
![Consequences of the dependency rule An event cannot be realised until all activities Consequences of the dependency rule • An event cannot be realised until all activities](https://slidetodoc.com/presentation_image_h/844285b5cca44ff87169c943a663e710/image-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.
![Merge and burst nodes Merge nodes Events into which a number of Merge and burst nodes • Merge nodes: – Events into which a number of](https://slidetodoc.com/presentation_image_h/844285b5cca44ff87169c943a663e710/image-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.
![Two typical errors in logic Looping underlying logic must be at fault 5 Two typical errors in logic • Looping: underlying logic must be at fault 5](https://slidetodoc.com/presentation_image_h/844285b5cca44ff87169c943a663e710/image-9.jpg)
Two typical errors in logic • Looping: underlying logic must be at fault 5 6 e f g 7 • Dangling: an activity is undertaken with no result 1 star t a 2 c b 3 4 5 d end
![Interfacing When an event is common to two or more subnetworks it is Interfacing • When an event is common to two or more subnetworks it is](https://slidetodoc.com/presentation_image_h/844285b5cca44ff87169c943a663e710/image-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 ab 21 13 aa 13 12 22 ba ac bc bb bd 24 24
![Milestones Events which have been identified as being of particular importance in the Milestones • Events which have been identified as being of particular importance in the](https://slidetodoc.com/presentation_image_h/844285b5cca44ff87169c943a663e710/image-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/1/2014 1 a 2 b 3
![Multiple starts and finishes Only used in computer programs All starting activities Multiple starts and finishes • Only used in computer programs • All starting activities](https://slidetodoc.com/presentation_image_h/844285b5cca44ff87169c943a663e710/image-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.
![Hammock activities Artificial activities created for the representation of the overhead cost with Hammock activities • Artificial activities created for the representation of the overhead cost with](https://slidetodoc.com/presentation_image_h/844285b5cca44ff87169c943a663e710/image-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.
![Hammock activity 1 12 a 2 1 b 0 h hammock 3 2 c Hammock activity 1 12 a 2 1 b 0 h (hammock) 3 2 c](https://slidetodoc.com/presentation_image_h/844285b5cca44ff87169c943a663e710/image-14.jpg)
Hammock activity 1 12 a 2 1 b 0 h (hammock) 3 2 c 4
![Dummy activities Activities that do not require resources but may in some cases Dummy activities • Activities that do not require resources but may in some cases](https://slidetodoc.com/presentation_image_h/844285b5cca44ff87169c943a663e710/image-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
![Identity dummies When two or more parallel activities have the same tail and Identity dummies • When two or more parallel activities have the same tail and](https://slidetodoc.com/presentation_image_h/844285b5cca44ff87169c943a663e710/image-16.jpg)
Identity dummies • When two or more parallel activities have the same tail and head nodes. 4 1 a b 3 2 3
![Logic dummies When two chains of activities have a common node yet they Logic dummies • When two chains of activities have a common node yet they](https://slidetodoc.com/presentation_image_h/844285b5cca44ff87169c943a663e710/image-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
![Logic dummy example What is the difference 2 5 c a g e 4 Logic dummy example: What is the difference? 2 5 c a g e 4](https://slidetodoc.com/presentation_image_h/844285b5cca44ff87169c943a663e710/image-18.jpg)
Logic dummy example: What is the difference? 2 5 c a g e 4 1 b f d 3 7 h 6 2 4 c 6 e g a 1 8 b 3 d 5 f 7 h
![Transit time dummies If a delay must occur after the competition of an Transit time dummies • If a delay must occur after the competition of an](https://slidetodoc.com/presentation_image_h/844285b5cca44ff87169c943a663e710/image-19.jpg)
Transit time dummies • If a delay must occur after the competition of an activity before the successor activity can start. 2 2 a 2 4 1 c 1 5 2 b 3 2 d
![Overlapping activities If the activities are not fully discrete The second activity Overlapping activities • If the activities are not fully discrete • The second activity](https://slidetodoc.com/presentation_image_h/844285b5cca44ff87169c943a663e710/image-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. 10 a 1 1 3 a 1 15 b 2 2 7 a 2 3 3 15 b 5
![Activity on Node Ao N diagrams Activity on Node (Ao. N) diagrams](https://slidetodoc.com/presentation_image_h/844285b5cca44ff87169c943a663e710/image-21.jpg)
Activity on Node (Ao. N) diagrams
![Graphical representation Rectangles instead of circles Representation of dependency time lags no Graphical representation • Rectangles instead of circles • Representation of dependency time: lags (no](https://slidetodoc.com/presentation_image_h/844285b5cca44ff87169c943a663e710/image-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 2 2 a 2 4 c 1 1 5 2 b 3 2 d Convert the Ao. A network above to an Ao. N diagram a 2 2 c 1 START FINISH b 2 d 2
![Elements of an Ao N diagram Activity node Work element or task Elements of an Ao. N diagram • Activity (node) – Work element or task](https://slidetodoc.com/presentation_image_h/844285b5cca44ff87169c943a663e710/image-23.jpg)
Elements of an Ao. N 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
![CPA CPM and PERT Critical Path Analysis CPA Critical Path Method CPM CPA, CPM and PERT • Critical Path Analysis (CPA), Critical Path Method (CPM) –](https://slidetodoc.com/presentation_image_h/844285b5cca44ff87169c943a663e710/image-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
![Readings Lockyer Gordon 2005 Chapter 11 12 Readings • Lockyer – Gordon (2005) Chapter 11 -12](https://slidetodoc.com/presentation_image_h/844285b5cca44ff87169c943a663e710/image-25.jpg)
Readings • Lockyer – Gordon (2005) Chapter 11 -12
![Thanks for the attention Thanks for the attention!](https://slidetodoc.com/presentation_image_h/844285b5cca44ff87169c943a663e710/image-26.jpg)
Thanks for the attention!
Aoa vs aon diagram
Contoh soal pert dan penyelesaiannya
Aon network
Project planning and management lecture notes ppt
Comparison of virtual circuit and datagram networks
01:640:244 lecture notes - lecture 15: plat, idah, farad
Project procurement management lecture notes
4 p's of project management in software engineering
Project quality management lecture notes
Software cost estimation notes
Project management lecture
Traditional project management vs modern project management
Backbone networks in computer networks
Aoa operations management
Aon global risk consulting
Drawing lecture
Drawing lecture
Engineering drawing
The role of project management in achieving project success
Process discriminants in software project management
Reasons for reducing project duration
Modern project management began with what project
What is strategic assessment in software project management
When conducting post project audits
Ms project agile
Type n terminations
Isometric projections cannot be drawn by