Yard Crane Scheduling to Minimize Total Weighted Vessel Loading Time in Container Terminals

One of the most important objectives for container terminals is to minimize the total weighted turnaround time for vessels. Minimizing total weighted vessel loading time directly helps minimize total weighted vessel turnaround time. In this paper we consider the yard crane (YC) scheduling problem in...

全面介紹

Saved in:
書目詳細資料
Main Authors: Huang, Shell Ying, Li, Ya
其他作者: School of Computer Science and Engineering
格式: Article
語言:English
出版: 2017
主題:
在線閱讀:https://hdl.handle.net/10356/86084
http://hdl.handle.net/10220/44157
標簽: 添加標簽
沒有標簽, 成為第一個標記此記錄!
機構: Nanyang Technological University
語言: English
實物特徵
總結:One of the most important objectives for container terminals is to minimize the total weighted turnaround time for vessels. Minimizing total weighted vessel loading time directly helps minimize total weighted vessel turnaround time. In this paper we consider the yard crane (YC) scheduling problem in a multi-vessel loading process. We propose a YC scheduling system that minimizes the total weighted maximum tardiness of loading jobs. Our experiments show that this is significantly more effective in the minimization of the total weighted vessel loading time than the existing YC scheduling methods that minimize job waiting time or makespan. Our scheduling system also has the ability to dynamically optimize the YC operations with the consideration of the maximum tardiness already incurred to each vessel earlier in the loading process. To evaluate against our YC scheduling system, an optimal algorithm to minimize makespan (useful if there is YCs shortage) and an optimal algorithm to minimize total weighted job tardiness (common in manufacturing) are also proposed.