Fair on-line scheduling of a dynamic set of tasks on a single resource

DOI10.1016/S0020-0190(97)00149-XzbMath1336.90034MaRDI QIDQ287232

C. Greg Plaxton, Kevin Jeffay, Sanjoy K. Baruah, Johannes E. Gehrk, Ion Lucretiu Stoica, Hussein M. Abdel-Wahab

Publication date: 26 May 2016

Published in: Information Processing Letters (Search for Journal in Brave)

zbMATH Keywords

fairnessonline schedulingperiodic tasks

Mathematics Subject Classification ID

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

Related Items (4)

Minimizing migrations in fair multiprocessor scheduling of persistent tasks ⋮ Convex dynamics: Unavoidable difficulties in bounding some greedy algorithms ⋮ Smooth scheduling under variable rates or the analog-digital confinement game ⋮ Solving multiple processor and multiple resource constrained scheduling problems using a genetic algorithm approach

Cites Work

• Unnamed Item
• The Chairman assignment problem
• Proportionate progress: A notion of fairness in resource allocation
• A calculus for network delay. I. Network elements in isolation
• Priority Search Trees

This page was built for publication: Fair on-line scheduling of a dynamic set of tasks on a single resource