DocumentCode :
597405
Title :
Embedding simulation in yard crane dispatching to minimize job tardiness in container terminals
Author :
Shell Ying Huang ; Xi Guo ; Wen Jing Hsu ; Wei Lin Lim
Author_Institution :
Sch. of Comput. Eng., Nanyang Technol. Univ., Singapore, Singapore
fYear :
2012
fDate :
9-12 Dec. 2012
Firstpage :
1
Lastpage :
11
Abstract :
Two optimal algorithms, MTA* and MT-RBA*, are presented to find the optimal yard crane (YC) job sequence for serving a fleet of vehicles for delivery and pickup jobs with scheduled deadlines and predicted vehicle arrival times. The objective is to minimize the total tardiness of incoming vehicle jobs. This is important for minimizing vessel turnaround time. In the search for an optimal job sequence, the evaluation of the total tardiness of (partial) job sequences requires sequence dependent job service times. Simulation is embedded in our optimization algorithms to help provide accurate YC service times. This results in a more accurate evaluation of job tardiness but incurs costs. Experimental results show that this is feasible despite the simulation costs. MTA* and MT-RBA* significantly outperform the Earliest Due Date First and the Smallest Completion time Job First heuristics in minimizing job tardiness. MT-RBA* is computationally more efficient.
Keywords :
cranes; dispatching; job shop scheduling; minimisation; sea ports; MT-RBA* algorithm; MTA* algorithm; container terminals; delivery job; job sequence; job tardiness minimization; pickup job; vessel turnaround time; yard crane dispatching; Computational modeling; Containers; Dispatching; Loading; Planning; Prediction algorithms; Vehicles;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Simulation Conference (WSC), Proceedings of the 2012 Winter
Conference_Location :
Berlin
ISSN :
0891-7736
Print_ISBN :
978-1-4673-4779-2
Electronic_ISBN :
0891-7736
Type :
conf
DOI :
10.1109/WSC.2012.6465137
Filename :
6465137
Link To Document :
بازگشت