Abed, F. ; Chen, L. ; Disser, Y. ; Groß, M. ; Megow, N. ; Meißner, J. ; Richter, A. ; Rischke, R. (2017)
Scheduling Maintenance Jobs in Networks.
10th International Conference on Algorithms and Complexity. Athens, Greece (24.05.2017-26.05.2017)
doi: 10.1007/978-3-319-57586-5_3
Konferenzveröffentlichung, 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: | Konferenzveröffentlichung |
|---|---|
| Erschienen: | 2017 |
| Autor(en): | Abed, F. ; Chen, L. ; Disser, Y. ; Groß, M. ; Megow, N. ; Meißner, J. ; Richter, A. ; Rischke, R. |
| Art des Eintrags: | Bibliographie |
| Titel: | Scheduling Maintenance Jobs in Networks |
| Sprache: | Englisch |
| Publikationsjahr: | 12 April 2017 |
| Verlag: | Springer |
| Buchtitel: | CIAC 2017: Algorithms and Complexity |
| Reihe: | Lecture Notes in Computer Science |
| Band einer Reihe: | 10236 |
| Veranstaltungstitel: | 10th International Conference on Algorithms and Complexity |
| Veranstaltungsort: | Athens, Greece |
| Veranstaltungsdatum: | 24.05.2017-26.05.2017 |
| DOI: | 10.1007/978-3-319-57586-5_3 |
| Zugehörige Links: | |
| 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) 04 Fachbereich Mathematik 04 Fachbereich Mathematik > Optimierung 04 Fachbereich Mathematik > Optimierung > Discrete Optimization |
| Hinterlegungsdatum: | 07 Mär 2017 07:04 |
| Letzte Änderung: | 18 Aug 2022 11:58 |
| PPN: | |
| Export: | |
| Suche nach Titel in: | TUfind oder in Google |
 |
Frage zum Eintrag |
Optionen (nur für Redakteure)
 |
Redaktionelle Details anzeigen |
Drucken
Impressum