Periodic scheduling with obligatory vacations

DOI10.1016/j.tcs.2009.08.008zbMath1194.68090OpenAlexW2123902359MaRDI QIDQ1034630

Tami Tamir, Hadas Shachnai, Jiří Sgall

Publication date: 6 November 2009

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2009.08.008

zbMATH Keywords

approximation algorithmsvacationsperiodic scheduling

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Approximation algorithms (68W25)

Related Items (1)

Simple strategies versus optimal schedules in multi-agent patrolling

Cites Work

• The Chairman assignment problem
• A characterization of the minimum cycle mean in a digraph
• Pinwheel scheduling: Achievable densities
• Proportionate progress: A notion of fairness in resource allocation
• Integer Programming with a Fixed Number of Variables
• Windows scheduling as a restricted version of bin packing
• Windows Scheduling Problems for Broadcast Systems
• Periodic Scheduling with Service Constraints
• Optimal reward-based scheduling for periodic real-time tasks
• Pfair scheduling of generalized pinwheel task systems
• Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
• Minimizing Service and Operation Costs of Periodic Scheduling
• Experimental and Efficient Algorithms

This page was built for publication: Periodic scheduling with obligatory vacations