Online scheduling on semi-related machines

DOI10.1016/J.IPL.2008.03.018zbMath1186.68075OpenAlexW2095781441MaRDI QIDQ963475

Ulrich M. Schwarz

Publication date: 19 April 2010

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2008.03.018

zbMATH Keywords

online algorithmspreemptive schedulingvariable profile

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Online algorithms; streaming algorithms (68W27)

Related Items (2)

Online interval scheduling on two related machines: the power of lookahead ⋮ A Survey on Approximation Algorithms for Scheduling with Machine Unavailability

Cites Work

• Machine scheduling with availability constraints
• Scheduling preemptable tasks on parallel processors with limited availability
• Preemptive scheduling with variable profile, precedence constraints and due dates
• A Level Algorithm for Preemptive Scheduling
• Scheduling with unexpected machine breakdowns

This page was built for publication: Online scheduling on semi-related machines