Optimality of index policies for stochastic scheduling with switching penalties
From MaRDI portal
Publication:4031668
Recommendations
- Optimal myopic policies and index policies for stochastic scheduling problems
- Optimal stochastic scheduling of forest networks with switching penalties
- Properties of the Gittins index with application to optimal scheduling
- Optimal Scheduling of Multiclass Stochastic Systems
- Multi-armed bandits with switching penalties
Cited in
(12)- Allocating flexible servers in serial systems with switching costs
- OPTIMAL JOB SCHEDULING OF M/GI/1 QUEUE WITH FEEDBACK: THE DISCOUNTED CASE
- Properties of the Gittins index with application to optimal scheduling
- Stochastic scheduling of parallel queues with set-up costs
- Open Problem—M/G/1 Scheduling with Preemption Delays
- Nested Optimal Policies for Set Functions with Applications to Scheduling
- Single-Visit Policies for Allocating a Single Resource in a Stochastic Environment
- A perpetual search for talents across overlapping generations: a learning process
- Interchange arguments in stochastic scheduling
- Optimal myopic policies and index policies for stochastic scheduling problems
- Index heuristics for multiclass \(M/G/1\) systems with nonpreemptive service and convex holding costs
- On the Gittins index for multistage jobs
This page was built for publication: Optimality of index policies for stochastic scheduling with switching penalties
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4031668)