Crane scheduling in container yards with inter-crane interference

Abstract

This paper examines the problem of scheduling multiple yard cranes to perform a given set of jobs with different ready times in a yard zone with only one bi-directional travelling lane. Due to sharing of the travelling lane among two or more yard cranes, inter-crane interference, a planned move of a yard crane blocked by the other yard cranes, may happen. The scheduling problem is formulated as an integer program. It is noted that the scheduling problem is NP-complete. This research develops a dynamic programming-based heuristic to solve the scheduling problem and an algorithm to find lower bounds for benchmarking the schedules found by the heuristic. Computational experiments are carried out to evaluate the performance of the heuristic and the results show that the heuristic can indeed find effective solutions for the scheduling problem, with the heuristic solutions on average 7.3% above their lower bounds. © 2004 Elsevier B.V. All rights reserved.