The berth allocation problem with mobile quay walls: problem definition, solution procedures, and extensions
DOI10.1007/S10951-013-0358-5zbMATH Open1297.90040OpenAlexW2161358000MaRDI QIDQ398926FDOQ398926
Authors: Simon Emde, Nils Boysen, Dirk Briskorn 
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
Recommendations
- Optimal berth allocation and time-invariant quay crane assignment in container terminals
- The berth allocation problem with a cut-and-run option
- New exact methods for the time-invariant berth allocation and quay crane assignment problem
- On the berth allocation problem
- A survey of berth allocation and quay crane scheduling problems in container terminals
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35) Transportation, logistics and supply chain management (90B06)
Cites Work
- Title not available (Why is that?)
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- A survey of berth allocation and quay crane scheduling problems in container terminals
- Container terminal operation and operations research -- a classification and literature review
- A state-of-the-art review of parallel-machine scheduling research
- Operations research at container terminals: a literature update
- The berth planning problem
- Berth allocation at indented berths for mega-containerships
Cited In (1)
This page was built for publication: The berth allocation problem with mobile quay walls: problem definition, solution procedures, and extensions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q398926)
