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

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6140 LNCS, Issue , 2010, Pages 87-91

  Coban, Elvin ^a   Hooker, John N ^a  

^a CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BENDERS DECOMPOSITION; CONSTRAINT PROGRAMMING; FEASIBLE SOLUTION; MAKESPAN; MIXED INTEGER PROGRAMMING; NON-PREEMPTIVE; PLANNING AND SCHEDULING; PROBLEM SIZE; SCHEDULING PROBLEM; TIME HORIZONS; TIME WINDOWS; TOTAL TARDINESS;

COMBINATORIAL OPTIMIZATION; COMPUTER PROGRAMMING; CONSTRAINT THEORY; PLANT SHUTDOWNS; SCHEDULING; SCHEDULING ALGORITHMS;

INTEGER PROGRAMMING;

EID: 77955443362     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-13520-0_11     Document Type: Conference Paper

References (11)

1. 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) (Pubitemid 35192175)
2. Hooker, J.N.: Logic-based benders decomposition. Technical report, CMU (1995)
3. Hooker, J.N.: Logic-Based Methods for Optimization: Combining Optimization and Constraint Satisfaction. Wiley, New York (2000)
4. Hooker, J.N.: A hybrid method for planning and scheduling. Constraints 10, 385-401 (2005)
5. Hooker, J.N.: An integrated method for planning and scheduling to minimize tardiness. Constraints 11, 139-157 (2006)
6. Hooker, J.N.: Planning and scheduling by logic-based benders decomposition. Operations Research 55, 588-602 (2007)
7. Hooker, J.N., Ottosson, G.: Logic-based benders decomposition. Mathematical Programming 96, 33-60 (2003)
8. 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)
9. 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) (Pubitemid 33645944)
10. 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)
11. Timpe, C.: Solving planning and scheduling problems with combined integer and constraint programming. OR Spectrum 24, 431-448 (2002)