Modeling and solving real-time scheduling problems by stochastic integer programming

This contribution deals with scheduling problems of flexible chemical batch processes with a special emphasis on their real-time character. This implies not only the need for sufficiently short response times, but in particular the burden of in-complete knowledge about the future. To solve such problems, the application of two-stage stochastic integer programming techniques on moving horizons is proposed. They reflect the need for immediately applicable decisions and the potential of later recourse actions to cope with realized uncertainties. In addition to the classical expected value objective, simple measures of risk can be included. Motivated by an example process, some essential modeling prerequisites are discussed. As an important first step, the master scheduling problem is studied and a number of master scheduling models are presented. Large mixed-integer linear problems arise, which are well-suited for a dual decomposition approach. Numerical experiments with a problem-specific solution algorithm demonstrate the applicability of the method to real-world problems.

[1]  Martin Grötschel,et al.  Online optimization of large scale systems , 2001 .

[2]  Joseph F. Pekny,et al.  The curse of reality — why process scheduling optimization problems are difficult in practice , 2000 .

[3]  I. Kuban Altinel,et al.  Scheduling of batch processes with operational uncertainties , 1996 .

[4]  Informationstechnik Berlin,et al.  Dual Decomposition in Stochastic Integer Programming , 1996 .

[5]  S. Engell,et al.  Intelligent scheduling of chemical plants: a constraint programming approach , 1999, Proceedings of the 1999 IEEE International Symposium on Intelligent Control Intelligent Systems and Semiotics (Cat. No.99CH37014).

[6]  Sebastian Engell,et al.  Aggregated Scheduling of a Multiproduct Batch Plant by Two-Stage Stochastic Integer Programming , 2002 .

[7]  John R. Birge,et al.  Introduction to Stochastic Programming , 1997 .

[8]  Gintaras V. Reklaitis,et al.  A framework for schedule evaluation with processing uncertainty , 1999 .

[9]  D. Lewin,et al.  Synthesis of flexible and reliable short-term batch production plans , 1996 .

[10]  O. Stursberg,et al.  Continuous-discrete interactions in chemical processing plants , 2000, Proceedings of the IEEE.

[11]  I. Grossmann,et al.  A novel branch and bound algorithm for scheduling flowshop plants with uncertain processing times , 2002 .

[12]  Gintaras V. Reklaitis,et al.  Issues in the use, design and evolution of process scheduling and planning systems , 1997 .

[13]  M. Ierapetritou,et al.  Robust short-term scheduling of multiproduct batch plants under demand uncertainty , 2001 .

[14]  Matthew H. Bassett,et al.  Decomposition techniques for the solution of large-scale scheduling problems , 1996 .

[15]  Sebastian Engell,et al.  Sequencing of batch operations for a highly coupled production process: Genetic algorithms versus mathematical programming , 1998 .

[16]  H. P. Williams,et al.  Model Building in Mathematical Programming , 1979 .

[17]  Costas D. Maranas,et al.  Multiperiod Planning and Scheduling of Multiproduct Batch Plants under Demand Uncertainty , 1997 .

[18]  Luis Puigjaner,et al.  Batch production and preventive maintenance scheduling under equipment failure uncertainty , 1997 .

[19]  Rüdiger Schultz,et al.  Risk Aversion via Excess Probabilities in Stochastic Programs with Mixed-Integer Recourse , 2003, SIAM J. Optim..

[20]  Christian Schulz,et al.  Online Scheduling of Multiproduct Batch Plants under Uncertainty , 2001 .

[21]  R. Sargent,et al.  A general algorithm for short-term scheduling of batch operations */I , 1993 .