On computing average cost optimal policies with application to routing to parallel queues

DOI10.1007/BF01194247zbMath0880.90137MaRDI QIDQ1360869

Linn I. Sennott

Publication date: 23 July 1997

Published in: Mathematical Methods of Operations Research (Search for Journal in Brave)

zbMATH Keywords

approximating sequence methodaverage cost optimal stationary policiescontrolled discrete-time Markov processesdenumberable state Markov decision chainsoptimal routing of packets to parallel queues

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22) Markov and semi-Markov decision processes (90C40)

Cites Work

• Unnamed Item
• Another set of conditions for average optimality in Markov control processes
• A survey of Markov decision models for control of networks of queues
• Optimal control of two interacting service stations
• Aggregation in Dynamic Programming
• Average Cost Optimal Stationary Policies in Infinite State Markov Decision Processes with Unbounded Costs
• A simple dynamic routing problem
• Optimal Dynamic Assignment of Customers to Heterogeneous Servers in Parallel
• Optimality of the shortest line discipline
• On the optimal assignment of customers to parallel servers
• The Computation of Average Optimal Policies in Denumerable State Markov Decision Chains
• Discrete-Time Controlled Markov Processes with Average Cost Criterion: A Survey

This page was built for publication: On computing average cost optimal policies with application to routing to parallel queues