期刊
COMPUTERS & OPERATIONS RESEARCH
卷 99, 期 -, 页码 218-233出版社
PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.cor.2018.07.005
关键词
Scheduling; Container terminals; Quay crane scheduling problem; Mixed-integer programming
类别
资金
- NPRP from the Qatar National Research Fund (a member of The Qatar Foundation) [NPRP 7-796-2-297]
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. (C) 2018 Elsevier Ltd. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据