Hardness and fixed parameter tractability for pinwheel scheduling problems
From MaRDI portal
Cites work
- A 12/7-approximation algorithm for the discrete bamboo garden trimming problem
- A pinwheel scheduler for three distinct numbers with a tight schedulability bound
- Bamboo garden trimming problem (perpetual maintenance of machines with different attendance urgency factors)
- Color-coding
- Erdős covering systems
- scientific article; zbMATH DE number 1261820 (Why is no real title available?)
- scientific article; zbMATH DE number 819814 (Why is no real title available?)
- Integer Programming with a Fixed Number of Variables
- Minimizing Service and Operation Costs of Periodic Scheduling
- Minkowski's Convex Body Theorem and Integer Programming
- On a periodic maintenance problem
- On disjoint residue classes
- On disjoint residue classes
- Perpetual maintenance of machines with different urgency requirements
- Pinwheel covering
- Pinwheel scheduling with two distinct numbers
- Pinwheel scheduling: Achievable densities
- Schedulers for larger classes of pinwheel instances
- Scheduling Periodic Tasks
- Simple strategies versus optimal schedules in multi-agent patrolling
- Small-Bias Probability Spaces: Efficient Constructions and Applications
- Solution of the minimum modulus problem for covering systems
- The subspace flatness conjecture and faster integer programming
- Towards the 5/6-density conjecture of pinwheel scheduling
- Windows scheduling as a restricted version of bin packing
- Windows Scheduling Problems for Broadcast Systems
This page was built for publication: Hardness and fixed parameter tractability for pinwheel scheduling problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7266653)
