Article ID: | iaor20105501 |
Volume: | 42 |
Issue: | 1 |
Start Page Number: | 1 |
End Page Number: | 15 |
Publication Date: | Jan 2010 |
Journal: | Engineering Optimization |
Authors: | Lee Der-Horng, Chen Jiang Hang |
Keywords: | programming: dynamic |
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(