MGMT6058 Lecture Notes - Lecture 4: Probability Distribution, Critical Path Method, Longest Path Problem
Document Summary
Forward pass an additive move through the network from the project start to finish. Backward pass a subtractive move through the network from the project finish to start (backwards) Critical path the longest path from end to end which determines the shortest project duration. Ef of predecessor = es of successor. Largest preceding ef at a merge point becomes es for successor. Ls of successor = lf of predecessor. Smallest succeeding ls at a burst point becomes lf for predecessor. The critical path is the network path with no activity slack (f loat) associatedwithit,thismakesitthelongestpath. Shorterpathswould have some activities with positive slack (extra time). Zero f loats and positive slacks are common, but exceptions occur when a specific date or time constraint is used in the project, for example a lf (late finish) entered for the final task. Duration estimation, using terms traditionally applied in cost estimation. Ballpark, or rough order of magnitude (rom), or swag 30%
