Crane scheduling with spatial constraints
Version of Record online: 23 FEB 2004
Copyright © 2004 Wiley Periodicals, Inc.
Naval Research Logistics (NRL)
Volume 51, Issue 3, pages 386–406, April 2004
How to Cite
Lim, A., Rodrigues, B., Xiao, F. and Zhu, Y. (2004), Crane scheduling with spatial constraints. Naval Research Logistics, 51: 386–406. doi: 10.1002/nav.10123
- Issue online: 5 MAR 2004
- Version of Record online: 23 FEB 2004
- Manuscript Accepted: 17 NOV 2003
- Manuscript Revised: 30 OCT 2003
- Manuscript Received: 23 APR 2002
- Logistics and Supply Chain Institute
- Hong Kong University of Science and Technology
- dynamic programming;
In this work, we examine port crane scheduling with spatial and separation constraints. Although common to most port operations, these constraints have not been previously studied. We assume that cranes cannot cross, there is a minimum distance between cranes and jobs cannot be done simultaneously. The objective is to find a crane-to-job matching which maximizes throughput under these constraints. We provide dynamic programming algorithms, a probabilistic tabu search, and a squeaky wheel optimization heuristic for solution. Experiments show the heuristics perform well compared with optimal solutions obtained by CPLEX for small scale instances where a squeaky wheel optimization with local search approach gives good results within short times. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004.