Please use this identifier to cite or link to this item: https://doi.org/10.1080/03052150902943020
DC FieldValue
dc.titleAn improved approach for quay crane scheduling with non-crossing constraints
dc.contributor.authorLee, D.-H.
dc.contributor.authorChen, J.H.
dc.date.accessioned2014-10-07T06:26:06Z
dc.date.available2014-10-07T06:26:06Z
dc.date.issued2010-01
dc.identifier.citationLee, 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. https://doi.org/10.1080/03052150902943020
dc.identifier.issn0305215X
dc.identifier.urihttp://scholarbank.nus.edu.sg/handle/10635/84518
dc.description.abstractCommon 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.
dc.description.urihttp://libproxy1.nus.edu.sg/login?url=http://dx.doi.org/10.1080/03052150902943020
dc.sourceScopus
dc.subjectApproximation algorithms
dc.subjectNon-crossing constraints
dc.subjectQuay crane scheduling
dc.typeArticle
dc.contributor.departmentCIVIL ENGINEERING
dc.description.doi10.1080/03052150902943020
dc.description.sourcetitleEngineering Optimization
dc.description.volume42
dc.description.issue1
dc.description.page1-15
dc.description.codenEGOPA
dc.identifier.isiut000277512500001
Appears in Collections:Staff Publications

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

SCOPUSTM   
Citations

34
checked on Jan 26, 2022

WEB OF SCIENCETM
Citations

29
checked on Jan 18, 2022

Page view(s)

119
checked on Jan 27, 2022

Google ScholarTM

Check

Altmetric


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