.png){kind=icon}
返回
A multiple-crane-constrained scheduling problem in a container terminal
.png){kind=icon}
PRE
AI
DOI：10.1016/S0377-2217(01)00382-4.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
We consider a container terminal loading and unloading containers to and from a set of ships, and storing the containers in the terminal yard. Each ship is served by multiple quay cranes, which load and unload containers to and from ships. Containers are moved between the ships and the yard using a fleet of vehicles, each with unit capacity. The problem is (i) to determine a storage location for each unloaded container, (ii) to dispatch vehicles to containers, and (iii) to schedule the loading and unloading operations on the cranes, so as to minimize the maximum time it takes to serve a given set of ships. This problem is NP-hard, and therefore we develop a heuristic algorithm based on formulating the problem as a transshipment problem. The effectiveness of the heuristic is analyzed from both worst-case and computational points of view. (C) 2002 Elsevier Science B.V. All rights reserved.
Keyword:
logistics
transportation
modeling
assignment
heuristics
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
2.2W
被引数:
6.4W
机构
暂无机构信息
引用论文
.png){kind=icon}
分享收藏分享收藏 没有更多内容
没有更多内容