Optimal assignment policy of a single server attended by two queues
From MaRDI portal
Publication:1354292
DOI10.1016/0096-3003(95)00298-7zbMath0871.60083MaRDI QIDQ1354292
Publication date: 5 May 1997
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0096-3003(95)00298-7
60K25: Queueing theory (aspects of probability theory)
91B32: Resource and cost allocation (including fair division, apportionment, etc.)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A simple technique in Markovian control with applications to resource allocation to resource allocation in communication networks
- Two competing queues with linear costs and geometric service requirements: the μc-rule is often optimal
- On the convergence of successive approximations in dynamic programming with non-zero terminal reward
- Optimal control of service in tandem queues
- Applying a New Device in the Optimization of Exponential Queuing Systems
- Conditions for optimality in dynamic programming and for the limit of n-stage optimal policies to be optimal
- A Priority Queue with Discounted Linear Costs
- Dynamic Scheduling of a Multiclass Queue: Discount Optimality
- Time-Sharing Service Systems. I
- On the Optimal Control of Two Queues with Server Setup Times and Its Analysis