Scheduling Maintenance Jobs in Networks

Preprint English OPEN
Abed, Fidaa; Chen, Lin; Disser, Yann; Groß, Martin; Megow, Nicole; Meißner, Julie; Richter, Alexander T.; Rischke, Roman;
  • Subject: 68 | Computer Science - Data Structures and Algorithms | F.2.2
    arxiv: Computer Science::Data Structures and Algorithms | Computer Science::Operating Systems

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 ne... View more
  • References (6)

    1. Bley, A., Karch, D., D'Andreagiovanni, F.: WDM fiber replacement scheduling. Electronic Notes in Discrete Mathematics 41, 189-196 (2013),

    2. Boland, N., Kalinowski, T., Kaur, S.: Scheduling arc shut downs in a network to maximize flow over time with a bounded number of jobs per time period. Journal of Combinatorial Optimization pp. 1-21 (2015),

    3. Boland, N., Kalinowski, T., Kaur, S.: Scheduling network maintenance jobs with release dates and deadlines to maximize total flow over time: Bounds and solution strategies. Computers & Operations Research 64, 113-129 (2015),

    4. Boland, N., Kalinowski, T., Waterer, H., Zheng, L.: Scheduling arc maintenance jobs in a network to maximize total flow over time. Discrete Applied Mathematics 163, 34-52 (2014),

    5. Boland, N.L., Savelsbergh, M.W.P.: Optimizing the hunter valley coal chain. In: Gurnani, H., Mehrotra, A., Ray, S. (eds.) Supply Chain Disruptions: Theory and Practice of Managing Risk. pp. 275-302. Springer, London (2012),

    6. Canetti, R., Irani, S.: Bounding the power of preemption in randomized scheduling. SIAM Journal on Computing 27(4), 993-1015 (1998),

  • Related Organizations (11)
  • Metrics
Share - Bookmark