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

DOI10.1016/S0020-0190(97)00149-XzbMATH Open1336.90034MaRDI QIDQ287232FDOQ287232

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

Publication date: 26 May 2016

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

Recommendations

• Optimal Online Algorithms for Minimax Resource Scheduling
• Fairness in Scheduling
• A unified approach to approximating resource allocation and scheduling
• Proportionate progress: A notion of fairness in resource allocation
• A unified approach to approximating resource allocation and scheduling

zbMATH Keywords

fairnessperiodic tasksonline scheduling

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Proportionate progress: A notion of fairness in resource allocation
• A calculus for network delay. I. Network elements in isolation
• The Chairman assignment problem
• Priority Search Trees

Cited In (7)

• 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
• Convex dynamics: Unavoidable difficulties in bounding some greedy algorithms
• Minimizing migrations in fair multiprocessor scheduling of persistent tasks
• Title not available (Why is that?)
• Fair Hitting Sequence Problem: scheduling activities with varied frequency requirements
• Guaranteeing Fair Service to Persistent Dependent Tasks

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q287232)