Crane scheduling with spatial constraints

• DOI: 10.1002/nav.10123
• Publication Date: 2004-03-08T08:00:32Z
• Authors: Andrew Lim; Brian Rodrigues; Fei Xiao; Yi Zhu
• Keywords: dynamic programming; Scheduling; 0211 other engineering and technologies; Heuristics; scheduling; heuristics; 02 engineering and technology; Operations and Supply Chain Management; Dynamic programming

AbstractIn 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.