Decomposition algorithms for the robust unidirectional quay crane scheduling problems

DOI10.1016/J.COR.2024.106670MaRDI QIDQ6568488FDO

Authors Yitian Li, Xinyi Li, Canrong Zhang, Tao Wu

Publication date 8 July 2024

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

zbMATH Keywords

robust optimizationBenders decompositioncolumn-and-constraint generationmaritime industryunidirectional quay crane scheduling

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Cites work

• scientific article; zbMATH DE number 5345854 (Why is no real title available?)
• A m‐parallel crane scheduling problem with a non‐crossing constraint
• A crane scheduling method for port container terminals
• A fast heuristic for quay crane scheduling with interference constraints
• 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
• A robust multiobjective model for the integrated berth and quay crane scheduling problem at seaside container terminals
• A survey of berth allocation and quay crane scheduling problems in container terminals
• A tabu search heuristic for the quay crane scheduling problem
• A two-stage robust model for a reliable \(p\)-center facility location problem
• Accelerating Benders Decomposition: Algorithmic Enhancement and Model Selection Criteria
• Algorithm Theory - SWAT 2004
• An effective mathematical formulation for the unidirectional cluster-based quay crane scheduling problem
• An exact algorithm for the unidirectional quay crane scheduling problem with vessel stability
• An exact robust approach for the integrated berth allocation and quay crane scheduling problem under uncertain arrival times
• Benders decomposition for production routing under demand uncertainty
• Berth allocation and quay crane assignment/scheduling problem under uncertainty: a survey
• Container terminal operation and operations research -- a classification and literature review
• Exact methods for the quay crane scheduling problem when tasks are modeled at the single container level
• Handling uncertainty in the quay crane scheduling problem: a unified distributionally robust decision model
• Introduction to stochastic programming.
• Modeling and solving rich quay crane scheduling problems
• Operations research at container terminals: a literature update
• Partitioning procedures for solving mixed-variables programming problems
• Quay crane scheduling at container terminals to minimize the maximum relative tardiness of vessel departures
• Solving two-stage robust optimization problems using a column-and-constraint generation method
• The Price of Robustness
• The quay crane scheduling problem with non-crossing and safety clearance constraints: an exact solution approach
• The quay crane scheduling problem with time windows
• The study of the unidirectional quay crane scheduling problem: complexity and risk-aversion
• Transshipment of containers at a container terminal: An overview

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)