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
N1 - Funding Information:
This 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.
Publisher Copyright:
© 2018 Elsevier Ltd
PY - 2018/11
Y1 - 2018/11
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
SN - 0305-0548
VL - 99
SP - 218
EP - 233
JO - Computers and Operations Research
JF - Computers and Operations Research
ER -