Abstract
This paper studies the Quay Crane Scheduling Problem (QCSP). The QCSP determines how a number of quay cranes should be scheduled in order to service a vessel with minimum makespan. Previous work considers the QCSP to be a combinatorially hard problem. For that reason, the focus has been on developing efficient heuristics. Our study shows, however, that the QCSP is tractable in the realistic setting, where quay cranes can share the workload of bays. We introduce a novel linear time algorithm that solves the QCSP and prove its correctness.
Original language | English |
---|---|
Title of host publication | International Conference on Computational Logistics : Lecture Notes in Computer Science |
Number of pages | 13 |
Volume | 13557 |
Publisher | Springer |
Publication date | 14 Sept 2022 |
Pages | 60–73 |
DOIs | |
Publication status | Published - 14 Sept 2022 |
Event | International Conference on Computational Logistics 2022 - Universitat Pompeu Fabra, Barcelona, Spain Duration: 21 Sept 2022 → 23 Sept 2022 https://eventum.upf.edu/78123/detail/international-conference-on-computational-logistics-iccl-2022.html |
Conference
Conference | International Conference on Computational Logistics 2022 |
---|---|
Location | Universitat Pompeu Fabra |
Country/Territory | Spain |
City | Barcelona |
Period | 21/09/2022 → 23/09/2022 |
Internet address |
Keywords
- Quay crane scheduling
- Container terminals
- Computational complexity