Perpetual scheduling with explorable uncertainty
From MaRDI portal
Cites work
- A 10/7-approximation for discrete bamboo garden trimming and continuous trimming on star graphs
- A 12/7-approximation algorithm for the discrete bamboo garden trimming problem
- Achieving optimal backlog in multi-processor cup games
- An adversarial model for scheduling with testing
- Approximation algorithms for NP-hard problems.
- Bamboo garden trimming problem (perpetual maintenance of machines with different attendance urgency factors)
- Boundary Patrolling by Mobile Agents with Distinct Maximal Speeds
- Competitive query strategies for minimising the ply of the potential locations of moving points
- Computing minimum spanning trees with uncertainty
- Computing the median with uncertainty
- Cutting bamboo down to size
- Efficient update strategies for geometric computing with uncertainty
- Explorable uncertainty in scheduling with non-uniform testing times
- Fence patrolling by mobile agents with distinct speeds
- Improved approximation algorithms for non-preemptive multiprocessor scheduling with testing
- Minimizing the size of the uncertainty regions for centers of moving entities
- Online makespan minimization with budgeted uncertainty
- Perpetual maintenance of machines with different urgency requirements
- Pinwheel scheduling: Achievable densities
- Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
- Scheduling with a limited testing budget: tight results for the offline and oblivious settings
- Scheduling with explorable uncertainty
- Scheduling with testing on multiple identical parallel machines
- The minimum backlog problem
- The power of amortization on scheduling with explorable uncertainty
- Windows scheduling as a restricted version of bin packing
- Windows Scheduling Problems for Broadcast Systems
This page was built for publication: Perpetual scheduling with explorable uncertainty
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6902097)
