Optimal myopic policies and index policies for stochastic scheduling problems
From MaRDI portal
Publication:4304581
DOI10.1007/BF01414030zbMath0819.90047OpenAlexW2136356780MaRDI QIDQ4304581
Publication date: 12 September 1994
Published in: ZOR - Methods and Models of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01414030
Deterministic scheduling theory in operations research (90B35) Dynamic programming (90C39) Markov and semi-Markov decision processes (90C40) Stochastic systems in control theory (general) (93E03)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- K competing queues with geometric service requirements and linear costs: The \(\mu\) c-rule is always optimal
- Arm-acquiring bandits
- Two competing queues with linear costs and geometric service requirements: the μc-rule is often optimal
- The cμ rule revisited
- Scheduling Multiclass Single Server Queueing Systems to Stochastically Maximize the Number of Successful Departures
- A Priority Queue with Discounted Linear Costs
- Dynamic Scheduling of a Multiclass Queue: Discount Optimality
- Optimal Control of Single-Server Queuing Networks and Multi-Class M/G/1 Queues with Feedback
- Optimal control of single-server queueing networks
- Characterization and Computation of Optimal Policies for Operating an M/G/1 Queuing System with Removable Server
This page was built for publication: Optimal myopic policies and index policies for stochastic scheduling problems