Statistical PERT: An Improved Project Scheduling Algorithm.

摘要

A project scheduling algorithm is developed and illustrated. For each feasible project deadline time the minimum project cost and corresponding optimal deterministic activity durations are derived. The cost of an activity is assumed to be a convex piecewise linear function of its duration. The algorithm is based upon network-flow techniques including the use of a labeling procedure which preserves complementary slackness. A computer implementation of the algorithm is documented. (Author)