A combinatorial Benders' decomposition for the lock scheduling problem

DOI10.1016/J.COR.2014.09.007zbMATH Open1348.90318OpenAlexW1985424519MaRDI QIDQ337348FDOQ337348

Authors: Jannes Verstichel, J. Kinable, Patrick De Causmaecker, Greet Vanden Berghe 

Publication date: 10 November 2016

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://lirias.kuleuven.be/handle/123456789/463251

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

zbMATH Keywords

combinatorial Benders' decompositionlock scheduling problem

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27)

Cites Work

• Partitioning procedures for solving mixed-variables programming problems
• Logic-based Benders decomposition
• Generalized Benders decomposition
• Combinatorial Benders' Cuts for Mixed-Integer Linear Programming
• Exact and heuristic methods for placing ships in locks
• Combinatorial Benders cuts for the minimum tollbooth problem
• Logic-based Benders decomposition for alternative resource scheduling with sequence dependent setups
• A Benders approach for the constrained minimum break problem

Cited In (19)

• 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
• 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
• 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
• 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
• 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
• Combinatorial Benders decomposition for the operational aircraft maintenance routing problem
• The multi-period multi-trip container drayage problem with release and due dates

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)