Minimizing total busy time in parallel scheduling with application to optical networks

DOI10.1016/J.TCS.2010.05.011zbMath1207.68110OpenAlexW2089278681MaRDI QIDQ708204

Michele Flammini, Luca Moscardelli, Hadas Shachnai, Gianpiero Monaco, 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

zbMATH Keywords

schedulingoptical networksapproximation algorithms

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Approximation algorithms (68W25)

Related Items (15)

Scheduling maintenance jobs in networks ⋮ Online Optimization of Busy Time on Parallel Machines ⋮ On the complexity of the regenerator location problem treewidth and other parameters ⋮ Real-time scheduling to minimize machine busy times ⋮ LP rounding and combinatorial algorithms for minimizing active and busy time ⋮ Scheduling Tasks to Minimize Active Time on a Processor with Unlimited Capacity ⋮ Optimizing regenerator cost in traffic grooming ⋮ Optimizing busy time on parallel machines ⋮ Online optimization of busy time on parallel machines ⋮ Active and Busy Time Scheduling Problem: A Survey ⋮ On the complexity of the regenerator cost problem in general networks with traffic grooming ⋮ Complexity and online algorithms for minimum skyline coloring of intervals ⋮ Cost-sharing games in real-time scheduling systems ⋮ Cost-sharing games in real-time scheduling systems ⋮ On the Complexity of Approximation and Online Scheduling Problems with Applications to Optical Networks

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Approximating the traffic grooming problem in tree and star networks
• Optimizing regenerator cost in traffic grooming
• Fixed interval scheduling: models, applications, computational complexity and algorithms
• Real-time scheduling to minimize machine busy times
• Algorithmic aspects of bandwidth trading
• Clique partitioning of interval graphs with submodular costs on the cliques
• The regenerator location problem
• Algorithms and Computation

This page was built for publication: Minimizing total busy time in parallel scheduling with application to optical networks