Date of Original Version

2005

Type

Book Chapter

Abstract or Description

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.

DOI

10.1007/11564751_25

Share

COinS
 

Published In

P. van Beek, ed., Principles and Practice of Constraint Programming (CP 2005), LNCS 3709, 314-327.