Analysing the AoA network Project Management (seminar)

Total Project Time The minimum time in which the project can be completed. Calculation: forward pass Forward pass: calculating the earliest event times (EETs) and the earliest start times (ESTs) of all activities. Earliest Finishing Time = EST + Duration

Critical path Path: continuous series of project activities connected by logical relationships as designated in the project schedule network diagram. 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 Event Times (LETs) and the Latest Finishing Times (LFTs). Latest Starting Time = Latest Finishing Time - Duration

Activity times & event times EET = EST of all emerging activities LET = LFT of all entering activities Deadline Activity identifier Duration 1 2 EET LET

TPT & LET 14 14 1 2 a 14 TPT = 14

Float on activity ‘a’: 20 14 14 1 2 a 6 20 Float: 6

4 6 5 Calculate the… EET of event 6 LETs of event 4 and 5 22 ? 5 24 6 44 d e 8 10 Calculate the… EET of event 6 LETs of event 4 and 5 ESTs and EFTs of activity ‘d’ and ‘e’

4 6 5 EST and EFT of ‘d’: 22 and 30 EST and EFT of ‘e’: 24 and 34 8 4 d 26 34 6 34 24 5 10 e 24 EST and EFT of ‘d’: 22 and 30 EST and EFT of ‘e’: 24 and 34 LST and LFT of ‘d’: 26 and 34 LST and LFT of ‘e’: 24 and 34

15 ? 30 10 a 10 ? 20 ? 35 12 b 25 ? 8 c

15 20 30 10 a 10 17 20 22 35 12 b 25 18 8 c

Calculate all event and activity times and the float-times, find the critical path:

Activity times for the previous diagram EST LST EFT LFT A B C D E G H J K

Activity times for the previous diagram EST LST EFT LFT A 8 16 24 B 20 C 21 30 51 D 35 E 29 39 G 36 38 H J 31 K 50

Four characteristics of the critical path It starts at the first node It is continuous It ends at the last node It has no float

Readings Lockyer – Gordon (2005) Chapter 13

Thanks for the attention!