Smooth scheduling under variable rates or the analog-digital confinement game

DOI10.1007/s00224-008-9134-xzbMath1176.90261OpenAlexW1998014198MaRDI QIDQ733734

Ami Litman, Shiri Moran-Schein

Publication date: 19 October 2009

Published in: Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00224-008-9134-x

zbMATH Keywords

online schedulingconcurrent gamesconfinement gamesEDF schemesEDF strategiesnon/concurrent gamessmooth schedulingtwo players gamesvariable rates

Mathematics Subject Classification ID

2-person games (91A05) Queues and service in operations research (90B22) Stochastic scheduling theory in operations research (90B36) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (2)

On centralized smooth scheduling ⋮ The matroid cup game

Cites Work

• Fair on-line scheduling of a dynamic set of tasks on a single resource
• On smooth sets of integers
• The Chairman assignment problem
• Proportionate progress: A notion of fairness in resource allocation
• Size direction games over the real line. II
• General Dynamic Routing with Per-Packet Delay Guarantees of O(Distance + 1/Session Rate)
• Nearly optimal perfectly-periodic schedules

This page was built for publication: Smooth scheduling under variable rates or the analog-digital confinement game