Robust Scheduling with Logic-Based Benders Decomposition

DOI10.1007/978-3-319-28697-6_15zbMATH Open1342.90049OpenAlexW2474060996MaRDI QIDQ2806901FDOQ2806901

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

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

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

Cites Work

• The Price of Robustness
• Planning and Scheduling by Logic-Based Benders Decomposition
• Technical Note—Convex Programming with Set-Inclusive Constraints and Applications to Inexact Linear Programming
• 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

Cited In (4)

• Logic-Based Benders Decomposition for Large-Scale Optimization
• Logic-based Benders decomposition for the preemptive flexible job-shop scheduling problem
• Solution algorithms for minimizing the total tardiness with budgeted processing time uncertainty
• Logic-Based Benders Decomposition and Binary Decision Diagram Based Approaches for Stochastic Distributed Operating Room Scheduling

This page was built for publication: Robust Scheduling with Logic-Based Benders Decomposition

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2806901)