A tabu search algorithm for the integrated scheduling problem of container handling systems in a maritime terminal

The scheduling problem in a container terminal is characterized by the coordination of different types of equipment. In this paper, we present an integrated model to schedule the equipment. The objective is to minimize the makespan, or the time it takes to serve a given set of ships. The problem is...

Full description

Saved in:
Bibliographic Details
Published in:European journal of operational research 2007-08, Vol.181 (1), p.40-58
Main Authors: Chen, Lu, Bostel, Nathalie, Dejax, Pierre, Cai, Jianguo, Xi, Lifeng
Format: Article
Language:English
Subjects:
Algorithms
Applied sciences
Computer Science
Container terminal
Exact sciences and technology
Hybrid Flow Shop
Job shops
Makespan
Operational research and scientific management
Operational research. Management science
Operations Research
Scheduling
Scheduling, sequencing
Studies
Tabu Search
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:The scheduling problem in a container terminal is characterized by the coordination of different types of equipment. In this paper, we present an integrated model to schedule the equipment. The objective is to minimize the makespan, or the time it takes to serve a given set of ships. The problem is formulated as a Hybrid Flow Shop Scheduling problem with precedence and Blocking constraints ( HFSS-B). A tabu search algorithm is proposed to solve this problem. Certain mechanisms are developed and introduced into the algorithm to assure its quality and efficiency. The performance of the tabu search algorithm is analyzed from the computational point of view.
ISSN:0377-2217
1872-6860
DOI:10.1016/j.ejor.2006.06.033