Quay crane scheduling in container terminals

In this report, a heuristic quay crane scheduling algorithm is designed to tackle the problem of determining the best allocation of quay cranes to bays of a particular container ship. Each bay consists of a number of jobs based on the number of containers that are to be loaded or unloaded from that...

Full description

Saved in:
Bibliographic Details
Main Author: Chan, Samson Yan Liang
Other Authors: Huang Shell Ying
Format: Final Year Project
Language:English
Published: 2017
Subjects:
Online Access:http://hdl.handle.net/10356/72910
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: Nanyang Technological University
Language: English
id sg-ntu-dr.10356-72910
record_format dspace
spelling sg-ntu-dr.10356-729102023-03-03T20:25:21Z Quay crane scheduling in container terminals Chan, Samson Yan Liang Huang Shell Ying School of Computer Science and Engineering DRNTU::Engineering::Computer science and engineering In this report, a heuristic quay crane scheduling algorithm is designed to tackle the problem of determining the best allocation of quay cranes to bays of a particular container ship. Each bay consists of a number of jobs based on the number of containers that are to be loaded or unloaded from that particular bay. The quay cranes will be allocated to more or less work relative to its adjacent cranes. This is dependent on the workload of the quay cranes in proximity to it. Also, the jobs in a bay may be split in 2 parts, where it will be handled by 2 cranes, should this prove to be more efficient. The objective is to balance the workloads among quay cranes and to reduce the turnaround time for the whole ship. In this report, the algorithm will repeatedly search for a better solution until a reasonable one is found, or stop when a better solution has not been found after a set number of times. Bachelor of Engineering (Computer Science) 2017-12-12T07:19:05Z 2017-12-12T07:19:05Z 2017 Final Year Project (FYP) http://hdl.handle.net/10356/72910 en Nanyang Technological University 116 p. application/pdf
institution Nanyang Technological University
building NTU Library
continent Asia
country Singapore
Singapore
content_provider NTU Library
collection DR-NTU
language English
topic DRNTU::Engineering::Computer science and engineering
spellingShingle DRNTU::Engineering::Computer science and engineering
Chan, Samson Yan Liang
Quay crane scheduling in container terminals
description In this report, a heuristic quay crane scheduling algorithm is designed to tackle the problem of determining the best allocation of quay cranes to bays of a particular container ship. Each bay consists of a number of jobs based on the number of containers that are to be loaded or unloaded from that particular bay. The quay cranes will be allocated to more or less work relative to its adjacent cranes. This is dependent on the workload of the quay cranes in proximity to it. Also, the jobs in a bay may be split in 2 parts, where it will be handled by 2 cranes, should this prove to be more efficient. The objective is to balance the workloads among quay cranes and to reduce the turnaround time for the whole ship. In this report, the algorithm will repeatedly search for a better solution until a reasonable one is found, or stop when a better solution has not been found after a set number of times.
author2 Huang Shell Ying
author_facet Huang Shell Ying
Chan, Samson Yan Liang
format Final Year Project
author Chan, Samson Yan Liang
author_sort Chan, Samson Yan Liang
title Quay crane scheduling in container terminals
title_short Quay crane scheduling in container terminals
title_full Quay crane scheduling in container terminals
title_fullStr Quay crane scheduling in container terminals
title_full_unstemmed Quay crane scheduling in container terminals
title_sort quay crane scheduling in container terminals
publishDate 2017
url http://hdl.handle.net/10356/72910
_version_ 1759854125061767168