Perpetual maintenance of machines with different urgency requirements

Cites Work

Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
New inapproximability bounds for TSP
The minimum backlog problem
Optimum watchman routes
Pinwheel scheduling with two distinct numbers
Scheduling maintenance services to three machines
The scheduling of maintenance service
A pinwheel scheduler for three distinct numbers with a tight schedulability bound
When patrolmen become corrupted: monitoring a graph using faulty mobile robots
Pinwheel scheduling: Achievable densities
Proportionate progress: A notion of fairness in resource allocation
Bamboo garden trimming problem: priority schedulings
A 12/7-approximation algorithm for the discrete bamboo garden trimming problem
Cutting bamboo down to size
Fence patrolling by mobile agents with distinct speeds
An algorithm reminiscent of Euclidean-gcd for computing a function related to pinwheel scheduling
Schedulers for larger classes of pinwheel instances
Cinderella versus the Wicked Stepmother
Bamboo Garden Trimming Problem (Perpetual Maintenance of Machines with Different Attendance Urgency Factors)
Boundary Patrolling by Mobile Agents with Distinct Maximal Speeds
A Mathematical Model for Periodic Scheduling Problems
Pfair scheduling of generalized pinwheel task systems
Two Robots Patrolling on a Line: Integer Version and Approximability
Patrolling a Path Connecting a Set of Points with Unbalanced Frequencies of Visits
Achieving Optimal Backlog in the Vanilla Multi-Processor Cup Game
Achieving optimal backlog in multi-processor cup games
Approximation algorithms for replenishment problems with fixed turnover times
How asymmetry helps buffer management: achieving optimal tail size in cup games
Complexity of inventory routing problems when routing is easy

This page was built for publication: Perpetual maintenance of machines with different urgency requirements