Combining the advantages of discrete- and continuous-time scheduling models: Part 2. systematic methods for determining model parameters

Abstract The Discrete-Continuous Algorithm (DCA) is a novel framework that harnesses the strengths of discrete- and continuous-time scheduling formulations (Lee and Maraveloas,2018). Its flexibility in the selection of two user-defined parameters, namely discretization step length (δ) and horizon relaxation (η), can lead to significantly improved computational performance and solution quality. In this paper, we propose systematic methods to determine these parameters. Specifically, we evaluate the parameters based on error evaluation functions and cumulative error functions that consider various aspects of the scheduling instances. Through an extensive computational study, we show that the proposed methods bring up to  × 104 speedups, while leading to identical or better solutions in the majority of the instances compared to traditional methods.

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

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

[3]  Vladimir Mahalec,et al.  Nonlinear Blend Scheduling via Inventory Pinch-based Algorithm using Discrete- and Continuous-time Models , 2015 .

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

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

[6]  Christos T. Maravelias,et al.  On the solution of large-scale mixed integer programming scheduling models , 2015 .

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

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

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

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

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

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

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

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

[15]  Vladimir Mahalec,et al.  Inventory pinch gasoline blend scheduling algorithm combining discrete- and continuous-time models , 2016, Comput. Chem. Eng..

[16]  Christos T. Maravelias,et al.  Combining the advantages of discrete- and continuous-time scheduling models: Part 1. Framework and mathematical formulations , 2018, Comput. Chem. Eng..

[17]  Hojae Lee,et al.  Mixed-integer programming models for simultaneous batching and scheduling in multipurpose batch plants , 2017, Comput. Chem. Eng..

[18]  Fengqi You,et al.  A computational framework and solution algorithms for two‐stage adaptive robust scheduling of batch manufacturing processes under uncertainty , 2016 .

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

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

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

[22]  L. Biegler,et al.  Discrete Time Formulation for the Integration of Scheduling and Dynamic Optimization , 2015 .

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

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

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

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