Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
483014 | European Journal of Operational Research | 2007 | 19 Pages |
Abstract
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.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
Lu Chen, Nathalie Bostel, Pierre Dejax, Jianguo Cai, Lifeng Xi,