Optimal Dynamic Assignment of Customers to Heterogeneous Servers in Parallel
From MaRDI portal
Publication:4032590
DOI10.1287/opre.40.6.1126zbMath0770.90028OpenAlexW2015075674MaRDI QIDQ4032590
Rhonda Righter, Susan H. Xu, J. George Shanthikumar
Publication date: 1 April 1993
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.40.6.1126
Related Items
On computing average cost optimal policies with application to routing to parallel queues ⋮ Matched queues with flexible and impatient customers ⋮ Analysis of job assignment with batch arrivals among heterogeneous servers ⋮ Maximizing throughput in finite-source parallel queue systems ⋮ An Overview for Markov Decision Processes in Queues and Networks ⋮ Infinite-Horizon Average Optimality of the N-Network in the Halfin–Whitt Regime ⋮ Optimal control of a stochastic assembly production line ⋮ Filtering policies in loss queueing network location problems
This page was built for publication: Optimal Dynamic Assignment of Customers to Heterogeneous Servers in Parallel