Single-facility scheduling by logic-based Benders decomposition
From MaRDI portal
Publication:2442086
Recommendations
- Single-facility scheduling over long time horizons by logic-based Benders decomposition
- Planning and Scheduling by Logic-Based Benders Decomposition
- Mixed integer programming versus logic-based Benders decomposition for planning and scheduling
- Stochastic planning and scheduling with logic-based Benders decomposition
- Logic-based Benders decomposition for alternative resource scheduling with sequence dependent setups
Cites work
- A Benders approach for the constrained minimum break problem
- A hybrid method for the planning and scheduling
- A hybridization of mathematical programming and dominance-driven enumeration for solving shift-selection and task-sequencing problems
- Algorithms for hybrid MILP/CP models for a class of optimization problems
- Allocation and Scheduling for MPSoCs via Decomposition and No-Good Generation
- An integrated method for planning and scheduling to minimize tardiness
- Blocking and anti-blocking pairs of polyhedra
- Combinatorial Benders' Cuts for Mixed-Integer Linear Programming
- Constraint-based scheduling: Applying constraint programming to scheduling problems.
- Generalized Benders decomposition
- scientific article; zbMATH DE number 5345853 (Why is no real title available?)
- scientific article; zbMATH DE number 3754389 (Why is no real title available?)
- scientific article; zbMATH DE number 2084694 (Why is no real title available?)
- scientific article; zbMATH DE number 1550909 (Why is no real title available?)
- scientific article; zbMATH DE number 5064311 (Why is no real title available?)
- Integer programming and constraint programming in solving a multimachine assignment scheduling problem with deadlines and release dates
- Integrated methods for optimization.
- Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
- Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
- Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
- Logic-based Benders decomposition
- On the facial structure of set packing polyhedra
- Partitioning procedures for solving mixed-variables programming problems
- Planning and Scheduling by Logic-Based Benders Decomposition
- Planning and Scheduling to Minimize Tardiness
- Principles and Practice of Constraint Programming – CP 2004
- Principles and Practice of Constraint Programming – CP 2004
- Proximal-ACCPM: a versatile oracle based optimisation method
- Recent Advances in Constraints
- Representability in mixed integer programming. I: Characterization results
- Scheduling a triple round robin tournament for the best Danish soccer league
- Solving planning and scheduling problems with combined integer and constraint programming
- The single-machine total tardiness scheduling problem: review and extensions
Cited in
(28)- Constraint programming and operations research
- Combining Benders decomposition and column generation for multi-activity tour scheduling
- An MILP model for planning of batch plants operating in a campaign-mode
- Recursive logic-based Benders' decomposition for multi-mode outpatient scheduling
- Propagating logic-based Benders' decomposition approaches for distributed operating room scheduling
- Changeover formulations for discrete-time mixed-integer programming scheduling models
- A Benders decomposition-based heuristic for a production and outbound distribution scheduling problem with strict delivery constraints
- Logic-based Benders decomposition method for the \textit{seru} scheduling problem with sequence-dependent setup time and DeJong's learning effect
- Strengthening of feasibility cuts in logic-based benders decomposition
- Benders decomposition for the mixed no-idle permutation flowshop scheduling problem
- Logic-based Benders decomposition for scheduling a batching machine
- Logic-based Benders decomposition with a partial assignment acceleration technique for avionics scheduling
- Robust scheduling with logic-based Benders decomposition
- Logic-based Benders decomposition for large-scale optimization
- A combinatorial Benders' decomposition for the lock scheduling problem
- Planning and Scheduling by Logic-Based Benders Decomposition
- Logic-based Benders decomposition for alternative resource scheduling with sequence dependent setups
- Planning and Scheduling to Minimize Tardiness
- Single-facility scheduling over long time horizons by logic-based Benders decomposition
- Mixed integer programming versus logic-based Benders decomposition for planning and scheduling
- Problem Decomposition and Multi-shot ASP Solving for Job-shop Scheduling
- Stochastic planning and scheduling with logic-based Benders decomposition
- Logic-Based Benders Decomposition and Binary Decision Diagram Based Approaches for Stochastic Distributed Operating Room Scheduling
- Logic-Based Benders Decomposition for Integrated Process Configuration and Production Planning Problems
- Principles and Practice of Constraint Programming – CP 2004
- Computational evaluation of cut-strengthening techniques in logic-based Benders' decomposition
- Logic-based Benders decomposition for the preemptive flexible job-shop scheduling problem
- Improved combinatorial Benders decomposition for a scheduling problem with unrelated parallel machines
This page was built for publication: Single-facility scheduling by logic-based Benders decomposition
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2442086)
