On the Berth Allocation Problem

DOI10.1051/RO/2015029zbMath1351.90021OpenAlexW2401712499MaRDI QIDQ2826660

Shaikha Ahmed Jumaa Alzaabi, Ali H. Diabat

Publication date: 18 October 2016

Published in: RAIRO - Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1051/ro/2015029

zbMATH Keywords

mixed integer programmingberth allocation problem

Mathematics Subject Classification ID

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

Related Items (2)

An integrated berth allocation and yard assignment problem for bulk ports: Formulation and case study ⋮ A Lagrangian relaxation-based heuristic for the multi-ship quay crane scheduling problem with ship stability constraints

Cites Work

• A follow-up survey of berth allocation and quay crane scheduling problems in container terminals
• Berth allocation with time-dependent physical limitations on vessels
• A Lagrangian relaxation-based heuristic for the multi-ship quay crane scheduling problem with ship stability constraints
• A joint quay crane assignment and scheduling problem: formulation, solution algorithm and computational results
• An integrated berth allocation and yard assignment problem for bulk ports: Formulation and case study
• The Dynamic Berth Allocation Problem: A linearized formulation

This page was built for publication: On the Berth Allocation Problem