Publication Type
Master Thesis
Version
publishedVersion
Publication Date
2010
Abstract
We introduce simple rules for quay cranes to handle containers along a berth where vessels arrive continuously in time. We first analyze a model where workload is continuous. Our analysis shows that if the system is configured properly, it will always converge to a state with the maximum possible throughput regardless of external disruptions or changes in workload. Numerical simulations based on a discrete workload model suggest that, by following the same rules, the system can still converge to state with throughput that is very close to its upper bound.
Keywords
quay crane scheduling, container terminals, bucket brigades, self-organising systems
Degree Awarded
MSc in Operations Management
Discipline
Operations and Supply Chain Management
Supervisor(s)
LIM, Yun Fong
Publisher
Singapore Management University
City or Country
Singapore
Citation
ZHANG, Yan.
Dynamic Quay Crane Allocation. (2010).
Available at: https://ink.library.smu.edu.sg/etd_coll/62
Copyright Owner and License
Author
Creative Commons License
This work is licensed under a Creative Commons Attribution-NonCommercial-No Derivative Works 4.0 International License.