Article ID: | iaor2005986 |
Country: | Germany |
Volume: | 26 |
Issue: | 1 |
Start Page Number: | 51 |
End Page Number: | 74 |
Publication Date: | Jan 2004 |
Journal: | OR Spektrum |
Authors: | Hartmann S. |
Keywords: | scheduling |
In this paper, we propose a general model for various scheduling problems that occur in container terminal logistics. The scheduling model consists of the assignment of jobs to resources and the temporal arrangement of the jobs subject to precedence constraints and sequence-dependent setup times. We demonstrate how the model can be applied to solve several different real-world problems from container terminals in the port of Hamburg (Germany). We consider scheduling problems for straddle carriers, automated guided vehicles, stacking cranes, and workers who handle reefer containers. Subsequently, we discuss priority rule based heuristics as well as a genetic algorithm for the general model. Based on a tailored generator for experimental data, we examine the performance of the heuristics in a computational study. We obtain promising results that suggest that the genetic algorithm is well suited for application in practice.