Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
4959770 | European Journal of Operational Research | 2017 | 23 Pages |
Abstract
In port container terminals, the scheduling of quay cranes (QCs) for a container vessel is one of the most critical operations. This paper investigates the problem of scheduling quay cranes with non-crossing constraints, wherein QCs cannot cross over each other because they are on the same track. The objective is to minimise the makespan of a container vessel, which is the latest completion time among all handling tasks of the vessel. Compared with several 2-approximation algorithms in the literature, this paper presents an approximation algorithm with a worst case ratio 2â2m+1<2 for any m QCs. This ratio is demonstrated to be the best possible among all partition-based algorithms in the literature. Besides, we study the scheduling of two quay cranes with different processing speeds. For an arbitrary speed ratio s ⥠1, an approximation algorithm with worst case ratio (1+s)21+s+s2 is provided.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
An Zhang, Wenshuai Zhang, Yong Chen, Guangting Chen, Xufeng Chen,