Mixed-Integer Programming Model and Tightening Methods for Scheduling in General Chemical Production Environments

We develop a mixed-integer programming (MIP) model to address chemical production scheduling problems in a wide range of facilities, including facilities with many different types of material handling restrictions and a wide range of process characteristics. We first discuss how material handling restrictions result in different types of production environments and then show how these restrictions can be modeled. We also present extensions for some important processing constraints and briefly discuss how other constraints and characteristics can be modeled. Finally, we present constraint propagation methods for the calculation of parameters that are used to formulate tightening constraints that lead to a substantial reduction of computational requirements. The proposed model is the first to address the generalized chemical production scheduling problem.

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

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

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

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

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

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

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

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

[9]  I. Grossmann,et al.  Optimal short-term scheduling of large-scale multistage batch plants , 2009 .

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

[29]  Christos T. Maravelias,et al.  Optimization of Aluminum Smelter Casthouse Operations , 2006 .

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

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

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

[33]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

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