Generalized Disjunctive Programming as a Systematic Modeling Framework to Derive Scheduling Formulations

We propose linear generalized disjunctive programming (GDP) models for the short-term scheduling problem of single stage batch plants with parallel units. Three different concepts of continuous-time representation are explored, immediate and general precedence, as well as multiple time grids. The linear GDP models are then reformulated using both big-M and convex hull reformulations, and the resulting mixed-integer linear programming models compared through the solution of a set of example problems. We show that two general precedence models from the literature can be derived using a big-M reformulation for a set of disjunctions and a convex hull reformulation for another. The best performer is, however, a multiple time grid model which can be derived from the convex hull reformulation followed by simple algebraic manipulations to eliminate the disaggregated variables and reduce the sets of constraints, thus leading to a more compact and efficient formulation.

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

[2]  R. Raman,et al.  Modelling and computational techniques for logic based integer programming , 1994 .

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

[4]  Iftekhar A. Karimi,et al.  Scheduling multistage, multiproduct batch plants with nonidentical parallel units and unlimited intermediate storage , 2007 .

[5]  Thokozani Majozi,et al.  A robust mathematical formulation for multipurpose batch plants , 2012 .

[6]  Pedro M. Castro,et al.  An efficient MILP model for the short-term scheduling of single stage batch plants , 2006, Comput. Chem. Eng..

[7]  Aldo R. Vecchietti,et al.  Modeling of discrete/continuous optimization problems: characterization and formulation of disjunctions and their relaxations , 2003, Comput. Chem. Eng..

[8]  William F. Clocksin,et al.  Programming in Prolog , 1987, Springer Berlin Heidelberg.

[9]  Nicholas Beaumont,et al.  An algorithm for disjunctive programs , 1990 .

[10]  A. Barbosa‐Póvoa,et al.  Simple Continuous-Time Formulation for Short-Term Scheduling of Batch and Continuous Processes , 2004 .

[11]  C. Floudas,et al.  Novel Unified Modeling Approach for Short-Term Scheduling , 2009 .

[12]  Zdravko Kravanja,et al.  Translation of variables and implementation of efficient logic‐based techniques in the MINLP process synthesizer MIPSYN , 2009 .

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

[14]  Ignacio E. Grossmann,et al.  A cutting plane method for solving linear generalized disjunctive programming problems , 2003 .

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

[16]  Aldo R. Vecchietti,et al.  Synthesis of Biotechnological Processes Using Generalized Disjunctive Programming , 2004 .

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

[18]  I. Grossmann,et al.  Logic-based MINLP algorithms for the optimal synthesis of process networks , 1996 .

[19]  Laurence A. Wolsey,et al.  Integer and Combinatorial Optimization , 1988 .

[20]  R. Raman,et al.  RELATION BETWEEN MILP MODELLING AND LOGICAL INFERENCE FOR CHEMICAL PROCESS SYNTHESIS , 1991 .

[21]  Ignacio E. Grossmann,et al.  Logic-Based Outer-Approximation and Benders Decomposition Algorithms for the Synthesis of Process Networks , 1996 .

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

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

[24]  Remo Guidieri.  Res , 1995, RES: Anthropology and Aesthetics.

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

[26]  Ignacio E. Grossmann,et al.  Systematic Methods of Chemical Process Design , 1997 .

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

[28]  P. Castro,et al.  Short-Term Scheduling of Multistage Batch Plants with Unlimited Intermediate Storage , 2008 .

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

[30]  Ignacio E. Grossmann,et al.  New General Continuous-Time State−Task Network Formulation for Short-Term Scheduling of Multipurpose Batch Plants , 2003 .

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

[32]  E. Balas.  Disjunctive programming and a hierarchy of relaxations for discrete optimization problems , 1985 .