.png){kind=icon}
返回
Network construction problems with due dates
.png){kind=icon}
PRE
AI
DOI：10.1016/j.ejor.2015.02.014.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
A network needs to be constructed by a server (construction crew) that has a constant construction speed which is incomparably slower than the server's travel speed within the already constructed part of the network. A vertex is recovered when it becomes connected to the depot by an already constructed path. Due dates for recovery times are associated with vertices. The problem is to obtain a construction schedule that minimizes the maximum lateness of vertices, or the number of tardy vertices. We introduce these new problems, discuss their computational complexity, and present mixed-integer linear programming formulations, heuristics, a branch-and-bound algorithm, and results of computational experiments. (C) 2015 Elsevier B.V. All rights reserved.
Keyword:
Scheduling
Network design
Network construction
Emergency restoration
Integrated network design and scheduling
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
2.2W
被引数:
6.4W
机构
引用论文
Theoretical Analysis on the Mismatch Influence of Displaced Phase Center Multiple-beam SAR Systems
PREAI
分享收藏
Effect of gum arabic administration on some physiological and biochemical parameters in chronic renal failure patients阿拉伯胶给药对慢性肾功能衰竭患者某些生理和生化参数的影响.png)
IF0
PREAI
分享收藏Restoring infrastructure systems: An integrated network design and scheduling (INDS) problem恢复基础设施系统: 集成网络设计和调度 (INDS) 问题
PREAI
分享收藏
查看更多内容