Please use this identifier to cite or link to this item:
|Title:||Heuristics for quay crane scheduling at indented berth|
Quay crane scheduling
|Citation:||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.|
|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|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Feb 26, 2018
WEB OF SCIENCETM
checked on Apr 24, 2018
checked on May 18, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.