Planning and Scheduling by Logic-Based Benders Decomposition

We combine mixed-integer linear programming (MILP) and constraint programming (CP) to solve an important class of planning and scheduling problems. Tasks are allocated to facilities using MILP and scheduled using CP, and the two are linked via logic-based Benders decomposition. Tasks assigned to a facility may run in parallel subject to resource constraints (cumulative scheduling). We solve problems in which the objective is to minimize cost, makespan, or total tardiness. We obtain significant computational speedups, of several orders of magnitude for the first two objectives, relative to the state of the art in both MILP and CP. We also obtain better solutions and bounds for problems than cannot be solved to optimality.

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

[2]  Quanshi Xia,et al.  A Hybrid Algorithm for a Class of Resource Constrained Scheduling Problems , 2005, CPAIOR.

[3]  Christian Timpe,et al.  Solving planning and scheduling problems with combined integer and constraint programming , 2002, OR Spectr..

[4]  Quanshi Xia,et al.  Generating Benders Cuts for a General Class of Integer Programming Problems , 2004, CPAIOR.

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

[6]  Mark Wallace,et al.  Principles and Practice of Constraint Programming – CP 2004 , 2004, Lecture Notes in Computer Science.

[7]  A. M. Geoffrion.  Generalized Benders decomposition , 1972 .

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

[9]  Peter van Beek,et al.  Principles and Practice of Constraint Programming - CP 2005, 11th International Conference, CP 2005, Sitges, Spain, October 1-5, 2005, Proceedings , 2005, CP.

[10]  Jacques F. Benders,et al.  Partitioning procedures for solving mixed-variables programming problems , 2005, Comput. Manag. Sci..

[11]  John N. Hooker,et al.  A Hybrid Method for the Planning and Scheduling , 2005, Constraints.

[12]  John N. Hooker,et al.  Planning and Scheduling to Minimize Tardiness , 2005, CP.

[13]  I. Grossmann,et al.  A decomposition approach for the scheduling of a steel plant production , 2001 .

[14]  Mark Wallace,et al.  Hybrid Benders Decomposition Algorithms in Constraint Logic Programming , 2001, CP.

[15]  Pascal Van Hentenryck,et al.  Principles and practice of constraint programming: The Newport papers , 1996, Computers & Mathematics with Applications.

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

[17]  André Langevin,et al.  Dispatching and Conflict-Free Routing of Automated Guided Vehicles: A Hybrid Approach Combining Constraint Programming and Mixed Integer Programming , 2004, CPAIOR.

[18]  Mark Wallace,et al.  Problem Decomposition for Traffic Diversions , 2004, CPAIOR.

[19]  J. Hooker,et al.  Logic-based Benders decomposition , 2003 .

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

[21]  Ignacio E. Grossmann,et al.  Using MILP and CP for the Scheduling of Batch Chemical Processes , 2004, CPAIOR.

[22]  Hadrien Cambazard,et al.  Decomposition and Learning for a Hard Real Time Task Allocation Problem , 2004, CP.