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 𝒪(mn 2). 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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
