Mixed integer programming versus logic-based Benders decomposition for planning and scheduling
From MaRDI portal
Recommendations
- Planning and Scheduling by Logic-Based Benders Decomposition
- Single-facility scheduling by logic-based Benders decomposition
- Single-facility scheduling over long time horizons by logic-based Benders decomposition
- Stochastic planning and scheduling with logic-based Benders decomposition
- Logic-based Benders decomposition
Cited in
(11)- Constraint programming and operations research
- Propagating logic-based Benders' decomposition approaches for distributed operating room scheduling
- Type-2 integrated process-planning and scheduling problem: reformulation and solution algorithms
- Single-facility scheduling by logic-based Benders decomposition
- Temporal linear relaxation in IBM ILOG CP optimizer
- Logic-based Benders decomposition for large-scale optimization
- Single-facility scheduling over long time horizons by logic-based Benders decomposition
- Stochastic planning and scheduling with logic-based Benders decomposition
- Multi-stage Benders Decomposition for Optimizing Multicore Architectures
- Logic-based Benders decomposition for the preemptive flexible job-shop scheduling problem
- A mixed integer programming model for advanced planning and scheduling (APS)
This page was built for publication: Mixed integer programming versus logic-based Benders decomposition for planning and scheduling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4922921)