Multiple and nonuniform time grids in discrete-time MIP models for chemical production scheduling

Abstract The modeling of time plays a key role in the formulation of mixed-integer programming (MIP) models for scheduling, production planning, and operational supply chain planning problems. It affects the size of the model, the computational requirements, and the quality of the solution. While the development of smaller continuous-time scheduling models, based on multiple time grids, has received considerable attention, no truly different modeling methods are available for discrete-time models. In this paper, we challenge the long-standing belief that employing a discrete modeling of time requires a common uniform grid. First, we show that multiple grids can actually be employed in discrete-time models. Second, we show that not only unit-specific but also task-specific and material-specific grids can be generated. Third, we present methods to systematically formulate discrete-time multi-grid models that allow different tasks, units, or materials to have their own time grid. We present two different algorithms to find the grid. The first algorithm determines the largest grid spacing that will not eliminate the optimal solution. The second algorithm allows the user to adjust the level of approximation; more approximate grids may have worse solutions, but many fewer binary variables. Importantly, we show that the proposed models have exactly the same types of constraints as models relying on a single uniform grid, which means that the proposed models are tight and that known solution methods can be employed. The proposed methods lead to substantial reductions in the size of the formulations and thus the computational requirements. In addition, they can yield better solutions than formulations that use approximations. We show how to select the different time grids, state the formulation, and present computational results.

[1]  Ignacio E. Grossmann,et al.  Assignment and sequencing models for thescheduling of process systems , 1998, Ann. Oper. Res..

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

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

[4]  Pedro M. Castro,et al.  Simultaneous Batching and Scheduling of Single Stage Batch Plants with Parallel Units , 2008 .

[5]  C. Maravelias,et al.  Scheduling of Multistage Batch Processes under Utility Constraints , 2009 .

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

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

[8]  Christos T. Maravelias,et al.  Polyhedral results for discrete-time production planning MIP formulations for continuous processes , 2009, Comput. Chem. Eng..

[9]  Claudio Arbib,et al.  Exact and Asymptotically Exact Solutions for a Class of Assortment Problems , 2009, INFORMS J. Comput..

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

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

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

[13]  Iftekhar A. Karimi,et al.  An Improved MILP Formulation for Scheduling Multiproduct, Multistage Batch Plants , 2003 .

[14]  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 .

[15]  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..

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

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

[18]  Jaime Cerdá,et al.  An MILP continuous-time approach to short-term scheduling of resource-constrained multistage flowshop batch facilities , 2001 .

[19]  Christos T. Maravelias.  On the combinatorial structure of discrete-time MIP formulations for chemical production scheduling , 2012, Comput. Chem. Eng..

[20]  Christos T. Maravelias,et al.  A mixed-integer programming formulation for the general capacitated lot-sizing problem , 2008, Computers and Chemical Engineering.

[21]  Norbert Trautmann,et al.  A continuous-time MILP model for short-term scheduling of make-and-pack production processes , 2013 .

[22]  D. Rippin,et al.  Production planning and scheduling for multi-purpose batch chemical plants , 1979 .

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

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

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

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

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

[28]  Christodoulos A. Floudas,et al.  Effective Continuous-Time Formulation for Short-Term Scheduling. 2. Continuous and Semicontinuous Processes , 1998 .

[29]  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..

[30]  Christodoulos A. Floudas,et al.  Continuous-time versus discrete-time approaches for scheduling of chemical processes: a review , 2004, Comput. Chem. Eng..

[31]  P. Castro,et al.  Two New Continuous-Time Models for the Scheduling of Multistage Batch Plants with Sequence Dependent Changeovers , 2006 .

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

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

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

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

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

[37]  Yves Dallery,et al.  Scheduling of loading and unloading of crude oil in a refinery using event-based discrete time formulation , 2009, Comput. Chem. Eng..

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

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

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

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

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

[43]  Jaime Cerdá,et al.  Optimal scheduling of batch plants satisfying multiple product orders with different due-dates , 2000 .

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

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

[46]  Yves Pochet,et al.  A tighter continuous time formulation for the cyclic scheduling of a mixed plant , 2008, Comput. Chem. Eng..

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

[48]  Pedro M. Castro,et al.  Greedy algorithm for scheduling batch plants with sequence‐dependent changeovers , 2011 .

[49]  Klaus Neumann,et al.  Advanced production scheduling for batch plants in process industries , 2002, OR Spectr..

[50]  N. Giannelos,et al.  A novel event-driven formulation for short-term scheduling of multipurpose continuous processes , 2002 .

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

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