The effect of priorities on the average waitingtime. A waitingtime process is described in terms of customers arriving at a single counter. In the first part of the article the formulae of A. C obham  and  for the case of two priorities are applied to the following situation: customers arrive in such a way that the interarrival times s are mutually independent and exponentially distributed with mean ¿-1. Servicetimes s are mutually independent and independent of the interarrival times. The distributionfunction of s is indicated by B (s), the mean of s by µ. The customers are divided in two groups, group 1 consisting of the customers having servicetimes cµ, group 2 of those having servicetimes > cµ, c being a positive number. Servicing takes place as follows: priority is given to customers of group 1 i.e. service of a customer of group 2 starts only if no customers of group 1 are present, customers of the same group are served in the order of their arrival, servicing of a customer is not interrupted. Keeping ¿µ <1 the mean waitingtime e¿* for an arbitrary customer is then calculated by means of Cobham's formulae and compared with the mean waitingtime e¿, in case that no priorities are given. Under hypothesis of differentiability of B (s>is the (unique) value of c which minimizes e¿*. It is shown that always c*> 1. In the second part a situation is considered which has been treated by T. E. Phipps . In this situation the customer having the smallest servicetime of all customers present when the counter becomes free is served first. The mean waitingtime e¿** in this case is compared with e¿ and e¿*. Some examples and graphs are given.
|Number of pages||11|
|Publication status||Published - 1959|