Minimizing busy time in multiple machine real-time scheduling

DOI10.4230/LIPICS.FSTTCS.2010.169MaRDI QIDQ2908847zbMATH OpenOpenAlexFDO

Authors 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

zbMATH Keywords

approximation algorithmbusy timepreemptionreal-time scheduling

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Approximation algorithms (68W25) Deterministic scheduling theory in operations research (90B35)

Recommendations

• Real-time scheduling to minimize machine busy times
• Busy time scheduling on a bounded number of machines (extended abstract)
• Optimizing busy time on parallel machines
• Online optimization of busy time on parallel machines
• Online optimization of busy time on parallel machines. (Extended abstract)

Cited in

(16)

• LP rounding and combinatorial algorithms for minimizing active and busy time
• Race to idle or not: balancing the memory sleep time with DVS for energy minimization
• Minimum hitting set of interval bundles problem: computational complexity and approximability
• Busy time scheduling on a bounded number of machines (extended abstract)
• Online optimization of busy time on parallel machines. (Extended abstract)
• Scheduling tasks to minimize active time on a processor with unlimited capacity
• Active and busy time scheduling problem: a survey
• Optimizing busy time on parallel machines
• Online optimization of busy time on parallel machines
• On the complexity of the regenerator cost problem in general networks with traffic grooming
• Exploring a resolution method based on an evolutionary game-theoretical model for minimizing the machines with limited workload capacity and interval constraints
• Complexity and online algorithms for minimum skyline coloring of intervals
• Minimizing total busy time in parallel scheduling with application to optical networks
• Online flexible busy time scheduling on heterogeneous machines
• Integer linear programming formulations and heuristic solution approaches for busy time minimization in temporal bin packing
• Real-time scheduling to minimize machine busy times

This page was built for publication: Minimizing busy time in multiple machine real-time scheduling

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2908847)