Online scheduling on three uniform machines

DOI10.1016/J.DAM.2011.10.001zbMath1233.68234OpenAlexW2087172486MaRDI QIDQ765372

Sheng-Yi Cai, Qi-Fan Yang

Publication date: 19 March 2012

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2011.10.001

zbMATH Keywords

schedulinganalysis of algorithmscompetitive ratiouniform machine

Mathematics Subject Classification ID

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

Related Items (2)

Lower bounds for online makespan minimization on a small number of related machines ⋮ A lower bound on deterministic online algorithms for scheduling on related machines without preemption

Cites Work

• A new algorithm for online uniform-machine scheduling to minimize the makespan
• An On-Line Algorithm for Some Uniform Processor Scheduling
• Bounds on Multiprocessing Timing Anomalies
• Randomized on-line scheduling on two uniform machines
• Unnamed Item

This page was built for publication: Online scheduling on three uniform machines