Berth and quay crane allocation: a moldable task scheduling model
- 1 July 2011
- journal article
- Published by Informa UK Limited in Journal of the Operational Research Society
- Vol. 62 (7), 1189-1197
- https://doi.org/10.1057/jors.2010.54
Abstract
Journal of the Operational Research Society (JORS) is the world's longest established OR journal and an official journal of The OR Society. It is the aim of the Journal to present papers which are relevant to practitioners, researchers, teachers, students and consumers of operational research, and which cover the theory, practice, history or methodology of OR.Keywords
This publication has 27 references indexed in Scilit:
- 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
- A m‐parallel crane scheduling problem with a non‐crossing constraintNaval Research Logistics (NRL), 2006
- Quay crane scheduling at container terminals to minimize the maximum relative tardiness of vessel departuresNaval Research Logistics (NRL), 2005
- A multiprocessor task scheduling model for berth allocation: heuristic and worst-case analysisOperations Research Letters, 2002
- Berth scheduling for container terminals by using a sub-gradient optimization techniqueJournal of the Operational Research Society, 2002
- Scheduling with multiple-job-on-one-processor patternIIE Transactions, 1998
- The berth planning problemOperations Research Letters, 1998
- Efficient planning of berth allocation for container terminals in AsiaJournal of Advanced Transportation, 1997
- Critical Path Scheduling with Resource and Processor ConstraintsJournal of the ACM, 1982