Bounding the distribution of project duration in PERT networks

We consider the PERT model of a project composed of m activities whose durations are independent random variables with known distributions. We present an algorithm for bounding the project duration distribution from below and above in the sense of stochastic convex ordering. When each activity duration is discrete with at most s possible values, the algorithm can be implemented in O(ms^2) time.