Exact methods for the quay crane scheduling problem when tasks are modeled at the single container level

Mohamed Kais Msakni, Ali Diabat, Ghaith Rabadi, Mohamed Al-Salem, Mariam Kotachi

    Research output: Contribution to journalArticle

    Abstract

    The scheduling of quay cranes (QCs) to minimize the handling time of a berthed vessel is one of the most important operations in container terminals as it impacts the terminal's overall productivity. In this paper, we propose two exact methods to solve the quay crane scheduling problem (QCSP) where a task is defined as handling a single container and subject to different technical constraints including QCs’ safety margin, non-crossing, initial position, and nonzero traveling time. The first method is based on two versions of a compact mixed-integer programming formulation that can solve large problem instances using a general purpose solver. The second is a combination of some constraints of the proposed mathematical model and the binary search algorithm to reduce the CPU time, and solve more efficiently large-sized problems. Unlike existing studies, the computational study demonstrates that both methods can reach optimal solutions for large-sized instances and validates their dominance compared to an exact model proposed in the literature which finds solutions only for small problems.

    Original languageEnglish (US)
    Pages (from-to)218-233
    Number of pages16
    JournalComputers and Operations Research
    Volume99
    DOIs
    StatePublished - Nov 1 2018

    Fingerprint

    Exact Method
    Cranes
    Container
    Containers
    Scheduling Problem
    Scheduling
    Binary search
    Container Terminal
    Mixed Integer Programming
    Integer programming
    CPU Time
    Vessel
    Margin
    Productivity
    Search Algorithm
    Program processors
    Optimal Solution
    Safety
    Mathematical Model
    Mathematical models

    Keywords

    • Container terminals
    • Mixed-integer programming
    • Quay crane scheduling problem
    • Scheduling

    ASJC Scopus subject areas

    • Computer Science(all)
    • Modeling and Simulation
    • Management Science and Operations Research

    Cite this

    Exact methods for the quay crane scheduling problem when tasks are modeled at the single container level. / Msakni, Mohamed Kais; Diabat, Ali; Rabadi, Ghaith; Al-Salem, Mohamed; Kotachi, Mariam.

    In: Computers and Operations Research, Vol. 99, 01.11.2018, p. 218-233.

    Research output: Contribution to journalArticle

    Msakni, Mohamed Kais ; Diabat, Ali ; Rabadi, Ghaith ; Al-Salem, Mohamed ; Kotachi, Mariam. / Exact methods for the quay crane scheduling problem when tasks are modeled at the single container level. In: Computers and Operations Research. 2018 ; Vol. 99. pp. 218-233.
    @article{65f96f045b71458a9f28ccdf6067dfd4,
    title = "Exact methods for the quay crane scheduling problem when tasks are modeled at the single container level",
    abstract = "The scheduling of quay cranes (QCs) to minimize the handling time of a berthed vessel is one of the most important operations in container terminals as it impacts the terminal's overall productivity. In this paper, we propose two exact methods to solve the quay crane scheduling problem (QCSP) where a task is defined as handling a single container and subject to different technical constraints including QCs’ safety margin, non-crossing, initial position, and nonzero traveling time. The first method is based on two versions of a compact mixed-integer programming formulation that can solve large problem instances using a general purpose solver. The second is a combination of some constraints of the proposed mathematical model and the binary search algorithm to reduce the CPU time, and solve more efficiently large-sized problems. Unlike existing studies, the computational study demonstrates that both methods can reach optimal solutions for large-sized instances and validates their dominance compared to an exact model proposed in the literature which finds solutions only for small problems.",
    keywords = "Container terminals, Mixed-integer programming, Quay crane scheduling problem, Scheduling",
    author = "Msakni, {Mohamed Kais} and Ali Diabat and Ghaith Rabadi and Mohamed Al-Salem and Mariam Kotachi",
    year = "2018",
    month = "11",
    day = "1",
    doi = "10.1016/j.cor.2018.07.005",
    language = "English (US)",
    volume = "99",
    pages = "218--233",
    journal = "Surveys in Operations Research and Management Science",
    issn = "0305-0548",
    publisher = "Elsevier Limited",

    }

    TY - JOUR

    T1 - Exact methods for the quay crane scheduling problem when tasks are modeled at the single container level

    AU - Msakni, Mohamed Kais

    AU - Diabat, Ali

    AU - Rabadi, Ghaith

    AU - Al-Salem, Mohamed

    AU - Kotachi, Mariam

    PY - 2018/11/1

    Y1 - 2018/11/1

    N2 - The scheduling of quay cranes (QCs) to minimize the handling time of a berthed vessel is one of the most important operations in container terminals as it impacts the terminal's overall productivity. In this paper, we propose two exact methods to solve the quay crane scheduling problem (QCSP) where a task is defined as handling a single container and subject to different technical constraints including QCs’ safety margin, non-crossing, initial position, and nonzero traveling time. The first method is based on two versions of a compact mixed-integer programming formulation that can solve large problem instances using a general purpose solver. The second is a combination of some constraints of the proposed mathematical model and the binary search algorithm to reduce the CPU time, and solve more efficiently large-sized problems. Unlike existing studies, the computational study demonstrates that both methods can reach optimal solutions for large-sized instances and validates their dominance compared to an exact model proposed in the literature which finds solutions only for small problems.

    AB - The scheduling of quay cranes (QCs) to minimize the handling time of a berthed vessel is one of the most important operations in container terminals as it impacts the terminal's overall productivity. In this paper, we propose two exact methods to solve the quay crane scheduling problem (QCSP) where a task is defined as handling a single container and subject to different technical constraints including QCs’ safety margin, non-crossing, initial position, and nonzero traveling time. The first method is based on two versions of a compact mixed-integer programming formulation that can solve large problem instances using a general purpose solver. The second is a combination of some constraints of the proposed mathematical model and the binary search algorithm to reduce the CPU time, and solve more efficiently large-sized problems. Unlike existing studies, the computational study demonstrates that both methods can reach optimal solutions for large-sized instances and validates their dominance compared to an exact model proposed in the literature which finds solutions only for small problems.

    KW - Container terminals

    KW - Mixed-integer programming

    KW - Quay crane scheduling problem

    KW - Scheduling

    UR - http://www.scopus.com/inward/record.url?scp=85049786873&partnerID=8YFLogxK

    UR - http://www.scopus.com/inward/citedby.url?scp=85049786873&partnerID=8YFLogxK

    U2 - 10.1016/j.cor.2018.07.005

    DO - 10.1016/j.cor.2018.07.005

    M3 - Article

    AN - SCOPUS:85049786873

    VL - 99

    SP - 218

    EP - 233

    JO - Surveys in Operations Research and Management Science

    JF - Surveys in Operations Research and Management Science

    SN - 0305-0548

    ER -