Recommendations
Cites work
- A lower bound for randomized on-line scheduling algorithms
- Bounds for Certain Multiprocessing Anomalies
- scientific article; zbMATH DE number 437567 (Why is no real title available?)
- scientific article; zbMATH DE number 1256657 (Why is no real title available?)
- scientific article; zbMATH DE number 1559597 (Why is no real title available?)
- scientific article; zbMATH DE number 742966 (Why is no real title available?)
- scientific article; zbMATH DE number 2102785 (Why is no real title available?)
- scientific article; zbMATH DE number 871910 (Why is no real title available?)
- On-line load balancing with applications to machine scheduling and virtual circuit routing
- Search games
- Yet more on the linear search problem
Cited in
(6)- Resource augmentation in load balancing.
- A lower bound on deterministic online algorithms for scheduling on related machines without preemption
- On-Line Load Balancing of Temporary Tasks on Identical Machines
- On-Line Load Balancing for Related Machines
- Online load balancing on related machines
- Online algorithms for scheduling with machine activation cost on two uniform machines
This page was built for publication: On-line load balancing for related machines
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5096930)