Optimal priority assignment: a time sharing approach
From MaRDI portal
Recommendations
- Optimal priority assignment with hard constraint
- Technical Note—On Rothkopf and Smith's Statement Regarding Optimal Priority Assignment
- scientific article; zbMATH DE number 58790
- Characterization and Optimization of Achievable Performance in General Queueing Systems
- On the Kleinrock-Nilsson problem of optimal scheduling algorithms for time-shared systems
Cited in
(15)- On the Kleinrock-Nilsson problem of optimal scheduling algorithms for time-shared systems
- Time-average and asymptotically optimal flow control policies in networks with multiple transmitters
- A multiobjective control approach to priority queues
- Extreme point characterization of constrained nonstationary infinite-horizon Markov decision processes with finite state space
- Optimal scheduling policies in time sharing service systems
- Optimal flow control of multi server time sharing queueing network with priority
- Stochastic approximations for finite-state Markov chains
- Optimal priority assignment with hard constraint
- Technical Note—On Rothkopf and Smith's Statement Regarding Optimal Priority Assignment
- scientific article; zbMATH DE number 58790 (Why is no real title available?)
- Time-Sharing Policies for Controlled Markov Chains
- MULTI-CLASS RESOURCE SHARING WITH PREEMPTIVE PRIORITIES
- Asymptotic properties of constrained Markov Decision Processes
- scientific article; zbMATH DE number 4188952 (Why is no real title available?)
- Dynamic priority allocation via restless bandit marginal productivity indices
This page was built for publication: Optimal priority assignment: a time sharing approach
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3470236)