Scheduling maintenance jobs in networks
DOI10.1016/j.tcs.2018.02.020zbMath1407.68539arXiv1701.08809OpenAlexW4205228050WikidataQ57399712 ScholiaQ57399712MaRDI QIDQ1628599
Martin Groß, Alexander T. Richter, Yann Disser, Roman Rischke, Nicole Megow, Fidaa Abed, Lin Chen, Julie Meißner
Publication date: 4 December 2018
Published in: Theoretical Computer Science, Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1701.08809
Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35) Reliability, availability, maintenance, inspection in operations research (90B25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)
Cites Work
- Scheduling arc shut downs in a network to maximize flow over time with a bounded number of jobs per time period
- Scheduling network maintenance jobs with release dates and deadlines to maximize total flow over time: bounds and solution strategies
- Scheduling arc maintenance jobs in a network to maximize total flow over time
- Optimizing busy time on parallel machines
- Minimizing total busy time in parallel scheduling with application to optical networks
- Incremental network design with maximum flows
- Real-time scheduling to minimize machine busy times
- LP rounding and combinatorial algorithms for minimizing active and busy time
- Restoring infrastructure systems: an integrated network design and scheduling (INDS) problem
- Power of Preemption on Uniform Parallel Machines
- Energy-Efficient Algorithms for Non-preemptive Speed-Scaling
- Bounding the Power of Preemption in Randomized Scheduling
- Scheduling Unrelated Machines by Randomized Rounding
- The Power of Preemption on Unrelated Machines and Applications to Scheduling Orders
This page was built for publication: Scheduling maintenance jobs in networks
