Please use this identifier to cite or link to this item:
|Title:||An approximation algorithm for quay crane scheduling with handling priority in port container terminals||Authors:||Lee, D.-H.
port container terminal
quay crane scheduling
|Issue Date:||Dec-2010||Citation:||Lee, D.-H., Wang, H.Q. (2010-12). An approximation algorithm for quay crane scheduling with handling priority in port container terminals. Engineering Optimization 42 (12) : 1151-1161. ScholarBank@NUS Repository. https://doi.org/10.1080/03052151003686708||Abstract:||The quay crane scheduling problem studied in this article is to determine the handling sequence of ship bays for quay cranes assigned to a container ship considering handling priority of every ship bay. This article provides a mixed integer programming model for the considered quay crane scheduling problem that is NP-complete in nature. An approximation algorithm is proposed to obtain near optimal solutions and a worst-case analysis for the approximation algorithm is performed. Computational experiments are conducted to examine the proposed model and solution algorithm. The computational results show that the proposed approximation algorithm is effective and efficient in solving the considered quay crane scheduling problem. © 2010 Taylor & Francis.||Source Title:||Engineering Optimization||URI:||http://scholarbank.nus.edu.sg/handle/10635/65116||ISSN:||0305215X||DOI:||10.1080/03052151003686708|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.