Robust Scheduling with Logic-Based Benders Decomposition

DOI10.1007/978-3-319-28697-6_15zbMath1342.90049OpenAlexW2474060996MaRDI QIDQ2806901

Aliza Heching, Alan Scheller-Wolf, Elvin Çoban, John N. Hooker

Publication date: 19 May 2016

Published in: Operations Research Proceedings (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-28697-6_15

zbMATH Keywords

optimizationuncertainty

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Queues and service in operations research (90B22)

Related Items

Logic-Based Benders Decomposition for Large-Scale Optimization ⋮ Solution algorithms for minimizing the total tardiness with budgeted processing time uncertainty

Cites Work

• Robust linear optimization under general norms.
• An integrated method for planning and scheduling to minimize tardiness
• Algorithms for Hybrid MILP/CP Models for a Class of Optimization Problems
• Planning and Scheduling by Logic-Based Benders Decomposition
• The Price of Robustness
• Technical Note—Convex Programming with Set-Inclusive Constraints and Applications to Inexact Linear Programming