Berthing ships at a multi-user container terminal with a limited quay capacity
- 1 January 2008
- journal article
- Published by Elsevier BV in Transportation Research. Part E, Logistics and Transportation Review
- Vol. 44 (1), 136-151
- https://doi.org/10.1016/j.tre.2006.05.002
Abstract
No abstract availableKeywords
This publication has 18 references indexed in Scilit:
- Models and Tabu Search Heuristics for the Berth-Allocation ProblemTransportation Science, 2005
- Corrigendum to “The dynamic berth allocation problem for a container port” [Transportation Research Part B 35 (2001) 401–417]Transportation Research Part B: Methodological, 2005
- Berth allocation in a container port: using a continuous location space approachTransportation Research Part B: Methodological, 2005
- Berth allocation with service priorityTransportation Research Part B: Methodological, 2003
- A multiprocessor task scheduling model for berth allocation: heuristic and worst-case analysisOperations Research Letters, 2002
- The dynamic berth allocation problem for a container portTransportation Research Part B: Methodological, 2001
- A greedy genetic algorithm for the quadratic assignment problemComputers & Operations Research, 2000
- Optimizing submarine berthing with a persistence incentiveNaval Research Logistics (NRL), 1997
- Efficient planning of berth allocation for container terminals in AsiaJournal of Advanced Transportation, 1997
- Optimizing ship berthingNaval Research Logistics (NRL), 1994