On computing average cost optimal policies with application to routing to parallel queues
From MaRDI portal
Recommendations
Cites work
- A simple dynamic routing problem
- A survey of Markov decision models for control of networks of queues
- Aggregation in Dynamic Programming
- Another set of conditions for average optimality in Markov control processes
- Average Cost Optimal Stationary Policies in Infinite State Markov Decision Processes with Unbounded Costs
- Discrete-Time Controlled Markov Processes with Average Cost Criterion: A Survey
- scientific article; zbMATH DE number 700091 (Why is no real title available?)
- On the optimal assignment of customers to parallel servers
- Optimal control of two interacting service stations
- Optimal Dynamic Assignment of Customers to Heterogeneous Servers in Parallel
- Optimality of the shortest line discipline
- The Computation of Average Optimal Policies in Denumerable State Markov Decision Chains
This page was built for publication: On computing average cost optimal policies with application to routing to parallel queues
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1360869)