Online scheduling on semi-related machines

DOI10.1016/J.IPL.2008.03.018MaRDI QIDQ963475zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• scientific article; zbMATH DE number 1932350
• Optimal and online preemptive scheduling on uniformly related machines
• A survey on makespan minimization in semi-online environments
• STACS 2004
• Online and semi-online scheduling to minimize makespan on single machine with an availability constraint

Cites work

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

Cited in

(4)

• Online interval scheduling on two related machines: the power of lookahead
• A Survey on Approximation Algorithms for Scheduling with Machine Unavailability
• scientific article; zbMATH DE number 5951614 (Why is no real title available?)
• scientific article; zbMATH DE number 1930822 (Why is no real title available?)

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

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