.png){kind=icon}
Return
Network construction problems with due dates
.png){kind=icon}
PRE
AI
DOI：10.1016/j.ejor.2015.02.014.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
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.
Keywords:
Scheduling
Network design
Network construction
Emergency restoration
Integrated network design and scheduling
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
6
Papers:
2.2W
Citations:
6.4W
Organization
Cited Papers
.png){kind=icon}
ShareSaveTheoretical Analysis on the Mismatch Influence of Displaced Phase Center Multiple-beam SAR Systems
PREAI
ShareSaveShareSaveShareSave
ShareSaveShareSaveShareSave
View more