Single-Facility Scheduling over Long Time Horizons by Logic-Based Benders Decomposition

DOI10.1007/978-3-642-13520-0_11zbMath1285.68154OpenAlexW1563940550MaRDI QIDQ3569922

Elvin Çoban, John N. Hooker

Publication date: 22 June 2010

Published in: Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (Search for Journal in Brave)

Full work available at URL: https://figshare.com/articles/journal_contribution/Single-Facility_Scheduling_over_Long_Time_Horizons_by_Logic-Based_Benders_Decomposition/6707999

Mathematics Subject Classification ID

Mixed integer programming (90C11) Deterministic scheduling theory in operations research (90B35) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (3)

Logic-Based Benders Decomposition for Large-Scale Optimization ⋮ Upper and lower bounds for the permutation flowshop scheduling problem with minimal time lags ⋮ Exact optimization and decomposition approaches for shelf space allocation

This page was built for publication: Single-Facility Scheduling over Long Time Horizons by Logic-Based Benders Decomposition