Please use this identifier to cite or link to this item: https://doi.org/10.1016/j.tre.2006.08.001
Title: Quay crane scheduling with non-interference constraints in port container terminals
Authors: Lee, D.-H. 
Wang, H.Q.
Miao, L.
Keywords: Genetic algorithm
NP-completeness
Port container terminal
Quay crane scheduling
Issue Date: Jan-2008
Citation: Lee, D.-H., Wang, H.Q., Miao, L. (2008-01). Quay crane scheduling with non-interference constraints in port container terminals. Transportation Research Part E: Logistics and Transportation Review 44 (1) : 124-135. ScholarBank@NUS Repository. https://doi.org/10.1016/j.tre.2006.08.001
Abstract: The quay crane scheduling problem studied in this paper is to determine a handling sequence of holds for quay cranes assigned to a container vessel considering interference between quay cranes. This paper provides a mixed integer programming model for the considered quay crane scheduling problem that is NP-complete in nature. A genetic algorithm is proposed to obtain near optimal solutions. Computational experiments are conducted to examine the proposed model and solution algorithm. The computational results show that the proposed genetic algorithm is effective and efficient in solving the considered quay crane scheduling problem. © 2006 Elsevier Ltd. All rights reserved.
Source Title: Transportation Research Part E: Logistics and Transportation Review
URI: http://scholarbank.nus.edu.sg/handle/10635/66044
ISSN: 13665545
DOI: 10.1016/j.tre.2006.08.001
Appears in Collections:Staff Publications

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

SCOPUSTM   
Citations

168
checked on Nov 6, 2018

WEB OF SCIENCETM
Citations

134
checked on Oct 22, 2018

Page view(s)

75
checked on Sep 22, 2018

Google ScholarTM

Check

Altmetric


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