Journal of Applied Mathematics and Decision Sciences
Volume 2 (1998), Issue 2, Pages 119-132
doi:10.1155/S1173912698000066
Abstract
It is known that a threshold policy (or trunk reservation policy) is optimal for Erlang’s
loss system under certain assumptions. In this paper we examine the robustness of this policy
under departures from the standard assumption of exponential service times (call holding times)
and give examples where the optimal policy has a generalized trunk reservation form.