The existence of sensitive optimal policies in two multi-dimensional queueing models

DOI10.1007/BF02055586MaRDI QIDQ2640433zbMATH OpenFDO

Authors F. M. Spieksma

Publication date 1991

Published in Annals of Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF02055586

zbMATH Keywords

\(\mu \) -uniform geometric recurrencecompeting queuestwo centre open Jackson network

Mathematics Subject Classification ID

Applications of Markov renewal processes (reliability, queueing networks, etc.) (60K20) Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22) Markov and semi-Markov decision processes (90C40)

Recommendations

• Recurrence Conditions for Average and Blackwell Optimality in Denumerable State Markov Decision Chains
• On the Relation Between Recurrence and Ergodicity Properties in Denumerable Markov Decision Chains
• Monotonic and Insensitive Optimal Policies for Control of Queues with Undiscounted Costs
• Average, Sensitive and Blackwell Optimal Policies in Denumerable Markov Decision Chains with Unbounded Rewards
• scientific article; zbMATH DE number 3900546

Cites work

• Average Cost Optimal Stationary Policies in Infinite State Markov Decision Processes with Unbounded Costs
• Average Cost Semi-Markov Decision Processes and the Control of Queueing Systems
• Average, Sensitive and Blackwell Optimal Policies in Denumerable Markov Decision Chains with Unbounded Rewards
• Conditions for existence of average and Blackwell optimal stationary policies in denumerable Markov decision processes
• Denumerable semi-Markov decision chains with small interest rates
• Geometric Ergodicity of the ALOHA-system and a Coupled Processors Model
• scientific article; zbMATH DE number 3900546 (Why is no real title available?)
• Interchange arguments for classical scheduling problems in queues
• K competing queues with geometric service requirements and linear costs: The \(\mu\) c-rule is always optimal
• Markov programming by successive approximations with respect to weighted supremum norms
• Monotonic and Insensitive Optimal Policies for Control of Queues with Undiscounted Costs
• On ergodicity and recurrence properties of a Markov chain by an application to an open jackson network
• On the Relation Between Recurrence and Ergodicity Properties in Denumerable Markov Decision Chains
• Optimal control of service rates in networks of queues
• Recurrence Conditions for Average and Blackwell Optimality in Denumerable State Markov Decision Chains
• Stochastic Approximations and Adaptive Control of a Discrete-Time Single-Server Network with Random Routing
• The cμ rule revisited
• Time-Sharing Service Systems. I

Cited in

(1)

• Denumerable semi-Markov decision chains with small interest rates

This page was built for publication: The existence of sensitive optimal policies in two multi-dimensional queueing models

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2640433)