Abed, Fidda ; Chen, Lin ; Disser, Yann ; Groß, Martin ; Megow, Nicole ; Meißner, Julie ; Richter, Alexander T. ; Rischke, Roman (2019)
Scheduling maintenance jobs in networks.
In: Theoretical Computer Science, 754
doi: 10.1016/j.tcs.2018.02.020
Artikel, Bibliographie
Kurzbeschreibung (Abstract)
We investigate the problem of scheduling the maintenance of edges in a network, motivated by the goal of minimizing outages in transportation or telecommunication networks. We focus on maintaining connectivity between two nodes over time; for the special case of path networks, this is related to the problem of minimizing the busy time of machines.
We show that the problem can be solved in polynomial time in arbitrary networks if preemption is allowed. If preemption is restricted to integral time points, the problem is NP-hard and in the non-preemptive case we give strong non-approximability results. Furthermore, we give tight bounds on the power of preemption, that is, the maximum ratio of the values of non-preemptive and preemptive optimal solutions.
Interestingly, the preemptive and the non-preemptive problem can be solved efficiently on paths, whereas we show that mixing both leads to a weakly NP-hard problem that allows for a simple 2-approximation.
| Typ des Eintrags: | Artikel |
|---|---|
| Erschienen: | 2019 |
| Autor(en): | Abed, Fidda ; Chen, Lin ; Disser, Yann ; Groß, Martin ; Megow, Nicole ; Meißner, Julie ; Richter, Alexander T. ; Rischke, Roman |
| Art des Eintrags: | Bibliographie |
| Titel: | Scheduling maintenance jobs in networks |
| Sprache: | Englisch |
| Publikationsjahr: | 6 Januar 2019 |
| Verlag: | Elsevier |
| Titel der Zeitschrift, Zeitung oder Schriftenreihe: | Theoretical Computer Science |
| Jahrgang/Volume einer Zeitschrift: | 754 |
| DOI: | 10.1016/j.tcs.2018.02.020 |
| URL / URN: | https://www.sciencedirect.com/science/article/abs/pii/S03043... |
| Kurzbeschreibung (Abstract): | We investigate the problem of scheduling the maintenance of edges in a network, motivated by the goal of minimizing outages in transportation or telecommunication networks. We focus on maintaining connectivity between two nodes over time; for the special case of path networks, this is related to the problem of minimizing the busy time of machines. We show that the problem can be solved in polynomial time in arbitrary networks if preemption is allowed. If preemption is restricted to integral time points, the problem is NP-hard and in the non-preemptive case we give strong non-approximability results. Furthermore, we give tight bounds on the power of preemption, that is, the maximum ratio of the values of non-preemptive and preemptive optimal solutions. Interestingly, the preemptive and the non-preemptive problem can be solved efficiently on paths, whereas we show that mixing both leads to a weakly NP-hard problem that allows for a simple 2-approximation. |
| Fachbereich(e)/-gebiet(e): | Exzellenzinitiative Exzellenzinitiative > Graduiertenschulen Exzellenzinitiative > Graduiertenschulen > Graduate School of Computational Engineering (CE) |
| Hinterlegungsdatum: | 15 Jul 2022 09:20 |
| Letzte Änderung: | 15 Jul 2022 09:20 |
| PPN: | |
| Export: | |
| Suche nach Titel in: | TUfind oder in Google |
 |
Frage zum Eintrag |
Optionen (nur für Redakteure)
 |
Redaktionelle Details anzeigen |
Drucken
Impressum