On the solution of large-scale mixed integer programming scheduling models

Abstract In this paper, we show how four recently developed modeling and solution methods can be integrated to address mixed integer programs for the scheduling of large-scale chemical production systems. The first method uses multiple discrete time grids. The second adds tightening constraints that lower bound the total production and number of batches for each task and material based on the customer demand, while the third generates upper bounding constraints based on inventory and resource availability. The final method is a reformulation that introduces a new integer variable representing the total number of batches of a task. We apply the aforementioned methods to large-scale problems with a variety of processing features, including variable conversion coefficients, changeovers, various storage policies, continuous processing tasks, setups, and utilities, using a discrete-time model. We illustrate how these methods lead to significant improvements in computational performance.

[1]  Christos T. Maravelias,et al.  A branch-and-bound algorithm for the solution of chemical production scheduling MIP models using parallel computing , 2013, Comput. Chem. Eng..

[2]  Ignacio E. Grossmann,et al.  New general continuous-time state-task network formulation for short-term scheduling of multipurpose batch plants , 2003 .

[3]  I. Grossmann,et al.  A Mixed-Integer Linear Programming Model for Short-Term Scheduling of Single-Stage Multiproduct Batch Plants with Parallel Lines , 1997 .

[4]  Olaf Stursberg,et al.  Scheduling of multi-product batch plants based upon timed automata models , 2008, Comput. Chem. Eng..

[5]  Egon Balas,et al.  The Shifting Bottleneck Procedure for Job Shop Scheduling , 1988 .

[6]  L. Biegler,et al.  Extended Discrete-Time Resource Task Network Formulation for the Reactive Scheduling of a Mixed Batch/Continuous Process , 2014 .

[7]  Christos T. Maravelias,et al.  Reformulations and Branching Methods for Mixed-Integer Programming Chemical Production Scheduling Models , 2013 .

[8]  Iiro Harjunkoski,et al.  An MILP-Based reordering algorithm for complex industrial scheduling and rescheduling , 2001 .

[9]  Christodoulos A. Floudas,et al.  Continuous-Time Optimization Approach for Medium-Range Production Scheduling of a Multiproduct Batch Plant , 2002 .

[10]  Nilay Shah,et al.  Improving the efficiency of discrete time scheduling formulation , 1998 .

[11]  Monique Guignard-Spielberg,et al.  Hybridizing discrete- and continuous-time models for batch sizing and scheduling problems , 2006, Comput. Oper. Res..

[12]  C. Pantelides,et al.  Optimal Campaign Planning/Scheduling of Multipurpose Batch/Semicontinuous Plants. 1. Mathematical Formulation , 1996 .

[13]  Jaime Cerdá,et al.  State-of-the-art review of optimization methods for short-term scheduling of batch processes , 2006, Comput. Chem. Eng..

[14]  J. M. Pinto,et al.  A Continuous Time Mixed Integer Linear Programming Model for Short Term Scheduling of Multistage Batch Plants , 1995 .

[15]  Lazaros G. Papageorgiou,et al.  A hybrid MILP/CLP algorithm for multipurpose batch process scheduling , 2005, Comput. Chem. Eng..

[16]  Christos T. Maravelias,et al.  Preprocessing and tightening methods for time-indexed MIP chemical production scheduling models , 2016, Comput. Chem. Eng..

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

[18]  Pedro M. Castro,et al.  Scope for industrial applications of production scheduling models and solution methods , 2014, Comput. Chem. Eng..

[19]  Christos T. Maravelias,et al.  Multiple and nonuniform time grids in discrete-time MIP models for chemical production scheduling , 2013, Comput. Chem. Eng..

[20]  Christos T. Maravelias,et al.  Modeling of Storage in Batching and Scheduling of Multistage Processes , 2008 .

[21]  R. Sargent,et al.  The optimal operation of mixed production facilities—a general formulation and some approaches for the solution , 1996 .

[22]  Jaime Cerdá,et al.  Dynamic scheduling in multiproduct batch plants , 2003, Comput. Chem. Eng..

[23]  Christos T. Maravelias,et al.  Valid Inequalities Based on Demand Propagation for Chemical Production Scheduling MIP Models , 2013 .

[24]  Philippe Baptiste,et al.  Constraint - based scheduling : applying constraint programming to scheduling problems , 2001 .

[25]  G. Reklaitis,et al.  Continuous Time Representation Approach to Batch and Continuous Process Scheduling. 1. MINLP Formulation , 1999 .

[26]  Iftekhar A. Karimi,et al.  A simpler better slot-based continuous-time formulation for short-term scheduling in multipurpose batch plants , 2005 .

[27]  H. Ku,et al.  Scheduling in serial multiproduct batch processes with finite interstage storage: mixed integer linear program formulation , 1988 .

[28]  Nilay Shah,et al.  RTN-based rolling horizon algorithms for medium term scheduling of multipur-pose plants , 1997 .

[29]  Christos T Maravelias,et al.  Advances in mixed-integer programming methods for chemical production scheduling. , 2014, Annual review of chemical and biomolecular engineering.

[30]  F. Blomer,et al.  LP-based heuristics for scheduling chemical batch processes , 2000 .

[31]  Christos T. Maravelias,et al.  General framework and modeling approach classification for chemical production scheduling , 2012 .

[32]  Danielle Zyngier,et al.  Hierarchical decomposition heuristic for scheduling: Coordinated reasoning for decentralized and distributed decision-making problems , 2008, Comput. Chem. Eng..

[33]  A. Barbosa‐Póvoa,et al.  An Improved RTN Continuous-Time Formulation for the Short-term Scheduling of Multipurpose Batch Plants , 2001 .

[34]  Dan Wu,et al.  Decomposition approaches for the efficient solution of short-term scheduling problems , 2003, Comput. Chem. Eng..

[35]  Andres F. Merchan,et al.  Tightening methods for continuous‐time mixed‐integer programming models for chemical production scheduling , 2013 .

[36]  Pedro M. Castro,et al.  Optimal scheduling of continuous plants with energy constraints , 2011, Comput. Chem. Eng..

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

[38]  Luis Puigjaner,et al.  MIP-based decomposition strategies for large-scale scheduling problems in multiproduct multistage batch plants: A benchmark scheduling problem of the pharmaceutical industry , 2010, Eur. J. Oper. Res..

[39]  Christos T. Maravelias,et al.  A General Framework for Process Scheduling , 2011 .

[40]  C. Floudas,et al.  Effective Continuous-Time Formulation for Short-Term Scheduling. 1. Multipurpose Batch Processes , 1998 .

[41]  Ignacio E. Grossmann,et al.  A hybrid MILP/CP decomposition approach for the continuous time scheduling of multipurpose batch plants , 2004, Comput. Chem. Eng..

[42]  Christos T. Maravelias,et al.  Theoretical framework for formulating MIP scheduling models with multiple and non-uniform discrete-time grids , 2015, Comput. Chem. Eng..

[43]  John N. Hooker,et al.  Logic, Optimization, and Constraint Programming , 2002, INFORMS J. Comput..

[44]  J. Hooker,et al.  Logic-Based Methods for Optimization: Combining Optimization and Constraint Satisfaction , 2000 .

[45]  Rainer E. Burkard,et al.  Review, extensions and computational comparison of MILP formulations for scheduling of batch processes , 2005, Comput. Chem. Eng..

[46]  Gabriela P. Henning,et al.  A novel network-based continuous-time representation for process scheduling: Part II. General framework , 2009, Comput. Chem. Eng..

[47]  Christos T. Maravelias,et al.  Simultaneous Batching and Scheduling Using Dynamic Decomposition on a Grid , 2009, INFORMS J. Comput..

[48]  J. Carlier,et al.  An algorithm for solving the job-shop problem , 1989 .

[49]  C. Maravelias,et al.  Computational Study of Network-Based Mixed-Integer Programming Approaches for Chemical Production Scheduling , 2011 .

[50]  Christos T. Maravelias,et al.  A decomposition framework for the scheduling of single- and multi-stage processes , 2006, Comput. Chem. Eng..

[51]  C. Pantelides,et al.  A simple continuous-time process scheduling formulation and a novel solution algorithm , 1996 .

[52]  Christos T. Maravelias,et al.  Batch selection, assignment and sequencing in multi-stage multi-product processes , 2008, Comput. Chem. Eng..

[53]  Ignacio E. Grossmann,et al.  Decomposition techniques for multistage scheduling problems using mixed-integer and constraint programming methods , 2002 .

[54]  R. Sargent,et al.  A general algorithm for short-term scheduling of batch operations—II. Computational issues , 1993 .

[55]  Vipul Jain,et al.  Algorithms for Hybrid MILP/CP Models for a Class of Optimization Problems , 2001, INFORMS J. Comput..

[56]  Christos T. Maravelias,et al.  Mixed-Integer Programming Model and Tightening Methods for Scheduling in General Chemical Production Environments , 2013 .

[57]  Jeffrey D. Kelly,et al.  Multi-Product Inventory Logistics Modeling in the Process Industries , 2009 .

[58]  Nikhil Gupta,et al.  Three‐index Model for Westenberger‐Kallrath Benchmark Scheduling Problem , 2010 .

[59]  B. A. Calfa,et al.  Hybrid Bilevel-Lagrangean Decomposition Scheme for the Integration of Planning and Scheduling of a Network of Batch Plants , 2013 .

[60]  Pedro M. Castro,et al.  New Continuous-Time MILP Model for the Short-Term Scheduling of Multistage Batch Plants , 2005 .

[61]  Ignacio E. Grossmann,et al.  Minimization of the Makespan with a Discrete-Time State−Task Network Formulation , 2003 .

[62]  C. Pantelides,et al.  Optimal Campaign Planning/Scheduling of Multipurpose Batch/Semicontinuous Plants. 2. A Mathematical Decomposition Approach , 1996 .

[63]  Gabriela P. Henning,et al.  A novel network-based continuous-time representation for process scheduling: Part I. Main concepts and mathematical formulation , 2009, Comput. Chem. Eng..

[64]  Christodoulos A. Floudas,et al.  Enhanced Continuous-Time Unit-Specific Event-Based Formulation for Short-Term Scheduling of Multipurpose Batch Processes: Resource Constraints and Mixed Storage Policies. , 2004 .

[65]  David P. Dobkin,et al.  The quickhull algorithm for convex hulls , 1996, TOMS.

[66]  Andres F. Merchan,et al.  Reformulations of Mixed-Integer Programming Continuous-Time Models for Chemical Production Scheduling , 2014 .

[67]  Josef Kallrath,et al.  Planning and scheduling in the process industry , 2002, OR Spectr..

[68]  Jie Li,et al.  A novel approach to scheduling multipurpose batch plants using unit-slots , 2009 .

[69]  Ramsagar Vooradi,et al.  Improved three-index unit-specific event-based model for short-term scheduling of batch plants , 2012, Comput. Chem. Eng..

[70]  Joseph F. Pekny,et al.  Application of distributed computing to batch plant design and scheduling , 1996 .

[71]  I. Grossmann,et al.  Reformulation of multiperiod MILP models for planning and scheduling of chemical processes , 1991 .

[72]  Christodoulos A. Floudas,et al.  Improving unit-specific event based continuous-time approaches for batch processes: Integrality gap and task splitting , 2008, Comput. Chem. Eng..

[73]  Sebastian Engell,et al.  An Intuitive and Efficient Approach to Process Scheduling with Sequence-Dependent Changeovers Using Timed Automata Models , 2011 .

[74]  Christos T. Maravelias,et al.  Simultaneous Batching and Scheduling in Multistage Multiproduct Processes , 2008 .