Efficient Routing in Heavy Traffic Under Partial Sampling of Service Times

DOI10.1287/moor.1080.0325zbMath1213.60066arXiv0711.2188WikidataQ59313608 ScholiaQ59313608MaRDI QIDQ3169002

Rami Atar, Adam Shwartz

Publication date: 27 April 2011

Published in: Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0711.2188

zbMATH Keywords

Halfin-Whitt regime; routing policies; service time sampling

Mathematics Subject Classification ID

90B15: Stochastic network models in operations research

60K25: Queueing theory (aspects of probability theory)

90B22: Queues and service in operations research

68M20: Performance evaluation, queueing, and scheduling in the context of computer systems

60F17: Functional limit theorems; invariance principles

60K30: Applications of queueing theory (congestion, allocation, storage, traffic, etc.)

Related Items

A blind policy for equalizing cumulative idleness, Performance-based routing, Unnamed Item