Relative priority policies for minimizing the cost of queueing systems with service discrimination

Abstract

This paper considers several single-server two-class queueing systems with different cost functions. Customers in the two classes are discriminated by service rates and relative priorities. Most attention is focused on the ones with general quadratic bivariable and exponential cost functions that are usually applied in the relatively complicated systems. To the best of the authors’ knowledge, there is no literature analyzing these two kinds of cost functions on the subject of relative priority. We explicitly present the conditions under which relative priority outperforms absolute priority for reducing system cost and further provide the method to find the optimal DPS policy. Moreover, we also discuss variations where service rates of the two classes are decision variables under service equalization and service discrimination disciplines, respectively.