A combinatorial Benders' decomposition for the lock scheduling problem
From MaRDI portal
(Redirected from Publication:337348)
Recommendations
- A Benders decomposition-based framework for solving quay crane scheduling problems
- Single-facility scheduling by logic-based Benders decomposition
- Combining Benders decomposition and column generation for multi-activity tour scheduling
- An exact approach to the generalized serial-lock scheduling problem from a flexible job-shop scheduling perspective
- Single-facility scheduling over long time horizons by logic-based Benders decomposition
Cites work
- A Benders approach for the constrained minimum break problem
- Combinatorial Benders cuts for the minimum tollbooth problem
- Combinatorial Benders' Cuts for Mixed-Integer Linear Programming
- Exact and heuristic methods for placing ships in locks
- Generalized Benders decomposition
- Logic-based Benders decomposition
- Logic-based Benders decomposition for alternative resource scheduling with sequence dependent setups
- Partitioning procedures for solving mixed-variables programming problems
Cited in
(25)- The multi-period multi-trip container drayage problem with release and due dates
- Scheduling two-way ship traffic for the Kiel Canal: model, extensions and a matheuristic
- Exact and heuristic methods for optimizing lock-quay system in inland waterway
- Multiskilled workforce staffing and scheduling: a logic-based Benders' decomposition approach
- Combinatorial Benders decomposition for single machine scheduling in additive manufacturing with two-dimensional packing constraints
- The Benders decomposition algorithm: a literature review
- A hybrid feasibility constraints-guided search to the two-dimensional bin packing problem with due dates
- Multi-Item Scheduling by Benders' Decomposition
- An exact approach to the generalized serial-lock scheduling problem from a flexible job-shop scheduling perspective
- Optimally solving the generalized serial-lock scheduling problem from a graph-theory-based multi-commodity network perspective
- The multiple multidimensional knapsack with family-split penalties
- A combinatorial Benders decomposition algorithm for parallel machine scheduling with working-time restrictions
- Logic-based Benders decomposition for additive manufacturing scheduling on unrelated parallel machines
- Novel formulations and logic-based Benders decomposition for the integrated parallel machine scheduling and location problem
- Combinatorial Benders cuts for assembly line balancing problems with setups
- A lock and port resource collaborative scheduling method based on mathematical programming model and heuristic
- Single batch machine scheduling with dual setup times for autoclave molding manufacturing
- The design of a reliable and robust hierarchical health service network using an accelerated Benders decomposition algorithm
- Logic-based Benders decomposition algorithm for contamination detection problem in water networks
- Joint serial lock schedule design and sailing speed optimization on inland waterway for emission reduction
- Point-to-point and milk run delivery scheduling: models, complexity results, and algorithms based on Benders decomposition
- Logic-based Benders decomposition for large-scale optimization
- Coordinated optimized scheduling of locks and transshipment in inland waterway transportation using binary NSGA‐II
- A novel hybrid PSO-heuristic algorithm with combinatorial Benders' cuts for maximal evacuation planning in wildfire disasters
- Combinatorial Benders decomposition for the operational aircraft maintenance routing problem
This page was built for publication: A combinatorial Benders' decomposition for the lock scheduling problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q337348)
