A branch-and-bound algorithm for the solution of chemical production scheduling MIP models using parallel computing

Abstract Exploiting multiple cores in a computer or grid of computers can reduce the time required to solve a mixed-integer programming (MIP) model. Here, we develop a parallel branch-and-bound algorithm for a chemical production scheduling problem using a discrete-time model. The algorithm consists of initialization, submission, branching, collection, bounding, and pruning steps. We branch by adding a constraint to bound the total number of times each task runs. Each subproblem is solved as an MIP on a single core of a computer, so that many sub problems can be solved simultaneously. Also, we propose an algorithm, executed at each node of our branch-and-bound tree, to improve the bounds on the number of times a task is run based on the current objective value. We present computational results for several instances to show the parallel algorithm with the proposed branching strategy can solve more challenging problems than simply using the default parallel option.

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

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

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

[4]  John M. Wassick,et al.  Enterprise-wide optimization in an integrated chemical complex , 2009, Comput. Chem. Eng..

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

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

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

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

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

[10]  Christos T. Maravelias,et al.  Mixed-Time Representation for State-Task Network Models , 2005 .

[11]  G. Nemhauser,et al.  Integer Programming , 2020 .

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

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

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

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

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

[17]  Christos T. Maravelias,et al.  A state-space model for chemical production scheduling , 2012, Comput. Chem. Eng..

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

[19]  R. J. Dakin,et al.  A tree-search algorithm for mixed integer programming problems , 1965, Comput. J..

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

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

[22]  D.W.T. Rippin,et al.  Short-term scheduling for multiproduct batch chemical plants , 1986 .

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

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

[25]  Pedro M. Castro,et al.  Scheduling of a continuous plant with recycling of byproducts: A case study from a tissue paper mill , 2009, Comput. Chem. Eng..

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

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

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

[29]  Michael C. Ferris,et al.  Grid-Enabled Optimization with GAMS , 2009, INFORMS J. Comput..

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

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

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

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

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

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

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

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

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

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

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

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

[42]  Jaime Cerdá,et al.  An MILP framework for batch reactive scheduling with limited discrete resources , 2004, Comput. Chem. Eng..

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

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

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

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

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

[48]  Jaime Cerdá,et al.  An MILP Continuous-Time Framework for Short-Term Scheduling of Multipurpose Batch Processes Under Different Operation Strategies , 2003 .

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