Improved bounds for on-line load balancing

DOI10.1007/PL00009263zbMath0916.68013OpenAlexW2016757663MaRDI QIDQ1283679

K. Appert

Publication date: 30 March 1999

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/pl00009263

zbMATH Keywords

load balancing problem

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (7)

A survey on makespan minimization in semi-online environments ⋮ The Power of Deferral: Maintaining a Constant-Competitive Steiner Tree Online ⋮ Robust Polynomial-Time Approximation Schemes for Parallel Machine Scheduling with Job Arrivals and Departures ⋮ Online load balancing with general reassignment cost ⋮ Online load balancing on uniform machines with limited migration ⋮ Robust algorithms for total completion time ⋮ On-line load balancing of temporary tasks revisited

This page was built for publication: Improved bounds for on-line load balancing