.png){kind=icon}
返回
A Benders decomposition-based framework for solving quay crane scheduling problems
.png){kind=icon}
OA
AI
DOI：10.1016/j.ejor.2018.08.009.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this paper, we study the Quay Crane Scheduling Problem (QCSP) in container terminals. We describe a new mathematical formulation for the QCSP and by addressing the structure of workload assignments we develop an easier way to handle non-crossing constraints. The proposed mathematical formulation is used in an exact solution framework based on logic-based Benders decomposition. The proposed approach decomposes the problem into a workload-assignment master problem and operation-sequence slave subproblems. Logic-based cuts are proposed to ensure the convergence of the approach. Computational results show the effectiveness of the proposed solution approach. (C) 2018 Published by Elsevier B.V.
Keyword:
OR In Maritime Industry
Container Terminal
Quay Crane Scheduling
Logic-Based Benders Decomposition
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
2.2W
被引数:
6.4W
机构
引用论文
分享收藏Automated application-level checkpointing of MPI programs.png)
Proceedings of the ninth ACM SIGPLAN symposium on Principles and practice of parallel programmingOAAI
Proceedings of the ninth ACM SIGPLAN symposium on Principles and practice of parallel programmingIF0
OAAI分享收藏
查看更多内容