Singlefacility scheduling by logicbased Benders decomposition
 Elvin Coban,
 J. N. Hooker
 … show all 2 hide
Rent the article at a discount
Rent now* Final gross prices may vary according to local VAT.
Get AccessAbstract
Logicbased 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 singlefacility nonpreemptive 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.
 Title
 Singlefacility scheduling by logicbased Benders decomposition
 Journal

Annals of Operations Research
Volume 210, Issue 1 , pp 245272
 Cover Date
 20131101
 DOI
 10.1007/s104790111031z
 Print ISSN
 02545330
 Online ISSN
 15729338
 Publisher
 Springer US
 Additional Links
 Topics
 Keywords

 Logicbased Benders decomposition
 Constraint programming
 Mixed integer programming
 Singlefacility scheduling
 Makespan
 Tardiness
 Feasibility
 Industry Sectors
 Authors

 Elvin Coban ^{(1)}
 J. N. Hooker ^{(1)}
 Author Affiliations

 1. Tepper School of Business, Carnegie Mellon University, Pittsburgh, USA