Decomposition algorithms for the robust unidirectional quay crane scheduling problems
From MaRDI portal
Publication:6568488
DOI10.1016/J.COR.2024.106670MaRDI QIDQ6568488FDOQ6568488
Authors: Yitian Li, Xinyi Li, Canrong Zhang, Tao Wu
Publication date: 8 July 2024
Published in: Computers \& Operations Research (Search for Journal in Brave)
robust optimizationBenders decompositioncolumn-and-constraint generationmaritime industryunidirectional quay crane scheduling
Cites Work
- Partitioning procedures for solving mixed-variables programming problems
- A crane scheduling method for port container terminals
- The Price of Robustness
- Accelerating Benders Decomposition: Algorithmic Enhancement and Model Selection Criteria
- Introduction to stochastic programming.
- A survey of berth allocation and quay crane scheduling problems in container terminals
- Container terminal operation and operations research -- a classification and literature review
- Operations research at container terminals: a literature update
- Title not available (Why is that?)
- Transshipment of containers at a container terminal: An overview
- A tabu search heuristic for the quay crane scheduling problem
- Modeling and solving rich quay crane scheduling problems
- Berth allocation and quay crane assignment/scheduling problem under uncertainty: a survey
- An effective mathematical formulation for the unidirectional cluster-based quay crane scheduling problem
- Solving two-stage robust optimization problems using a column-and-constraint generation method
- The quay crane scheduling problem with time windows
- A follow-up survey of berth allocation and quay crane scheduling problems in container terminals
- A local branching-based algorithm for the quay crane scheduling problem under unidirectional schedules
- Quay crane scheduling at container terminals to minimize the maximum relative tardiness of vessel departures
- A fast heuristic for quay crane scheduling with interference constraints
- Benders Decomposition for Production Routing Under Demand Uncertainty
- A m‐parallel crane scheduling problem with a non‐crossing constraint
- An exact robust approach for the integrated berth allocation and quay crane scheduling problem under uncertain arrival times
- The study of the unidirectional quay crane scheduling problem: complexity and risk-aversion
- An exact algorithm for the unidirectional quay crane scheduling problem with vessel stability
- Algorithm Theory - SWAT 2004
- Exact methods for the quay crane scheduling problem when tasks are modeled at the single container level
- The quay crane scheduling problem with non-crossing and safety clearance constraints: an exact solution approach
- A two-stage robust model for a reliable \(p\)-center facility location problem
- A robust multiobjective model for the integrated berth and quay crane scheduling problem at seaside container terminals
- Handling uncertainty in the quay crane scheduling problem: a unified distributionally robust decision model
This page was built for publication: Decomposition algorithms for the robust unidirectional quay crane scheduling problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6568488)