Please use this identifier to cite or link to this item:
|Title:||Quay crane scheduling with handling priority in port container terminals||Authors:||Lee, D.-H.
Port container terminal
Quay crane scheduling
|Issue Date:||Feb-2008||Citation:||Lee, D.-H., Wang, H.Q., Miao, L. (2008-02). Quay crane scheduling with handling priority in port container terminals. Engineering Optimization 40 (2) : 179-189. ScholarBank@NUS Repository. https://doi.org/10.1080/03052150701686366||Abstract:||The quay crane scheduling problem studied in this article is to determine a 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 problem. A genetic algorithm (GA) is proposed to obtain near-optimal solutions. Computational experiments to examine the proposed model and solution algorithm are described. The computational results show that the proposed GA is effective and efficient in solving the considered quay crane scheduling problem.||Source Title:||Engineering Optimization||URI:||http://scholarbank.nus.edu.sg/handle/10635/66043||ISSN:||0305215X||DOI:||10.1080/03052150701686366|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Apr 13, 2019
WEB OF SCIENCETM
checked on Mar 27, 2019
checked on Feb 2, 2019
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.