MINIMIZING LOSS PROBABILITY IN QUEUING SYSTEMS WITH HETEROGENEOUS SERVERS

Abstract

The probability of losing a customer in M/G/n/0 and GI/M/n/0 loss queuing systems withheterogeneous servers is minimized. The first system uses a queue discipline in which a customer who arriveswhen there are free servers chooses any one of them with equal probability, but is lost otherwise. Providedthat the sum of the servers rates are fixed, loss probability in this system attains minimum value when all theservice rates are equal. The second system uses queue discipline, in which a customer who enters into thesystem is assigned to the server with the lowest number. Loss probability in this system takes the minimumvalue in the case when the fastest server rule is used in which an incoming customer is served by the freeserver with the shortest mean service time. If the mean of the arrival distribution is fixed, then loss probabilityis minimized by deterministic arrival distribution