Paper Info
Title
Embedding simulation in yard crane dispatching to minimize job tardiness in container terminals
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.
Year
DOI
Venue
2012
10.1109/WSC.2012.6465137
Winter Simulation Conference
Keywords
Field
DocType
dispatching,pickup job,yard crane dispatching,job sequence,optimal yard crane,cranes,optimal job sequence,sequence dependent job service,job tardiness,job first heuristics,job shop scheduling,sea ports,embedding simulation,mta* algorithm,container terminal,incoming vehicle job,delivery job,vessel turnaround time,total tardiness,mt-rba* algorithm,container terminals,minimisation,job tardiness minimization,optimal algorithm
Tardiness,Job shop scheduling,Embedding,Computer science,Simulation,Yard,Minimisation (psychology),Heuristics,Turnaround time,Job queue
Conference
ISSN
ISBN
Citations 
0891-7736 E-ISBN : 978-1-4673-4781-5
978-1-4673-4781-5
2
PageRank 
References 
Authors
0.44
9
4
Name
Order
Citations
PageRank
Shell Ying Huang116119.52
Xi Guo2595.95
Wen Jing Hsu317413.70
Wei Lin Lim420.44