9467206
Description
Flashcards by Lukas Berger, updated more than 1 year ago
|
Created by Lukas Berger
almost 7 years ago
|
|
| Question | Answer |
| Network Diagrams |
Image:
Capture (image/png)
|
| AOA Vs. AON Activities on arc vr. Activities on node |
Image:
Capture (image/png)
|
| Node Labels |
Image:
Capture (image/png)
|
| Duration Estimation Methods | • Past experience • Expert opinion • Mathematical derivation – Beta distribution – Most likely (m) – Most pessimistic (b) – Most optimistic (a) |
| Constructing 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 |
| Rules for Forward pass | Forward Pass Rules (ES & EF) – ES + Duration = EF – EF of predecessor = ES of successor – Largest preceding EF at a merge point becomes EF for successor |
| Rules for Backward Pass | Backward Pass Rules (LS & LF) – LF – Duration = LS – LS of successor = LF of predecessor – Smallest succeeding LS at a burst point becomes LF for predecessor |
| Reducing 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 |
Want to create your own Flashcards for free with GoConqr? Learn more.