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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Harjunkoski, I., Grossmann, I.E.: Decomposition techniques for multistage scheduling problems using mixed-integer and constraint programming methods. Computers and Chemical Engineering 26, 1533–1552 (2002)
Hooker, J.N.: Logic-based benders decomposition. Technical report, CMU (1995)
Hooker, J.N.: Logic-Based Methods for Optimization: Combining Optimization and Constraint Satisfaction. Wiley, New York (2000)
Hooker, J.N.: A hybrid method for planning and scheduling. Constraints 10, 385–401 (2005)
Hooker, J.N.: An integrated method for planning and scheduling to minimize tardiness. Constraints 11, 139–157 (2006)
Hooker, J.N.: Planning and scheduling by logic-based benders decomposition. Operations Research 55, 588–602 (2007)
Hooker, J.N., Ottosson, G.: Logic-based benders decomposition. Mathematical Programming 96, 33–60 (2003)
Hooker, J.N., Yan, H.: Logic circuit verification by Benders decomposition. In: Principles and Practice of Constraint Programming: The Newport Papers, pp. 267–288. MIT Press, Cambridge (1995)
Jain, V., Grossmann, I.E.: Algorithms for hybrid MILP/CP models for a class of optimization problems. INFORMS Journal on Computing 13(4), 258–276 (2001)
Maravelias, C.T., Grossmann, I.E.: A hybrid MILP/CP decomposition approach for the continuous time scheduling of multipurpose batch plants. Computers and Chemical Engineering 28, 1921–1949 (2004)
Timpe, C.: Solving planning and scheduling problems with combined integer and constraint programming. OR Spectrum 24, 431–448 (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Coban, E., Hooker, J.N. (2010). Single-Facility Scheduling over Long Time Horizons by Logic-Based Benders Decomposition. In: Lodi, A., Milano, M., Toth, P. (eds) Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems. CPAIOR 2010. Lecture Notes in Computer Science, vol 6140. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-13520-0_11
Download citation
DOI: https://doi.org/10.1007/978-3-642-13520-0_11
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-13519-4
Online ISBN: 978-3-642-13520-0
eBook Packages: Computer ScienceComputer Science (R0)