Deciding on planning windows by partitioning time

for yard crane management in container terminals

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

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...

Saved in:

書目詳細資料
Main Authors:	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
標簽:	添加標簽沒有標簽, 成為第一個標記此記錄!

實物特徵
總結:	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.