Please use this identifier to cite or link to this item: https://doi.org/10.1080/0305215X.2010.532551
Title: Quay crane scheduling for an indented berth
Authors: Lee, D.-H. 
Chen, J.H.
Cao, J.X.
Keywords: heuristic
indented berth
quay crane scheduling
Tabu search
Issue Date: Sep-2011
Source: Lee, D.-H., Chen, J.H., Cao, J.X. (2011-09). Quay crane scheduling for an indented berth. Engineering Optimization 43 (9) : 985-998. ScholarBank@NUS Repository. https://doi.org/10.1080/0305215X.2010.532551
Abstract: This article explores the quay crane scheduling problem at an indented berth. The indented berth is known as an innovative implementation in the container terminals to tackle the challenge from the emergence of more and more mega-containerships. A mixed integer programming model by considering the non-crossing and safety distance constraints is formulated. A Tabu search heuristic is developed to solve the proposed problem. The computational results from this research indicate that the designed Tabu search is an effective method to handle the quay crane scheduling problem at an indented berth. © 2011 Taylor & Francis.
Source Title: Engineering Optimization
URI: http://scholarbank.nus.edu.sg/handle/10635/59178
ISSN: 0305215X
DOI: 10.1080/0305215X.2010.532551
Appears in Collections:Staff Publications

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

SCOPUSTM   
Citations

5
checked on Dec 14, 2017

WEB OF SCIENCETM
Citations

5
checked on Nov 19, 2017

Page view(s)

72
checked on Dec 10, 2017

Google ScholarTM

Check

Altmetric


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