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: | , |
---|---|
Other Authors: | |
Format: | Article |
Language: | English |
Published: |
2017
|
Subjects: | |
Online Access: | https://hdl.handle.net/10356/86084 http://hdl.handle.net/10220/44157 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Nanyang Technological University |
Language: | English |
id |
sg-ntu-dr.10356-86084 |
---|---|
record_format |
dspace |
spelling |
sg-ntu-dr.10356-860842020-03-07T11:48:52Z Yard Crane Scheduling to Minimize Total Weighted Vessel Loading Time in Container Terminals Huang, Shell Ying Li, Ya School of Computer Science and Engineering Container Terminal Yard crane scheduling 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. Accepted version 2017-12-18T05:20:00Z 2019-12-06T16:15:40Z 2017-12-18T05:20:00Z 2019-12-06T16:15:40Z 2018 2017 Journal Article Huang, S. Y. & Li, Y. (2017). Yard crane scheduling to minimize total weighted vessel loading time in container terminals. Flexible Services and Manufacturing Journal, 29(3-4), 689–720. 1936-6582 https://hdl.handle.net/10356/86084 http://hdl.handle.net/10220/44157 10.1007/s10696-017-9299-1 202592 en Flexible Services and Manufacturing Journal © 2017 Springer Science+Business Media. This is the author created version of a work that has been peer reviewed and accepted for publication by Flexible Services and Manufacturing Journal, Springer Science+Business Media. It incorporates referee’s comments but changes resulting from the publishing process, such as copyediting, structural formatting, may not be reflected in this document. The published version is available at: [https://doi.org/10.1007/s10696-017-9299-1]. 28 p. application/pdf |
institution |
Nanyang Technological University |
building |
NTU Library |
country |
Singapore |
collection |
DR-NTU |
language |
English |
topic |
Container Terminal Yard crane scheduling |
spellingShingle |
Container Terminal Yard crane scheduling Huang, Shell Ying Li, Ya Yard Crane Scheduling to Minimize Total Weighted Vessel Loading Time in Container Terminals |
description |
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. |
author2 |
School of Computer Science and Engineering |
author_facet |
School of Computer Science and Engineering Huang, Shell Ying Li, Ya |
format |
Article |
author |
Huang, Shell Ying Li, Ya |
author_sort |
Huang, Shell Ying |
title |
Yard Crane Scheduling to Minimize Total Weighted Vessel Loading Time in Container Terminals |
title_short |
Yard Crane Scheduling to Minimize Total Weighted Vessel Loading Time in Container Terminals |
title_full |
Yard Crane Scheduling to Minimize Total Weighted Vessel Loading Time in Container Terminals |
title_fullStr |
Yard Crane Scheduling to Minimize Total Weighted Vessel Loading Time in Container Terminals |
title_full_unstemmed |
Yard Crane Scheduling to Minimize Total Weighted Vessel Loading Time in Container Terminals |
title_sort |
yard crane scheduling to minimize total weighted vessel loading time in container terminals |
publishDate |
2017 |
url |
https://hdl.handle.net/10356/86084 http://hdl.handle.net/10220/44157 |
_version_ |
1681037819649196032 |