Abstract : This paper describes a comprehensive new procedure for determining a minimum cost project schedule when the activities making up the project have durations which are random variables. The cost of an activity is assumed to be a convex piecewise linear function of the activity's mean duration. The objective is to determine the activity mean durations which both minimize the total project cost and insure that the mean of the corresponding project completion time distribution is less than or equal to a specified project deadline. The entire distribution of the project's completion time under the minimum cost schedule is a valuable by-product.
[1]
D. R. Fulkerson.
A Network Flow Computation for Project Cost Curves
,
1961
.
[2]
R L Sielken,et al.
Statistical PERT: An Improved Subnetwork Analysis Procedure
,
1975
.
[3]
R L Sielken,et al.
Statistical PERT: Decomposing a Project Network
,
1975
.
[4]
Cynthia S Dunn,et al.
Statistical Pert: An Improved Project Scheduling Algorithm.
,
1977
.
[5]
L. Ringer.
Numerical Operators for Statistical PERT Critical Path Analysis
,
1969
.
[6]
A. W. Wortham,et al.
A Statistical Theory for PERT Critical Path Analysis
,
1966
.