A decomposition method for the group-based quay crane scheduling problem

DOI10.1287/IJOC.2022.0298MaRDI QIDQ6580542zbMATH OpenFDO

Authors Defeng Sun, Lixin Tang, Roberto Baldacci, Zihan Chen

Publication date 29 July 2024

Published in INFORMS Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/IJOC.2022.0298

zbMATH Keywords

branch-and-cutcontainer terminal operationslogic-based Benders decompositionmulti-directional quay crane scheduling

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Deterministic scheduling theory in operations research (90B35)

Recommendations

• An exact algorithm for the unidirectional quay crane scheduling problem with vessel stability
• A Benders decomposition-based framework for solving quay crane scheduling problems
• The quay crane scheduling problem with non-crossing and safety clearance constraints: an exact solution approach
• An effective mathematical formulation for the unidirectional cluster-based quay crane scheduling problem
• Exact and heuristic methods for the integrated berth allocation and specific time-invariant quay crane assignment problems

This page was built for publication: A decomposition method for the group-based quay crane scheduling problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6580542)