On-line load balancing for related machines

DOI10.1007/3-540-63307-3_52zbMath1497.68577OpenAlexW1840965997MaRDI QIDQ5096930

Piotr Berman, Marek Karpinski, Moses Charikar

Publication date: 19 August 2022

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

Full work available at URL: https://doi.org/10.1007/3-540-63307-3_52

Mathematics Subject Classification ID

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

Related Items (2)

Online algorithms for scheduling with machine activation cost on two uniform machines ⋮ A lower bound on deterministic online algorithms for scheduling on related machines without preemption

Cites Work

• Search games
• A lower bound for randomized on-line scheduling algorithms
• Yet more on the linear search problem
• On-line load balancing with applications to machine scheduling and virtual circuit routing
• Bounds for Certain Multiprocessing Anomalies
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On-line load balancing for related machines