A lagrangian relaxation approach for solving the integrated quay crane assignment and scheduling problem

Yi Min Fu, Ali Diabat

    Research output: Contribution to journalArticle


    Decisions on the quay crane assignment problem and the quay crane scheduling problem are typically made independently. However, the efficiency of container terminals can be increased when these decisions are made simultaneously due to the interrelation between quay crane assignment and scheduling. A mathematical formulation for the integrated quay crane assignment and scheduling problem (QCASP) is developed in this paper. Practical considerations are incorporated in the model, such as quay crane (QC) interference. A Lagrangian relaxation is proposed for the model. Feasible solutions are then obtained from the proposed heuristic. Computational results are provided for the proposed Lagrangian relaxation.

    Original languageEnglish (US)
    Pages (from-to)1194-1201
    Number of pages8
    JournalApplied Mathematical Modelling
    Issue number3-4
    Publication statusPublished - Jan 1 2015



    • Integer programming
    • Integrated models
    • Lagrangian relaxation
    • Quay crane assignment
    • Quay crane scheduling

    ASJC Scopus subject areas

    • Modeling and Simulation
    • Applied Mathematics

    Cite this