.png){kind=icon}
返回
Housekeeping: Foresightful container repositioning
.png){kind=icon}
PRE
AI
DOI：10.1016/j.ijpe.2016.06.009.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This paper deals with crane scheduling in a block of a container terminal equipped with twin cranes when repositioning moves turn out necessary. While one crane is working on a given schedule we aim to anticipate as many repositioning jobs as possible using the second crane without disturbing the first crane. In seaport operations, this situation is commonly called housekeeping. We formulate this problem as a MIP and show that it is strongly NP-hard. Further, we provide an exact procedure based on dynamic programming and a Greedy heuristic procedure to solve it. A comparison of both algorithms with CPLEX concludes this paper. (C) 2016 Elsevier B.V. All rights reserved.
Keyword:
Container terminal
Seaport storage area
Twin cranes
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
10
论文数:
8.0K
被引数:
3.6W
机构
引用论文
.png){kind=icon}
分享收藏Storage yard operations in container terminals: Literature overview, trends, and research directions
OAAI
OAAI分享收藏分享收藏
查看更多内容