A new heavy traffic limit for the asymmetric shortest queue problem

DOI10.1017/S0956792599003861zbMath0976.60090OpenAlexW2005085030MaRDI QIDQ4719096

Charles Knessl

Publication date: 7 September 2001

Published in: European Journal of Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0956792599003861

zbMATH Keywords

heavy traffic limitsteady state queue lengthshortest queue problem

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22)

Related Items (3)

Analysis of job assignment with batch arrivals among heterogeneous servers ⋮ On the infinite server shortest queue problem: non-symmetric case ⋮ ON THE INFINITE SERVER SHORTEST QUEUE PROBLEM: SYMMETRIC CASE

This page was built for publication: A new heavy traffic limit for the asymmetric shortest queue problem