A decomposition framework for the scheduling of single- and multi-stage processes

A decomposition framework for the scheduling of single- and multi-stage batch chemical processes is presented. The problem is decomposed into an assignment and a sequencing subproblem. The assignment subproblem is solved using mixed-integer methods, while the sequencing subproblem is solved using efficient sequencing algorithms. The proposed method integrates mathematical programming with special-purpose sequencing algorithms. In addition to solving the sequencing subproblem more effectively, this also allows us to generate strong cuts for the assignment subproblem. A novel preprocessing algorithm that identifies infeasible assignments and generates tightening constraints for the assignment subproblem is also developed. This significantly reduces the number of sequencing subproblems needed to find the optimal solution and prove optimality. Computational results show that the proposed algorithm is considerably faster than state of the art methods.

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

[2]  Pascal Van Hentenryck.  Constraint satisfaction in logic programming , 1989, Logic programming.

[3]  Alexander Bockmayr,et al.  Detecting Infeasibility and Generating Cuts for MIP using CP , 2003 .

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

[5]  J. Hooker,et al.  Logic-Based Methods for Optimization: Combining Optimization and Constraint Satisfaction , 2000 .

[6]  John N. Hooker,et al.  Logic, Optimization, and Constraint Programming , 2002, INFORMS J. Comput..

[7]  Jeffrey D. Kelly.  Chronological decomposition heuristic for scheduling: Divide and conquer method , 2002 .

[8]  Ignacio E. Grossmann,et al.  A hybrid MILP/CP decomposition approach for the continuous time scheduling of multipurpose batch plants , 2004, Comput. Chem. Eng..

[9]  Egon Balas,et al.  Job Shop Scheduling With Deadlines , 1998, J. Comb. Optim..

[10]  Egon Balas,et al.  Facets of the knapsack polytope , 1975, Math. Program..

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

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

[13]  S. Heipcke.  An example of integrating constraint programming and mathematical programming , 1999 .

[14]  Peter J. Stuckey,et al.  Introduction to Constraint Logic Programming , 1998 .

[15]  Gintaras V. Reklaitis,et al.  Overview of Scheduling and Planning of Batch Process Operations , 1996 .

[16]  John N. Hooker,et al.  Optimization and , 2000 .

[17]  Laurence A. Wolsey,et al.  Faces for a linear inequality in 0–1 variables , 1975, Math. Program..

[18]  Jeffrey Dean Kelly,et al.  Smooth-and-dive accelerator: a pre-MILP primal heuristic applied to scheduling , 2003, Comput. Chem. Eng..

[19]  Erlendur S. Thorsteinsson.  Branch-and-Check: A Hybrid Framework Integrating Mixed Integer Programming and Constraint Logic Programming , 2001, CP.

[20]  Pascal Van Hentenryck.  Constraint and Integer Programming in OPL , 2002, INFORMS J. Comput..

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

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

[23]  John L. Mann,et al.  Flowsheet decomposition heuristic for scheduling: a relax-and-fix method , 2004, Comput. Chem. Eng..

[24]  Egon Balas,et al.  Guided Local Search with Shifting Bottleneck for Job Shop Scheduling , 1998 .

[25]  David W.T. Rippin,et al.  Batch process systems engineering: A retrospective and prospective review , 1993 .

[26]  Alexander Bockmayr,et al.  Branch and Infer: A Unifying Framework for Integer and Finite Domain Constraint Programming , 1998, INFORMS J. Comput..

[27]  Philippe Baptiste,et al.  Constraint - based scheduling : applying constraint programming to scheduling problems , 2001 .

[28]  Mark Wallace,et al.  A new approach to integrating mixed integer programming and constraint logicprogramming , 1999, Ann. Oper. Res..