Scheduling under Uncertainty: Bounding the Makespan Distribution

Deterministic models for project scheduling and control suffer from the fact that they assume complete information and neglect random influences that occur during project execution. A typical consequence is the underestimation of the expected project duration and cost frequently observed in practice. This phenomenon occurs even in the absence of resource constraints, and has been the subject of extensive research in discrete mathematics and operations research. This article presents a survey on the reasons for this phenomenon, its complexity, and on methods how to obtain more relevant information. To this end, we consider scheduling models with fixed precedence constraints, but (independent) random processing times. The objective then is to obtain information about the distribution of the project makespan. We will demonstrate that this is an #P-complete problem in general, and then consider several combinatorial methods to obtain approximate information about the makespan distribution.

[1]  J. Scott Provan,et al.  The Complexity of Counting Cuts and of Computing the Probability that a Graph is Connected , 1983, SIAM J. Comput..

[2]  I. Rival.  Algorithms and Order , 1988 .

[3]  Vidyadhar G. Kulkarni,et al.  A classified bibliography of research on stochastic PERT networks: 1966-1987 , 1989 .

[4]  F. J. Radermacher,et al.  Chapter 4 – THE ORDER-THEORETIC APPROACH TO SCHEDULING: THE STOCHASTIC CASE , 1989 .

[5]  Jane N. Hagstrom,et al.  Computational complexity of PERT problems , 1988, Networks.

[6]  Rolf H. Möhring,et al.  Scheduling under uncertainty: Optimizing against a randomizing adversary , 2000, APPROX.

[7]  J. Kamburowski,et al.  OPTIMAL REDUCTION OF TWO-TERMINAL DIRECTED ACYCLIC GRAPHS * , 1992 .

[8]  Dmitrij I Golenko.  Statistische Methoden der Netzplantechnik , 1972 .

[9]  George B. Kleindorfer,et al.  Bounding Distributions for a Stochastic Acyclic Network , 1971, Oper. Res..

[10]  Bajis M. Dodin,et al.  Bounding the Project Completion Time Distribution in PERT Networks , 1985, Oper. Res..

[11]  Rolf H. Möhring,et al.  Computationally Tractable Classes of Ordered Sets , 1989 .

[12]  Nobuji Saito,et al.  Linear-time computability of combinatorial problems on series-parallel graphs , 1982, JACM.

[13]  Zvi Drezner,et al.  A Multivariate Approach to Estimating the Completion Time for PERT Networks , 1986 .

[14]  Eugene L. Lawler,et al.  The recognition of Series Parallel digraphs , 1979, SIAM J. Comput..

[15]  Andrew W. Shogan.  Bounding distributions for a stochastic pert network , 1977, Networks.

[16]  J. J. Martin.  Distribution of the Time Through a Directed, Acyclic Network , 1965 .

[17]  Bajis M. Dodin.  Determining the K Most Critical Paths in PERT Networks , 1984, Oper. Res..

[18]  D. Sculli,et al.  An approximate solution to the pert problem , 1991 .

[19]  D. R. Fulkerson.  Expected Critical Path Lengths in PERT Networks , 1962 .

[20]  Roman Słowiński,et al.  Advances in project scheduling , 1989 .

[21]  Rolf H. Möhring,et al.  A Computational Study on Bounding the Makespan Distribution in Stochastic Project Networks , 2001, Ann. Oper. Res..

[22]  Valeska Naumann.  Measuring the Distance to Series-Parallelity by Path Expressions , 1994, WG.

[23]  Isaac Meilijson,et al.  Convex majorization with an application to the length of critical paths , 1979, Journal of Applied Probability.

[24]  Narsingh Deo,et al.  Complexity of the minimum-dummy-activities problem in a pert network , 1979, Networks.