Abstract
Based on some earlier work by Wollmer on how to approximate the expected time-cost curve for a random pert network, we demonstrate how it is possible to instead find a curve that bounds the true expected time-cost curve from below. This is done by showing how the necessary cuts can be generated based on different bounding procedures from the literature.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have