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

Research output: Journal Publications and Reviews (RGC: 21, 22, 62)21_Publication in refereed journalpeer-review

9 Scopus Citations
View graph of relations

Author(s)

Detail(s)

Original languageEnglish
Pages (from-to)4241-4258
Journal / PublicationApplied Mathematical Modelling
Volume33
Issue number11
Online published19 Mar 2009
Publication statusPublished - Nov 2009
Externally publishedYes

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. © 2009 Elsevier Inc. All rights reserved.

Research Area(s)

  • Cost function, Lagrangian multiplier method, Nonlinear constraint optimization, Queueing system, Relative priority, Service discrimination