Online optimization of busy time on parallel machines

DOI10.1016/j.tcs.2014.07.017zbMath1304.90102OpenAlexW2176549387MaRDI QIDQ477193

Ariella Voloshin, Fencol C. C. Yung, Mordechai Shalom, Prudence W. H. Wong, Shmuel Zaks

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.07.017

zbMATH Keywords

competitive analysisonline algorithmsparallel machines schedulingbusy time minimization

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Online algorithms; streaming algorithms (68W27)

Related Items

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
• Unnamed Item
• Interval scheduling on related machines
• 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