We examine crane scheduling for ports. This important component of port operations management is studied when certain spatial constraints, which are common to crane operations, are considered. Although there has been some work on crane scheduling, such spatial constraints have not been previously developed. We assume that ships can be divided into holds and that cranes can move from hold to hold but that only one crane can work on one hold or job at any one time. The objective is to find a crane-to-job matching which will maximize throughput for such operations under these basic spatial constraints. We propose two dynamic programming algorithms, prove NP-completeness of the problem and provide heuristics to solve the crane scheduling problem with spatial constraints. We develop probabilistic tabu search techniques for application to the problem which are easy to implement. In experiments, we compare the performance of tabu search with other algorithms applied to the crane scheduling problem.
[1]
Carlos F. Daganzo,et al.
THE CRANE SCHEDULING PROBLEM
,
1989
.
[2]
Chung-Lun Li,et al.
Analysis of a new vehicle scheduling and location problem
,
2001
.
[3]
R. K. Shyamasundar,et al.
Introduction to algorithms
,
1996
.
[4]
Y. Ge,et al.
Crane scheduling with time windows in circuit board production lines
,
1995
.
[5]
Hirofumi Matsuo,et al.
Crane scheduling problem in a computer-integrated manufacturing environment
,
1991
.
[6]
Stefan Voß,et al.
Modern Heuristic Search Methods for the Steiner Tree Problem in Graphs
,
2000
.
[7]
Victor J. Rayward-Smith,et al.
Modern Heuristic Search Methods
,
1996
.
[8]
Peng-Hong Koh,et al.
Using simulation to preview plans of a container port operations
,
1994,
Proceedings of Winter Simulation Conference.
[9]
Carlos F. Daganzo,et al.
A branch and bound solution method for the crane scheduling problem
,
1990
.