Pinwheel scheduling: Achievable densities

DOI10.1007/s00453-002-0938-9zbMath1016.68007OpenAlexW1980002155MaRDI QIDQ1849761

Jeffrey C. Lagarias, Peter C. Fishburn

Publication date: 1 December 2002

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-002-0938-9

zbMATH Keywords

schedulingpackingpinwheeldensity guarantee

Mathematics Subject Classification ID

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

Related Items (8)

Two Robots Patrolling on a Line: Integer Version and Approximability ⋮ Optimal scheduling and control for constrained multi‐agent networked control systems ⋮ Perpetual maintenance of machines with different urgency requirements ⋮ Bamboo Garden Trimming Problem (Perpetual Maintenance of Machines with Different Attendance Urgency Factors) ⋮ Bamboo garden trimming problem: priority schedulings ⋮ Approximation algorithms for replenishment problems with fixed turnover times ⋮ A 12/7-approximation algorithm for the discrete bamboo garden trimming problem ⋮ Periodic scheduling with obligatory vacations

This page was built for publication: Pinwheel scheduling: Achievable densities