Please use this identifier to cite or link to this item:
|Title:||Deciding on planning windows by partitioning time for yard crane management in container terminals||Authors:||Guo, Xi
Huang, Shell Ying
|Keywords:||DRNTU::Engineering::Computer science and engineering::Computer applications::Physical sciences and engineering||Issue Date:||2010||Source:||Guo, X., & Huang, S. Y. (2010). Deciding on Planning Windows by Partitioning Time for Yard Crane Management in Container Terminals. Proceedings of the 1st International Conference on Computational Logistics.||Abstract:||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.||URI:||https://hdl.handle.net/10356/93901
|Rights:||© 2010 1st International Conference on Computational Logistics. This is the author created version of a work that has been peer reviewed and accepted for publication by 1st International Conference on Computational Logistics. It incorporates referee’s comments but changes resulting from the publishing process, such as copyediting, structural formatting, may not be reflected in this document. The official conference website is: http://gauss.econ.uni-hamburg.de/iccl2010/index.html.||Fulltext Permission:||open||Fulltext Availability:||With Fulltext|
|Appears in Collections:||SCSE Conference Papers|
Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.