Download presentation
Presentation is loading. Please wait.
Published byFrederick McKinney Modified over 9 years ago
1
Analysing the AoN network Project Management (seminar)
2
Activity label & description Data on the activity node ESTEFT Duration LSTLFT Total Float
3
Total Project Time The shortest time in which the project can be completed. Determined by the critical path. Calculation: forward pass Forward pass: The earliest start times (EST) of all activities are calculated. Trom these the earliest finishing times (EFT) are also calculated
4
Critical path sequence of activities that has no float time, and that determines the duration of the project. It is the longest path. Activities on the critical path are the critical activities. The critical path can be identified by a backward pass, calculating the Latest Finishing Times (LFT), and from these the Latest Starting Times (LST).
5
Floats in AoN Total float: the time by which an activity can be delayed or extended without affecting the TPT. It can be used to delay the start of an activity or to increase its duration. TF = LST - EST Free float: the time by which an activity can be delayed or extended without affecting the start of any succeding activity. FF = EST j+1 - EFT j
6
Example: organising a conference Objectives: to organise a 3 days long open scientific conference with 100-200 participants, 30-50 lectures, buffet reception, a conference book of the best studies and TV and radio interviews with some of the most known lecturers. Create the WBS chart and create the task list with estimated durations and precedence relations (in a table form) Plot both the AoA and AoN diagram Calculate the TPT, identify the critical path the total and the free float times.
7
Example: WBS Project BookMarketing Event management Organising interviews Editing Collecting articles Publishing Peer reviewing Arranging event Infra- structure Organising participants StaffFacilitiesMaterials Invitation and marketing
8
Activity label Task descriptionDurationImmediate predecessors a Invitation b Organising participants c Facilities d Staffing e Materials h Collecting articles j Peer reviewing k Publishing l Organising interviews m Arranging event Activity label Task descriptionDuration (weeks) Immediate predecessors a Invitation2 b Organising participants4 c Facilities3 d Staffing4 e Materials3 h Collecting articles6 j Peer reviewing3 k Publishing5 l Organising interviews1 m Arranging event1 Activity label Task descriptionDuration (weeks) Immediate predecessors a Invitation2– b Organising participants4a c Facilities3b d Staffing4b e Materials3b f Collecting articles6b g Peer reviewing3f h Organising interviews1c, d, e i Publishing5g j Arranging event1h, i Task list with precedence relations
9
AoA 1 0 0 3 6 6 2 2 2 4 9 19 5 10 19 6 10 19 7 12 8 15 9 20 10 21 2a2a 3e3e 4d4d 3 4b4b c f 6 3g3g i 1h1h 5 1j1j TPT = 21 CP: a-b-f-g-i-j
10
AoN a 0 20 0 2 2 b 2 60 2 6 4 f 6 120 6 6 e 6 910 16 19 3 d 6 106 15 19 4 c 6 910 16 19 3 g 12 150 12 15 3 i 200 15 20 5 j 210 20 21 1 h 10 119 19 20 1 1 0 0 0 0 0 0 0 1 9 TPT: 21 CP: a-b-f-g-i-j
11
Activity times for the previous diagram (continue individually) ActivityDurationESTLSTEFTLFTTotal float Free float a2020200 b4262600 C3691619101 d e f g h i j
12
Example 2 (for individual practice) a) Draw the AoA and AoN diagram with the data below: Activity label Duration (weeks) Immediate predecessors a 1– b 2a c 5a d 3a e 2b f 2e g 4f, c, d b) Determine the TPT and the critical path and activity floats. c) Compute the EETs, LETs and slack for every node in the AoA & ESTs, LSTs, EFTs, LFTs in the AoN diagram.
13
Solution: AoA 1 0 0 4 4 7 5 5 5 3 3 3 2 1 1 6 7 7 1a1a 2e2e 2b2b 5c5c 3d3d 4g4g 2f2f 7 11 TPT: 11 CP: a-b-e-f-g Float: 0 T. float: 3 F. float: 3 Float: 0 Slack: 0 Slack: 3 Slack: 0 T. float: 1 F. float: 1 0
14
Solution: AoN a 0 10 0 1 1 0 b 1 30 1 3 2 c 1 61 2 7 5 0 d 1 43 4 7 3 3 f 5 70 5 7 2 e 3 50 3 2 2 1 g 7 110 7 4 0 0 0 TPT: 11 CP: a-b-e-f-g
15
Example 3 1 0 0 4 2 5 3 5 5 2 2 2 5 8 8 2a2a 3e3e 2b2b 5c5c 3d3d 4g4g 7 14 6 12 14 1f1f 2h2h a)Calculate the EETs and LETs. b)Create a precedence table (with task, duration, immediate predecessor, total and free floats). 0
16
Solution ActivityDurationTotal float Free float a200 b200 C511 d333 e300 f155 g400 h200
17
Readings Lockyer – Gordon (2005) Chapter 14.
18
Thanks for the attention!
Similar presentations
© 2024 SlidePlayer.com. Inc.
All rights reserved.