A bounded two-level dynamic programming algorithm for quay crane scheduling in container terminals
One of the optimization problems in terminal operations is the quay crane scheduling problem. The quay crane scheduling algorithm plays a critical role because it directly affects the length of the vessel loading and unloading process, which means vessel turnaround time. We propose a bounded two-lev...
Main Authors: | Huang, Shell Ying, Li, Ya |
---|---|
Other Authors: | School of Computer Science and Engineering |
Format: | Journal Article |
Language: | English |
Published: |
2018
|
Subjects: | |
Online Access: | https://hdl.handle.net/10356/89771 http://hdl.handle.net/10220/46732 |
Similar Items
-
Simulation optimization based ant colony algorithm for the uncertain quay crane scheduling problem
by: Naoufal Rouky, et al.
Published: (2019-01-01) -
Integrated Scheduling of Automated Yard Cranes and Automated Guided Vehicles with Limited Buffer Capacity of Dual-Trolley Quay Cranes in Automated Container Terminals
by: Doaa Naeem, et al.
Published: (2022-12-01) -
Joint Scheduling of Yard Crane, Yard Truck, and Quay Crane for Container Terminal Considering Vessel Stowage Plan: An Integrated Simulation-Based Optimization Approach
by: Hsien-Pin Hsu, et al.
Published: (2021-09-01) -
Container Terminal Berth-Quay Crane Capacity Planning Based on Markov Chain
by: Meixian Jiang, et al.
Published: (2021-04-01) -
Yard Crane Scheduling to Minimize Total Weighted Vessel Loading Time in Container Terminals
by: Huang, Shell Ying, et al.
Published: (2017)