论文信息 - Critical path planning under uncertainty

Critical path planning under uncertainty

This paper concerns a CPM network in which individual job times are random variables. Specifically the time for each job consists of a component which is a linear function of the investment (up to some maximum) in that job and a random variable that is independent of the investment. It is desired to find the minimum investment required as a function of expected project completion time. The problem is solved by a cutting plane technique in which the investment allocations yield feasibility cuts. Because of the special structure of this problem, these cuts can be generated by solving a sequence of longest path problems in an acyclic network.

R. Wollmer

[1] James E. Kelley,et al. Critical-path planning and scheduling , 1899, IRE-AIEE-ACM '59 (Eastern).

[2] James E. Kelley,et al. Critical-Path Planning and Scheduling: Mathematical Basis , 1961 .

[3] D. R. Fulkerson,et al. Flows in Networks. , 1964 .

[4] R. Wets. Programming Under Uncertainty: The Equivalent Convex Program , 1966 .

[5] Frederick S. Hillier,et al. Introduction of Operations Research , 1967 .

[6] Katta G. Murty. Linear programming under uncertainty: A basic property of the optimal solution , 1968 .

[7] Stuart E. Dreyfus,et al. An Appraisal of Some Shortest-Path Algorithms , 1969, Oper. Res..

[8] R. Wets,et al. L-SHAPED LINEAR PROGRAMS WITH APPLICATIONS TO OPTIMAL CONTROL AND STOCHASTIC PROGRAMMING. , 1969 .

[9] Donald M. Topkis,et al. Cutting-Plane Methods without Nested Constraint Sets , 1970, Oper. Res..

[10] B. Eaves,et al. Generalized Cutting Plane Algorithms , 1971 .

[11] Maurice Snowdon,et al. Network Flow Programming , 1980 .

[12] Richard E. Trueman,et al. Quantitative methods for decision making in business , 1982 .

[13] R. Wets,et al. Designing approximation schemes for stochastic optimization problems, in particular for stochastic programs with recourse , 1986 .