Fichas
Projectmanagement Skript 7 Übung 7
Fichas del conjunto (8)
- 1Network Diagrams
- 2AOA Vs. AON Activities on arc vr. Activities on node
- 3Node Labels
- 4Duration Estimation Methods• Past experience
• Expert opinion
• Mathematical derivation – Beta distribution
– Most likely (m)
– Most pessimistic (b)
– Most optimistic (a) - 5Constructing the Critical Path• Forward pass – an additive move through the network from start to
finish
• Backward pass – a subtractive move through the network from finish to
start
• Critical path – the longest path from end to end which determines the
shortest project length - 6Rules for Forward passForward Pass Rules (ES & EF)
– ES + Duration = EF
– EF of predecessor = ES of successor
– Largest preceding EF at a merge point becomes EF for successor - 7Rules for Backward PassBackward Pass Rules (LS & LF)
– LF – Duration = LS
– LS of successor = LF of predecessor
– Smallest succeeding LS at a burst point becomes LF for predecessor - 8Reducing the Critical Path• Eliminate tasks on the CP
• Convert serial paths to parallel when possible
• Overlap sequential tasks
• Shorten the duration on critical path tasks
• Shorten
– early tasks
– longest tasks
– easiest tasks
– tasks that cost the least to speed up