.png){kind=icon}
返回
The lockmaster's problem
.png){kind=icon}
OA
AI
DOI：10.1016/j.ejor.2015.12.007.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Inland waterways form a natural network infrastructure with capacity for more traffic. Transportation by ship is widely promoted as it is a reliable, efficient and environmental friendly way of transport. Nevertheless, locks managing the water level on waterways and within harbors sometimes constitute bottlenecks for transportation over water. The lockmaster's problem concerns the optimal strategy for operating such a lock. In the lockmaster's problem we are given a lock, a set of upstream-bound ships and another set of ships traveling in the opposite direction. We are given the arrival times of the ships and a constant lockage time; the goal is to minimize total waiting time of the ships. In this paper, a dynamic programming algorithm is proposed that solves the lockmaster's problem in polynomial time. This algorithm can also be used to solve a single batching machine scheduling problem more efficiently than the current algorithms from the literature do. We extend the algorithm such that it can be applied in realistic settings, taking into account capacity, ship-dependent handling times, weights and water usage. In addition, we compare the performance of this new exact algorithm with the performance of some (straightforward) heuristics in a computational study. (C) 2015 Elsevier B.V. All rights reserved.
Keyword:
Transportation
Lock scheduling
Batch scheduling
Dynamic programming
Complexity
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
2.2W
被引数:
7.7W
机构
引用论文
.png){kind=icon}
分享收藏分享收藏Ultrastructural and Immunohistochemical Contribution to the Histogenesis of Human Cardiac Myxoma超微结构和免疫组织化学对人心脏粘液瘤组织发生的贡献
PREAI
分享收藏
查看更多内容