• English
    • العربية
  • العربية
  • Login
  • QU
  • QU Library
  •  Home
  • Communities & Collections
  • Help
    • Item Submission
    • Publisher policies
    • User guides
    • FAQs
  • About QSpace
    • Vision & Mission
View Item 
  •   Qatar University Digital Hub
  • Qatar University Institutional Repository
  • Academic
  • Faculty Contributions
  • College of Engineering
  • Mechanical & Industrial Engineering
  • View Item
  • Qatar University Digital Hub
  • Qatar University Institutional Repository
  • Academic
  • Faculty Contributions
  • College of Engineering
  • Mechanical & Industrial Engineering
  • View Item
  •      
  •  
    JavaScript is disabled for your browser. Some features of this site may not work without it.

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

    Thumbnail
    View/Open
    Publisher version (You have accessOpen AccessIcon)
    Publisher version (Check access options)
    Check access options
    Date
    2018
    Author
    Msakni M.K.
    Diabat A.
    Rabadi G.
    Al-Salem M.
    Kotachi M.
    Metadata
    Show full item record
    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.
    DOI/handle
    http://dx.doi.org/10.1016/j.cor.2018.07.005
    http://hdl.handle.net/10576/12989
    Collections
    • Mechanical & Industrial Engineering [‎1483‎ items ]

    entitlement


    Qatar University Digital Hub is a digital collection operated and maintained by the Qatar University Library and supported by the ITS department

    Contact Us | Send Feedback
    Contact Us | Send Feedback | QU

     

     

    Home

    Submit your QU affiliated work

    Browse

    All of Digital Hub
      Communities & Collections Publication Date Author Title Subject Type Language Publisher
    This Collection
      Publication Date Author Title Subject Type Language Publisher

    My Account

    Login

    Statistics

    View Usage Statistics

    About QSpace

    Vision & Mission

    Help

    Item Submission Publisher policiesUser guides FAQs

    Qatar University Digital Hub is a digital collection operated and maintained by the Qatar University Library and supported by the ITS department

    Contact Us | Send Feedback
    Contact Us | Send Feedback | QU

     

     

    Video