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

DOI10.1080/07362999608809450zbMath0874.60083OpenAlexW2954151195MaRDI QIDQ4342428

Kandethody 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 trafficqueueing networkoptimal policiesmartingale problemoccupation measures

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Individually optimal routing in parallel systems
• Ergodic Control of Multidimensional Diffusions I: The Existence Results
• State of the Art—Networks of Queues: A Survey of Weak Convergence Results
• Diffusion Approximation for an M/G/m Queue

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