Minimizing Busy Time in Multiple Machine Real-time Scheduling
From MaRDI portal
Publication:2908847
DOI10.4230/LIPIcs.FSTTCS.2010.169zbMath1245.68038OpenAlexW2122882715MaRDI QIDQ2908847
Rohit Khandekar, Baruch Schieber, Hadas Shachnai, Tami Tamir
Publication date: 29 August 2012
Full work available at URL: http://subs.emis.de/LIPIcs/frontdoor_c679.html
Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Approximation algorithms (68W25)
Related Items (12)
Online Optimization of Busy Time on Parallel Machines ⋮ Minimum hitting set of interval bundles problem: computational complexity and approximability ⋮ 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 busy time on parallel machines ⋮ Online optimization of busy time on parallel machines ⋮ Active and Busy Time Scheduling Problem: A Survey ⋮ A model for minimizing active processor time ⋮ Race to idle or not: balancing the memory sleep time with DVS for energy minimization ⋮ On the complexity of the regenerator cost problem in general networks with traffic grooming ⋮ Complexity and online algorithms for minimum skyline coloring of intervals
This page was built for publication: Minimizing Busy Time in Multiple Machine Real-time Scheduling
