Minimizing total busy time in parallel scheduling with application to optical networks
DOI10.1016/J.TCS.2010.05.011zbMATH Open1207.68110OpenAlexW2089278681MaRDI QIDQ708204FDOQ708204
Authors: Michele Flammini, Gianpiero Monaco, Luca Moscardelli, Hadas Shachnai, Mordechai Shalom, Tami Tamir, Shmuel Zaks 
Publication date: 11 October 2010
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2010.05.011
Recommendations
- Optimizing busy time on parallel machines
- Online optimization of busy time on parallel machines
- Online optimization of busy time on parallel machines. (Extended abstract)
- Minimizing busy time in multiple machine real-time scheduling
- Busy time scheduling on a bounded number of machines (extended abstract)
Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Approximation algorithms (68W25)
Cites Work
- The regenerator location problem
- Title not available (Why is that?)
- Title not available (Why is that?)
- Scheduling algorithms
- Fixed interval scheduling: models, applications, computational complexity and algorithms
- Clique partitioning of interval graphs with submodular costs on the cliques
- Approximating the traffic grooming problem in tree and star networks
- Algorithms and Computation
- Title not available (Why is that?)
- Optimizing regenerator cost in traffic grooming
- Algorithmic aspects of bandwidth trading
- Real-time scheduling to minimize machine busy times
Cited In (18)
- Optimizing regenerator cost in traffic grooming
- Real-time scheduling to minimize machine busy times
- On the complexity of approximation and online scheduling problems with applications to optical networks
- Algorithms and Computation
- Multithread interval scheduling with flexible machine availabilities: complexity and efficient algorithms
- Scheduling tasks to minimize active time on a processor with unlimited capacity
- On the complexity of the regenerator location problem treewidth and other parameters
- Complexity and online algorithms for minimum skyline coloring of intervals
- Cost-sharing games in real-time scheduling systems
- Optimizing busy time on parallel machines
- Online optimization of busy time on parallel machines
- The \(k\)-track assignment problem
- Cost-sharing games in real-time scheduling systems
- Worst-case analysis of heuristic approaches for the temporal bin packing problem with fire-ups
- LP rounding and combinatorial algorithms for minimizing active and busy time
- Online optimization of busy time on parallel machines. (Extended abstract)
- Active and busy time scheduling problem: a survey
- On the complexity of the regenerator cost problem in general networks with traffic grooming
This page was built for publication: Minimizing total busy time in parallel scheduling with application to optical networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q708204)
