Please use this identifier to cite or link to this item: https://doi.org/10.1016/j.tre.2011.04.004
Title: Heuristics for quay crane scheduling at indented berth
Authors: Chen, J.H.
Lee, D.-H. 
Cao, J.X.
Keywords: Heuristics
Indented berth
Quay crane scheduling
Issue Date: Nov-2011
Source: Chen, J.H., Lee, D.-H., Cao, J.X. (2011-11). Heuristics for quay crane scheduling at indented berth. Transportation Research Part E: Logistics and Transportation Review 47 (6) : 1005-1020. ScholarBank@NUS Repository. https://doi.org/10.1016/j.tre.2011.04.004
Abstract: This paper discusses the quay crane scheduling problem at indented berth, an extension to the current quay crane scheduling problem in the field of container terminal operation. A mixed integer programming model by considering the unique features of the quay crane scheduling problem at indented berth is formulated. For solution, decomposition heuristic framework is developed and enhanced by Tabu search. To evaluate the performance of the proposed heuristic framework, a comprehensive numerical test is carried out and its results show the good quality of the proposed heuristic framework. © 2011 Elsevier Ltd.
Source Title: Transportation Research Part E: Logistics and Transportation Review
URI: http://scholarbank.nus.edu.sg/handle/10635/59073
ISSN: 13665545
DOI: 10.1016/j.tre.2011.04.004
Appears in Collections:Staff Publications

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

SCOPUSTM   
Citations

24
checked on Dec 7, 2017

WEB OF SCIENCETM
Citations

15
checked on Nov 22, 2017

Page view(s)

33
checked on Dec 10, 2017

Google ScholarTM

Check

Altmetric


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