Fair online load balancing

DOI10.1007/s10951-011-0226-0zbMath1297.68040OpenAlexW2076889893MaRDI QIDQ398848

Joseph (Seffi) Naor, Niv Buchbinder

Publication date: 18 August 2014

Published in: Journal of Scheduling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10951-011-0226-0

zbMATH Keywords

fairnessschedulingcompetitive analysisonline algorithmsload balancingrestricted assignment

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Resource and cost allocation (including fair division, apportionment, etc.) (91B32) Online algorithms; streaming algorithms (68W27)

Related Items (6)

Bicriteria Online Matching: Maximizing Weight and Cardinality ⋮ Rejecting jobs to minimize load and maximum flow-time ⋮ Simultaneous approximation of multi-criteria submodular function maximization ⋮ The efficiency of fair division ⋮ Pricing for fairness: distributed resource allocation for multiple objectives ⋮ Price-based protocols for fair resource allocation

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the existence of schedules that are near-optimal for both makespan and total weighted completion time
• Simultaneous optimization via approximate majorization for concave profits or convex costs
• Fairness Measures for Resource Allocation
• The Competitiveness of On-Line Assignments
• On-line routing of virtual circuits with applications to load balancing and machine scheduling
• All-norm approximation algorithms
• Inequalities: theory of majorization and its applications
• Fairness in routing and load balancing
• Combining fairness with throughput: Online routing with multiple objectives

This page was built for publication: Fair online load balancing