The existence of sensitive optimal policies in two multi-dimensional queueing models
From MaRDI portal
Publication:2640433
DOI10.1007/BF02055586zbMath0719.90032MaRDI QIDQ2640433
Publication date: 1991
Published in: Annals of Operations Research (Search for Journal in Brave)
60K25: Queueing theory (aspects of probability theory)
90B22: Queues and service in operations research
90C40: Markov and semi-Markov decision processes
60K20: Applications of Markov renewal processes (reliability, queueing networks, etc.)
Related Items
Cites Work
- Unnamed Item
- K competing queues with geometric service requirements and linear costs: The \(\mu\) c-rule is always optimal
- Conditions for existence of average and Blackwell optimal stationary policies in denumerable Markov decision processes
- Interchange arguments for classical scheduling problems in queues
- Denumerable semi-Markov decision chains with small interest rates
- Markov programming by successive approximations with respect to weighted supremum norms
- The cμ rule revisited
- Average Cost Semi-Markov Decision Processes and the Control of Queueing Systems
- Geometric Ergodicity of the ALOHA-system and a Coupled Processors Model
- Average, Sensitive and Blackwell Optimal Policies in Denumerable Markov Decision Chains with Unbounded Rewards
- Monotonic and Insensitive Optimal Policies for Control of Queues with Undiscounted Costs
- Average Cost Optimal Stationary Policies in Infinite State Markov Decision Processes with Unbounded Costs
- Recurrence Conditions for Average and Blackwell Optimality in Denumerable State Markov Decision Chains
- On ergodicity and recurrence properties of a Markov chain by an application to an open jackson network
- Stochastic Approximations and Adaptive Control of a Discrete-Time Single-Server Network with Random Routing
- Time-Sharing Service Systems. I
- On the Relation Between Recurrence and Ergodicity Properties in Denumerable Markov Decision Chains
- Optimal control of service rates in networks of queues
