A survey of berth allocation and quay crane scheduling problems in container terminals
- 1 May 2010
- journal article
- Published by Elsevier BV in European Journal of Operational Research
- Vol. 202 (3), 615-627
- https://doi.org/10.1016/j.ejor.2009.05.031
Abstract
No abstract availableKeywords
This publication has 71 references indexed in Scilit:
- A quay crane dynamic scheduling problem by hybrid evolutionary algorithm for berth allocation planningComputers & Industrial Engineering, 2009
- An efficient algorithm for solving a new mathematical model for a quay crane scheduling problem in container portsComputers & Industrial Engineering, 2009
- Heuristics for the integration of crane productivity in the berth allocation problemTransportation Research. Part E, Logistics and Transportation Review, 2009
- The simultaneous berth and quay crane allocation problemTransportation Research. Part E, Logistics and Transportation Review, 2008
- Berthing ships at a multi-user container terminal with a limited quay capacityTransportation Research. Part E, Logistics and Transportation Review, 2008
- Quay crane scheduling with non-interference constraints in port container terminalsTransportation Research. Part E, Logistics and Transportation Review, 2008
- Quay crane scheduling with handling priority in port container terminalsEngineering Optimization, 2008
- A m‐parallel crane scheduling problem with a non‐crossing constraintNaval Research Logistics (NRL), 2006
- Scheduling with multiple-job-on-one-processor patternIIE Transactions, 1998
- The berth planning problemOperations Research Letters, 1998