Please use this identifier to cite or link to this item: https://dl.ucsc.cmb.ac.lk/jspui/handle/123456789/4356
Title: Berth Allocation and Quay Crane Scheduling for Jaya Container Terminal - Sri Lanka Ports Authority
Authors: Madhushantha, W.M.D.M.
Issue Date: 2-Aug-2021
Abstract: The maximum utilization of resources is the key aspect for reducing the turnaround time of vessel calls for any container terminal. Among the various resources, effective utilization of berth and quay cranes are directly subscribed causes for the two important optimization problems arisen, which are the berth allocation and quay crane scheduling problems. The berth allocation problem deals with the generation of a berth plan, which determines a suitable berth and when a vessel has to berth alongside the quay. The quay crane scheduling problem illustrates the problem of allocating how many and which quay cranes will serve for each vessel. In view of resolving the problems identified in quayside port operations, this project discusses the need for integrated optimization of Berth Allocation Problem (BAP) and Quay Crane Scheduling (QCS) under any circumstances. Online optimization of quayside resources is also a significant need in terms of unpredicted conditions. Therefore, in order to provide provision in discussing the project models associated with solving resource allocation for incoming vessels in port operations, this report emphasizes the current state in relevant technologies and methods applicable in the industry. Hence, in this project, it is mainly focused on resource allocation problems which related to BAP, QCS in Jaye Container Terminal (JCT) of Sri Lanka Ports Authority (SLPA).
URI: http://dl.ucsc.cmb.ac.lk/jspui/handle/123456789/4356
Appears in Collections:2019

Files in This Item:
File Description SizeFormat 
2016MIT038.pdf3.01 MBAdobe PDFView/Open


Items in UCSC Digital Library are protected by copyright, with all rights reserved, unless otherwise indicated.