Show simple item record

AuthorMsakni M.K.
AuthorDiabat A.
AuthorRabadi G.
AuthorAl-Salem M.
AuthorKotachi M.
Available date2020-02-24T08:57:12Z
Publication Date2018
Publication NameComputers and Operations Research
ResourceScopus
ISSN3050548
URIhttp://dx.doi.org/10.1016/j.cor.2018.07.005
URIhttp://hdl.handle.net/10576/12989
AbstractThe 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.
SponsorThis research was made possible by NPRP grant no. NPRP 7-796-2-297 from the Qatar National Research Fund (a member of The Qatar Foundation). The statements made herein are solely the responsibility of the authors. Appendix A
Languageen
PublisherElsevier Ltd
SubjectContainer terminals
Mixed-integer programming
Quay crane scheduling problem
Scheduling
TitleExact methods for the quay crane scheduling problem when tasks are modeled at the single container level
TypeArticle
Pagination218 - 233
Volume Number99


Files in this item

FilesSizeFormatView

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record