Please use this identifier to cite or link to this item: https://doi.org/10.1080/03052150701686366
DC FieldValue
dc.titleQuay crane scheduling with handling priority in port container terminals
dc.contributor.authorLee, D.-H.
dc.contributor.authorWang, H.Q.
dc.contributor.authorMiao, L.
dc.date.accessioned2014-06-17T08:23:34Z
dc.date.available2014-06-17T08:23:34Z
dc.date.issued2008-02
dc.identifier.citationLee, 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
dc.identifier.issn0305215X
dc.identifier.urihttp://scholarbank.nus.edu.sg/handle/10635/66043
dc.description.abstractThe 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.
dc.description.urihttp://libproxy1.nus.edu.sg/login?url=http://dx.doi.org/10.1080/03052150701686366
dc.sourceScopus
dc.subjectGenetic algorithm
dc.subjectHandling priority
dc.subjectPort container terminal
dc.subjectQuay crane scheduling
dc.typeArticle
dc.contributor.departmentCIVIL ENGINEERING
dc.description.doi10.1080/03052150701686366
dc.description.sourcetitleEngineering Optimization
dc.description.volume40
dc.description.issue2
dc.description.page179-189
dc.description.codenEGOPA
dc.identifier.isiut000253808600005
Appears in Collections:Staff Publications

Show simple item record
Files in This Item:
There are no files associated with this item.

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.