Single-Facility scheduling over long time horizons by logic-based benders decomposition

Authors:
Elvin Coban;John N. Hooker
Affiliations:
Tepper School of Business, Carnegie Mellon University;Tepper School of Business, Carnegie Mellon University
Venue:
CPAIOR'10 Proceedings of the 7th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Year:
2010

Citing 4
Cited 2

Algorithms for Hybrid MILP/CP Models for a Class of Optimization Problems

INFORMS Journal on Computing
A Hybrid Method for the Planning and Scheduling

Constraints
An Integrated Method for Planning and Scheduling to Minimize Tardiness

Constraints
Planning and Scheduling by Logic-Based Benders Decomposition

Operations Research

Optimal methods for resource allocation and scheduling: a cross-disciplinary survey

Constraints
Solving two-machine assembly scheduling problems with inventory constraints

Computers and Industrial Engineering

Quantified Score

Hi-index	0.00

Visualization

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 that are divided into segments separated by shutdown times (such as weekends). The objective is to find feasible solutions, minimize makespan, or minimize total tardiness.