Heavy Traffic queues with heterogeneous servers:pathwise average cost per unit time problem

DOI10.1080/07362999608809450MaRDI QIDQ4342428zbMATH OpenOpenAlexFDO

Authors K. M. Ramachandran

Publication date 2 November 1997

Published in Stochastic Analysis and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/07362999608809450

zbMATH Keywords

heavy trafficmartingale problemoccupation measuresoptimal policiesqueueing network

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22)

Recommendations

• Limit theorems for pathwise average cost per unit time problems for controlled queues in heavy traffic
• Nearly optimal control of queues in heavy traffic with heterogeneous servers
• Routing and Singular Control for Queueing Networks in Heavy Traffic
• Optimal and Approximately Optimal Control Policies for Queues in Heavy Traffic

Cites work

• Diffusion Approximation for an M/G/m Queue
• Ergodic Control of Multidimensional Diffusions I: The Existence Results
• scientific article; zbMATH DE number 42423 (Why is no real title available?)
• scientific article; zbMATH DE number 3274494 (Why is no real title available?)
• Individually optimal routing in parallel systems
• State of the Art—Networks of Queues: A Survey of Weak Convergence Results

Cited in

(2)

• Nearly optimal control of queues in heavy traffic with heterogeneous servers
• Limit theorems for pathwise average cost per unit time problems for controlled queues in heavy traffic

This page was built for publication: Heavy Traffic queues with heterogeneous servers:pathwise average cost per unit time problem

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