Optimizing busy time on parallel machines

DOI10.1016/j.tcs.2014.10.033zbMath1303.90050OpenAlexW2032570272MaRDI QIDQ476900

George B. Mertzios, Ariella Voloshin, Shmuel Zaks, Prudence W. H. Wong, Mordechai Shalom

Publication date: 2 December 2014

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2014.10.033

zbMATH Keywords

resource allocationapproximation algorithmsinterval schedulingbusy time

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)

Related Items

Scheduling maintenance jobs in networks ⋮ Online Optimization of Busy Time on Parallel Machines ⋮ Real-time scheduling to minimize machine busy times ⋮ LP rounding and combinatorial algorithms for minimizing active and busy time ⋮ Active and Busy Time Scheduling Problem: A Survey ⋮ Complexity and online algorithms for minimum skyline coloring of intervals

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Minimizing total busy time in parallel scheduling with application to optical networks
• Fixed interval scheduling: models, applications, computational complexity and algorithms
• Minimizing Busy Time in Multiple Machine Real-time Scheduling
• Sleep Management on Multiple Machines for Energy and Flow Time
• The regenerator location problem
• Interval scheduling: A survey
• A unified approach to approximating resource allocation and scheduling