Robust scheduling with logic-based Benders decomposition
From MaRDI portal
Publication:2806901
Recommendations
- Stochastic planning and scheduling with logic-based Benders decomposition
- Planning and Scheduling by Logic-Based Benders Decomposition
- Single-facility scheduling by logic-based Benders decomposition
- Logic-based Benders decomposition for alternative resource scheduling with sequence dependent setups
- Single-facility scheduling over long time horizons by logic-based Benders decomposition
Cites work
- Algorithms for hybrid MILP/CP models for a class of optimization problems
- An integrated method for planning and scheduling to minimize tardiness
- Planning and Scheduling by Logic-Based Benders Decomposition
- Robust linear optimization under general norms.
- Technical Note—Convex Programming with Set-Inclusive Constraints and Applications to Inexact Linear Programming
- The Price of Robustness
Cited in
(5)- 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 for large-scale optimization
- Robust optimization of schedules affected by uncertain events
- 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)