Name
Abstract | ||
|---|---|---|
Yard crane (YC) dispatching in the operational planning of container terminals usually aims to minimize makespan of YC operations or waiting time of vehicles. We propose that minimizing the maximum tardiness of vehicle jobs at yard blocks will minimize the operational delay of the longest quay crane (QC). This will minimize vessel turnaround time which is one of the most important objectives of container terminals. A provably optimal algorithm, MMT-RBA* to minimize maximum job tardiness, is presented to sequence the YC jobs. Jobs requiring reshuffling of other containers, often ignored in other studies, are handled by embedded simulation in our optimization algorithms. Another provably optimal algorithm, MMS-RBA* to minimize makespan, is also presented. Simulation experiments confirm that MMT-RBA* significantly outperforms the optimal algorithm RBA* to minimize vehicle waiting time from earlier studies and MMS-RBA* to minimize makespan in minimizing vessel turnaround time. |
Year | DOI | Venue |
|---|---|---|
2014 | 10.1109/WSC.2014.7020024 | Winter Simulation Conference |
Keywords | Field | DocType |
dispatching,scheduling,yard crane dispatching,mmt-rba,cranes,quay crane,optimization algorithm,sea ports,container terminal,mms-rba,makespan minimization,operational planning,minimisation,maximum job tardiness,vessel turnaround times | Operational planning,Tardiness,Job shop scheduling,Simulation,Computer science,Operations research,Yard,Turnaround time,Optimization algorithm | Conference |
ISSN | ISBN | Citations |
0891-7736 | 978-1-4673-9741-4 | 0 |
PageRank | References | Authors |
0.34 | 7 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Shell Ying Huang | 1 | 161 | 19.52 |
| Ya Li | 2 | 0 | 1.69 |
| Xi Guo | 3 | 59 | 5.95 |