Crane Scheduling Using Tabu Search

Publication Type

Conference Proceeding Article

Publication Date

2002

Abstract

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.

Discipline

Operations and Supply Chain Management

Research Areas

Operations Management

Publication

14th IEEE International Conference on Tools with Artificial Intelligence: Proceedings: ICTAI 2002: 4-6 November 2002, Washington DC

First Page

146

Last Page

153

ISBN

9780769518497

Identifier

10.1109/TAI.2002.1180799

Publisher

IEEE Computer Society

City or Country

Washington DC

Link to Full Text

Share

COinS