A Linear Time Algorithm for Optimal Quay Crane Scheduling

Mathias Offerlin Herup, Gustav Christian Wichmann Thiesgaard, Jaike van Twiller, Rune Møller Jensen

    Publikation: Konference artikel i Proceeding eller bog/rapport kapitelKonferencebidrag i proceedingsForskningpeer review

    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.
    OriginalsprogEngelsk
    Titel International Conference on Computational Logistics : Lecture Notes in Computer Science
    Antal sider13
    Vol/bind13557
    ForlagSpringer
    Publikationsdato14 sep. 2022
    Sider60–73
    DOI
    StatusUdgivet - 14 sep. 2022
    BegivenhedInternational Conference on Computational Logistics 2022 - Universitat Pompeu Fabra, Barcelona, Spanien
    Varighed: 21 sep. 202223 sep. 2022
    https://eventum.upf.edu/78123/detail/international-conference-on-computational-logistics-iccl-2022.html

    Konference

    KonferenceInternational Conference on Computational Logistics 2022
    LokationUniversitat Pompeu Fabra
    Land/OmrådeSpanien
    ByBarcelona
    Periode21/09/202223/09/2022
    Internetadresse

    Emneord

    • Quay crane scheduling
    • Container terminals
    • Computational complexity

    Fingeraftryk

    Dyk ned i forskningsemnerne om 'A Linear Time Algorithm for Optimal Quay Crane Scheduling'. Sammen danner de et unikt fingeraftryk.

    Citationsformater