.png){kind=icon}
返回
Optimal Algorithm for the General Quay Crane Double-Cycling Problem
.png){kind=icon}
PRE
AI
DOI：10.1287/trsc.2014.0563.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Quay crane efficiency is the key bottleneck for container port productivity. An important issue of container terminal optimization is the quay crane double-cycling problem (QCDCP). For the simple scenario without hatch covers, a two-machine flow shop scheduled model can be formulated that can be solved by Johnson's rule. For the general QCDCP with hatch covers, the state-of-the-art solution approaches are only heuristics. The computational complexity of the problem, however, remains an open question. This paper focuses on the general QCDCP. We investigate the computational complexity of the problem, by showing that it can be formulated as a flow shop scheduling problem with series-parallel precedence constraints, thus allowing it to be solved polynomially. For ease of implementation, we present an optimal algorithm for the general QCDCP, which is a special and simplified version of Sidney's algorithm.
Keyword:
container ports
quay cranes
double cycling
scheduling
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
4.8
论文数:
1.9K
被引数:
8.4K
机构
引用论文
分享收藏Maximizing the number of dual-cycle operations of quay cranes in container terminals最大化集装箱码头起重机的双循环操作次数
PREAI
分享收藏An Exact Algorithm for the Integrated Planning of Berth Allocation and Quay Crane Assignment泊位分配和码头起重机分配综合规划的精确算法
PREAI
分享收藏Automated application-level checkpointing of MPI programs.png)
Proceedings of the ninth ACM SIGPLAN symposium on Principles and practice of parallel programming
OAAI
Proceedings of the ninth ACM SIGPLAN symposium on Principles and practice of parallel programmingIF0
OAAI分享收藏分享收藏
查看更多内容