Annals of Operations Research

, Volume 210, Issue 1, pp 245–272

Single-facility scheduling by logic-based Benders decomposition

Authors

  • Elvin Coban
    • Tepper School of BusinessCarnegie Mellon University
    • Tepper School of BusinessCarnegie Mellon University
Article

DOI: 10.1007/s10479-011-1031-z

Cite this article as:
Coban, E. & Hooker, J.N. Ann Oper Res (2013) 210: 245. doi:10.1007/s10479-011-1031-z

Abstract

Logic-based Benders decomposition can combine mixed integer programming and constraint programming to solve planning and scheduling problems much faster than either method alone. We find that a similar technique can be beneficial for solving pure scheduling problems as the problem size scales up. We solve single-facility non-preemptive scheduling problems with time windows and long time horizons. The Benders master problem assigns jobs to predefined segments of the time horizon, where the subproblem schedules them. In one version of the problem, jobs may not overlap the segment boundaries (which represent shutdown times, such as weekends), and in another version, there is no such restriction. The objective is to find feasible solutions, minimize makespan, or minimize total tardiness.

Keywords

Logic-based Benders decomposition Constraint programming Mixed integer programming Single-facility scheduling Makespan Tardiness Feasibility

Copyright information

© Springer Science+Business Media, LLC 2011