Berth allocation in a container port: using a continuous location space approach
Top Cited Papers
- 31 March 2005
- journal article
- Published by Elsevier BV in Transportation Research Part B: Methodological
- Vol. 39 (3), 199-221
- https://doi.org/10.1016/j.trb.2004.04.004
Abstract
No abstract availableThis publication has 14 references indexed in Scilit:
- 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 scheduling by simulated annealingTransportation Research Part B: Methodological, 2003
- 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
- Scheduling with multiple-job-on-one-processor patternIIE Transactions, 1998
- 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
- A study of container berth allocationJournal of Advanced Transportation, 1992