A Benders decomposition-based framework for solving quay crane scheduling problems
From MaRDI portal
Publication:1622801
DOI10.1016/j.ejor.2018.08.009zbMath1403.90504OpenAlexW2886847473WikidataQ129368211 ScholiaQ129368211MaRDI QIDQ1622801
Lixin Tang, Roberto Baldacci, Defeng Sun
Publication date: 19 November 2018
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/11585/654305
Deterministic scheduling theory in operations research (90B35) Case-oriented studies in operations research (90B90)
Related Items (11)
Optimization for integrated scheduling of intelligent handling equipment with bidirectional flows and limited buffers at automated container terminals ⋮ On the mass COVID-19 vaccination scheduling problem ⋮ Logic-based benders decomposition with a partial assignment acceleration technique for avionics scheduling ⋮ Exact and matheuristic methods for the parallel machine scheduling and location problem with delivery time and due date ⋮ Logic-Based Benders Decomposition for Integrated Process Configuration and Production Planning Problems ⋮ Scheduling quay cranes and shuttle vehicles simultaneously with limited apron buffer capacity ⋮ Simultaneous operation of next-generation and traditional quay cranes at container terminals ⋮ The synergistic effect of operational research and big data analytics in greening container terminal operations: a review and future directions ⋮ An exact algorithm for the unidirectional quay crane scheduling problem with vessel stability ⋮ Solving integrated operating room planning and scheduling: logic-based Benders decomposition versus branch-price-and-cut ⋮ Logic-based Benders decomposition method for the \textit{seru} scheduling problem with sequence-dependent setup time and DeJong's learning effect
Uses Software
Cites Work
- Unnamed Item
- A follow-up survey of berth allocation and quay crane scheduling problems in container terminals
- A tabu search heuristic for the quay crane scheduling problem
- A survey of berth allocation and quay crane scheduling problems in container terminals
- Partitioning procedures for solving mixed-variables programming problems
- Logic-based Benders decomposition
- Transshipment of containers at a container terminal: An overview
- A crane scheduling method for port container terminals
- A fast heuristic for quay crane scheduling with interference constraints
- The crane scheduling problem: models and solution approaches
- Operations research at container terminals: a literature update
- Yard crane scheduling in port container terminals
- Modeling and solution of the joint quay crane and truck scheduling problem
- Generalized Benders decomposition
- Crane scheduling with spatial constraints
- Combinatorial Benders' Cuts for Mixed-Integer Linear Programming
- Planning and Scheduling by Logic-Based Benders Decomposition
- A branch-and-cut algorithm for the quay crane scheduling problem in a container terminal
- Quay crane scheduling at container terminals to minimize the maximum relative tardiness of vessel departures
- Crane scheduling with non-crossing constraint
- A m‐parallel crane scheduling problem with a non‐crossing constraint
This page was built for publication: A Benders decomposition-based framework for solving quay crane scheduling problems
