The Berth Allocation Problem with a Cut-and-Run Option

DOI10.1007/978-3-642-00142-0_46zbMath1209.90024OpenAlexW2254180202MaRDI QIDQ5392046

Frank Meisel, Christian Bierwirth

Publication date: 7 April 2011

Published in: Operations Research Proceedings 2008 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-00142-0_46

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59) Inventory, storage, reservoirs (90B05)

Related Items (2)

Optimal berth allocation and time-invariant quay crane assignment in container terminals ⋮ A survey of berth allocation and quay crane scheduling problems in container terminals

This page was built for publication: The Berth Allocation Problem with a Cut-and-Run Option