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.
quay crane scheduling, container terminals, bucket brigades, self-organising systems
MSc in Operations Management
Operations and Supply Chain Management
LIM, Yun Fong
Dynamic Quay Crane Allocation. (2010). Dissertations and Theses Collection (Open Access).
Available at: http://ink.library.smu.edu.sg/etd_coll/62
Creative Commons License
This work is licensed under a Creative Commons Attribution-Noncommercial-No Derivative Works 4.0 License.