The berth allocation problem with mobile quay walls: problem definition, solution procedures, and extensions

DOI10.1007/s10951-013-0358-5zbMath1297.90040OpenAlexW2161358000MaRDI QIDQ398926

Dirk Briskorn, Simon Emde, Nils Boysen

Publication date: 18 August 2014

Published in: Journal of Scheduling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10951-013-0358-5

zbMATH Keywords

branch-and-boundberth allocation problemcontainer logisticsmobile quay walls

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Transportation, logistics and supply chain management (90B06) Deterministic scheduling theory in operations research (90B35)

Related Items

A follow-up survey of berth allocation and quay crane scheduling problems in container terminals

Cites Work

• Unnamed Item
• Berth allocation at indented berths for mega-containerships
• A state-of-the-art review of parallel-machine scheduling research
• A survey of berth allocation and quay crane scheduling problems in container terminals
• The berth planning problem
• Container terminal operation and operations research -- a classification and literature review
• Operations research at container terminals: a literature update
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey