
References
Armony, M.: Dynamic routing in large-scale service systems with heterogeneous servers. Queueing Syst. 51, 287–329 (2005)
Atar, R.: Central limit theorem for a many-server queue with random service rates. Ann. Appl. Probab. 18(4), 1548–1568 (2008)
Atar, R., Shaki, Y., Shwartz, A.: A blind policy for equalizing cumulative idleness. Queueing Syst. 67, 275–293 (2011)
Atar, R., Shwartz, A.: Efficient routing in heavy traffic under partial sampling of service times. Math. Oper. Res. 33(4), 899–909 (2008)
Büke, B., Qin, W.:Many-server queues with random service rates in the Halfin–Whitt regime: A measure-valued process approach. Available at Arxiv arXiv:1905.04198 (2021)
Gans, N., Liu, N., Mandelbaum, A., Shen, H., Ye, H.: Service times in call centers: Agent heterogeneity and learning with some operational consequences. In: Borrowing Strength: Theory Powering Applications, vol. 6, pp. 99–123 (2010)
Gurvich, I., Whitt, W.: Queue-and-idleness-ratio controls in many-server service systems. Math. Oper. Res. 34, 363–396 (2009)
Halfin, S., Whitt, W.: Heavy-traffic limits for queues with many exponential servers. Oper. Res. 29(3), 567–588 (1981)
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
About this article
Cite this article
Büke, B. Modelling heterogeneity in many-server queueing systems. Queueing Syst 100, 401–403 (2022). https://doi.org/10.1007/s11134-022-09788-1
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11134-022-09788-1