Deciding on planning windows by partitioning time for yard crane management in container terminals

• المؤلفون الرئيسيون: Guo, Xi, Huang, Shell Ying
• مؤلفون آخرون: School of Computer Engineering
• التنسيق: Conference or Workshop Item
• اللغة: English
• منشور في: 2011
• الموضوعات: DRNTU::Engineering::Computer science and engineering::Computer applications::Physical sciences and engineering
• الوصول للمادة أونلاين: https://hdl.handle.net/10356/93901; http://hdl.handle.net/10220/7080; http://gauss.econ.uni-hamburg.de/iccl2010/index.html
• المؤسسة: Nanyang Technological University

This paper proposes a new dynamic Yard Crane (YC) workload partition scheme in container terminals. The main contribution is the time partitioning algorithm which finds a sequence of time windows to match closely the changing workload distribution and get the maximum benefit of the space partition algorithm. Experimental results show that the proposed time partition algorithm plays the most important role in making substantial improvements over basic partition scheme in all tested workload scenarios.