An Integrated Method for Planning and Scheduling to Minimize Tardiness

We combine mixed integer linear programming (MILP) and constraint programming (CP) to minimize tardiness in planning and scheduling. Tasks are allocated to facilities using MILP and scheduled using CP, and the two are linked via logic-based Benders decomposition. We consider two objectives: minimizing the number of late tasks, and minimizing total tardiness. Our main theoretical contribution is a relaxation of the cumulative scheduling subproblem, which is critical to performance. We obtain substantial computational speedups relative to the state of the art in both MILP and CP. We also obtain much better solutions for problems that cannot be solved to optimality.

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

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

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

[4]  Hong Yan,et al.  A Relaxation of the Cumulative Constraint , 2002, CP.

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

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

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

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

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

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

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

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

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

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

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

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

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

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