Online scheduling with reassignment on two uniform machines

DOI10.1016/j.tcs.2010.04.020zbMath1192.68922OpenAlexW1999969253MaRDI QIDQ982662

Qian Cao, Zhaohui Liu

Publication date: 7 July 2010

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2010.04.020

zbMATH Keywords

online schedulingreassignmentuniform machine

Mathematics Subject Classification ID

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

Related Items (6)

A survey on makespan minimization in semi-online environments ⋮ Semi-online scheduling: a survey ⋮ Online scheduling with rearrangement on two related machines ⋮ Optimal semi-online algorithms for scheduling problems with reassignment on two identical machines ⋮ General parametric scheme for the online uniform machine scheduling problem with two different speeds ⋮ Online scheduling with rejection and withdrawal

Cites Work

• Online scheduling with reassignment
• Online scheduling on two uniform machines to minimize the makespan
• Bounds for List Schedules on Uniform Processors
• Randomized on-line scheduling on two uniform machines

This page was built for publication: Online scheduling with reassignment on two uniform machines