Online Optimization of Busy Time on Parallel Machines

DOI10.1007/978-3-642-29952-0_43zbMath1354.90053OpenAlexW2172125312MaRDI QIDQ2898056

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

Publication date: 16 July 2012

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-29952-0_43

zbMATH Keywords

resource allocationonline algorithmsthroughput maximizationcost minimizationinterval schedulingbusy time

Mathematics Subject Classification ID

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

Related Items (4)

On the complexity of the regenerator location problem treewidth and other parameters ⋮ LP rounding and combinatorial algorithms for minimizing active and busy time ⋮ Scheduling Tasks to Minimize Active Time on a Processor with Unlimited Capacity ⋮ Regenerator location problem: polyhedral study and effective branch-and-cut algorithms

Cites Work

• Optimizing busy time on parallel machines
• 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
• The regenerator location problem
• Interval scheduling: A survey
• A unified approach to approximating resource allocation and scheduling
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Online Optimization of Busy Time on Parallel Machines