The efficiency-fairness balance of round robin scheduling

DOI10.1016/j.orl.2021.11.008OpenAlexW3213689664MaRDI QIDQ2670464

Shai Vardi, Benjamin Moseley

Publication date: 11 March 2022

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.orl.2021.11.008

zbMATH Keywords

schedulingcompletion timepotential functionlk-norms

Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX)

Related Items (1)

A Lagrangian heuristics for balancing the average weighted completion times of two classes of jobs in a single-machine scheduling problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Equitable aggregations and multiple criteria analysis
• Stochastic online scheduling on unrelated machines
• Greedy multiprocessor server scheduling
• Approximation Techniques for Average Completion Time Scheduling
• A PTAS for Minimizing the Total Weighted Completion Time on Identical Parallel Machines
• Individual Equilibrium and Learning in Processor Sharing Systems
• Online Primal-Dual for Non-linear Optimization with Applications to Speed Scaling
• Fluid Limits for Processor-Sharing Queues with Impatience
• Law of Large Number Limits of Limited Processor-Sharing Queues
• Multi-processor scheduling to minimize flow time with ε resource augmentation
• Direct Solutions of M/G/1 Processor-Sharing Models
• Scheduling to Minimize Average Completion Time: Off-Line and On-Line Approximation Algorithms
• The Complexity of Scheduling for p-Norms of Flow and Stretch
• On the Performance of Smith’s Rule in Single-Machine Scheduling with Nonlinear Cost
• An Analysis of the M/G/1 Queue Under Round-Robin Scheduling
• Fair Queuing and Other Probabilistic Allocation Methods
• Online Scheduling of a Single Machine to Minimize Total Weighted Completion Time
• LATIN 2004: Theoretical Informatics

This page was built for publication: The efficiency-fairness balance of round robin scheduling