Abstract This study presents a constraint programming (CP) model for the quay crane scheduling problem (QCSP), which occurs at container terminals, with realistic constraints such as safety margins, travel times and precedence relations. Next, QCSP with time windows and integrated crane assignment and scheduling problem, are discussed. The performance of the CP model is compared with that of algorithms presented in QCSP literature. The results of the computational experiments indicate that the CP model is able to produce good results while reducing the computational time, and is a robust and flexible alternative for different types of crane scheduling problems.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Constraint programming approach to quay crane scheduling problem


    Contributors:
    Unsal, Ozgur (author) / Oguz, Ceyda (author)


    Publication date :

    2013-08-25


    Size :

    15 pages




    Type of media :

    Article (Journal)


    Type of material :

    Electronic Resource


    Language :

    English





    Next-generation quay crane scheduling

    Abou Kasm, Omar / Diabat, Ali | Elsevier | 2020



    Quay crane and quay crane control method

    SATO SOSHI / KUBO HIROSHI / WATANABE SATOSHI et al. | European Patent Office | 2015

    Free access

    Quay crane diving platform and quay crane

    TENG XUCHUN / LEI QUANWEN / WENG WUWEI et al. | European Patent Office | 2023

    Free access