Stochastic programming approaches to stochastic scheduling

Practical scheduling problems typically require decisions without full information about the outcomes of those decisions. Yields, resource availability, performance, demand, costs, and revenues may all vary. Incorporating these quantities into stochastic scheduling models often produces diffculties in analysis that may be addressed in a variety of ways. In this paper, we present results based on stochastic programming approaches to the hierarchy of decisions in typical stochastic scheduling situations. Our unifying framework allows us to treat all aspects of a decision in a similar framework. We show how views from different levels enable approximations that can overcome nonconvexities and duality gaps that appear in deterministic formulations. In particular, we show that the stochastic program structure leads to a vanishing Lagrangian duality gap in stochastic integer programs as the number of scenarios increases.

[1]  M. Dempster.  On stochastic programming. II: Dynamic problems under risk , 1988 .

[2]  Sjur Didrik Flåm.  Nonanticipativity in stochastic programming , 1985 .

[3]  Harold J. Kushner.  Necessary conditions for discrete parameter stochastic optimization problems , 1972 .

[4]  Behram Jehanbux Hansotia,et al.  Stochastic Programming , 1995, Optimizations and Programming.

[5]  Dimitris Bertsimas.  A mathematical programming approach to stochastic and dynamic optimization problems , 1994 .

[6]  James C. Bean,et al.  Match-up real-time scheduling , 1985 .

[7]  A. Kan.  Machine Scheduling Problems: Classification, Complexity and Computations , 1976 .

[8]  A.H.G. Rinnooy Kan,et al.  Single‐machine scheduling subject to stochastic breakdowns , 1990 .

[9]  Ezhan Karasan,et al.  A Thermodynamic Theory of Broadband Networks with Application to Dynamic Routing , 1995, IEEE J. Sel. Areas Commun..

[10]  Hong Chen,et al.  Stochastic discrete flow networks : diffusion approximations and bottlenecks , 1991 .

[11]  Kevin D. Glazebrook,et al.  On Nonpreemptive Policies for Stochastic Single-Machine Scheduling with Breakdowns , 1991, Probability in the Engineering and Informational Sciences.

[12]  Moshe Shaked,et al.  Stochastic orders and their applications , 1994 .

[13]  Kevin Mahon,et al.  Deterministic and Stochastic Scheduling , 1983 .

[14]  Kevin D. Glazebrook,et al.  Evaluating the effects of machine breakdowns in stochastic scheduling problems , 1987 .

[15]  R. Rockafellar,et al.  Integral functionals, normal integrands and measurable selections , 1976 .

[16]  J. Harrison,et al.  Brownian motion and stochastic flow systems , 1986 .

[17]  Qing Zhang,et al.  Multilevel Hierarchical Decision Making in Stochastic Marketing-Production Systems , 1995 .

[18]  B. J. Lageweg,et al.  Analysis of Heuristics for Stochastic Programming: Results for Hierarchical Scheduling Problems , 1983, Math. Oper. Res..

[19]  John R. Birge,et al.  The value of the stochastic solution in stochastic linear programs with fixed recourse , 1982, Math. Program..

[20]  George B. Dantzig,et al.  Linear programming and extensions , 1965 .

[21]  L. Young,et al.  Lectures on the Calculus of Variations and Optimal Control Theory. , 1971 .

[22]  David D. Yao,et al.  Multiclass Queueing Systems: Polymatroidal Structure and Optimal Scheduling Control , 1992, Oper. Res..

[23]  Stephen C. Graves,et al.  A Review of Production Scheduling , 1981, Oper. Res..

[24]  M. Wagner,et al.  Generalized Linear Programming Solves the Dual , 1976 .

[25]  K. Glazebrook,et al.  Assessing the effects of machine breakdowns in stochastic scheduling , 1988 .

[26]  Kevin D. Glazebrook,et al.  On nonpreemptive strategies in stochastic scheduling , 1981 .

[27]  Maarten Hendrikus van der Vlerk.  Stochastic programming with integer recourse , 1995 .

[28]  R. Wets,et al.  Epi‐consistency of convex stochastic programs , 1991 .

[29]  S. Ross,et al.  Scheduling Jobs Subject to Nonhomogeneous Poisson Shocks , 1980 .

[30]  R. T. Rockafellart,et al.  Deterministic and stochastic optimization problems of bolza type in discrete time , 1983 .

[31]  James C. Bean,et al.  Matchup Scheduling with Multiple Resources, Release Dates and Disruptions , 1991, Oper. Res..

[32]  Michael Pinedo,et al.  Stochastic Scheduling with Release Dates and Due Dates , 1983, Oper. Res..

[33]  J. A. Buzacott,et al.  Models for Understanding Flexible Manufacturing Systems , 1980 .

[34]  Dimitri P. Bertsekas,et al.  Constrained Optimization and Lagrange Multiplier Methods , 1982 .

[35]  Halil Mete Soner,et al.  Turnpike Sets and Their Analysis in Stochastic Production Planning Problems , 1992, Math. Oper. Res..

[36]  John R. Birge,et al.  A stochastic model for the unit commitment problem , 1996 .

[37]  Dimitris Bertsimas,et al.  Conservation laws, extended polymatroids and multi-armed bandit problems: a unified approach to ind exable systems , 2011, IPCO.

[38]  L. Young.  Lectures on the Calculus of Variations and Optimal Control Theory , 1980 .

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

[40]  John R. Birge,et al.  Optimal Match-up Strategies in Stochastic Scheduling , 1995, Discret. Appl. Math..

[41]  Igor V. Evstigneev,et al.  Stochastic models of control and economic dynamics , 1987 .

[43]  Robert D. Doverspike,et al.  Network planning with random demand , 1994, Telecommun. Syst..

[44]  Kevin D. Glazebrook,et al.  Scheduling stochastic jobs on a single machine subject to breakdowns , 1984 .