The use of relative priorities in optimizing the performance of a queueing system

Abstract

Relative priorities in an n-class queueing system can reduce server and customer costs. This property is demonstrated in a single server Markovian model where the goal is to minimize a non-linear cost function of class expected waiting times. Special attention is given to minimizing server’s costs when the expected waiting time of each class is restricted.