Please use this identifier to cite or link to this item:
Title: An improved approach for quay crane scheduling with non-crossing constraints
Authors: Lee, D.-H. 
Chen, J.H.
Keywords: Approximation algorithms
Non-crossing constraints
Quay crane scheduling
Issue Date: Jan-2010
Citation: Lee, D.-H., Chen, J.H. (2010-01). An improved approach for quay crane scheduling with non-crossing constraints. Engineering Optimization 42 (1) : 1-15. ScholarBank@NUS Repository.
Abstract: Common deficiencies found in previous studies that modelled quay crane scheduling with non-crossing constraints (QCSNC) in port container terminals are identified. Remedies for the problems are proposed to prevent the occurrence of unrealistic optimal solutions for QCSNC. Additionally, two approximation schemes for QCSNC are studied. The first one is called the best partition (BP) method, which can be solved by dynamic programming (DP) with time complexity of O(mn2). A more efficient algorithm is designed to improve the original DP by adopting binary search. Next, based on BP and an exact algorithm for QCSNC (with pseudo-polynomial computational time), the second approximation scheme, called the enhanced best partition (EBP) method, is proposed to achieve a better estimation of the optimal makespan for QCSNC. The results of numerical experiments show that EBP is an effective approximation scheme for the problem of QCSNC. © 2010 Taylor & Francis.
Source Title: Engineering Optimization
ISSN: 0305215X
DOI: 10.1080/03052150902943020
Appears in Collections:Staff Publications

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


checked on Aug 12, 2022


checked on Aug 12, 2022

Page view(s)

checked on Aug 4, 2022

Google ScholarTM



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