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

作     者：Sun, Wei Guo, Pengfei Tian, Naishuo Li, Shiyong 

作者机构：Yanshan Univ Coll Sci Qinhuangdao 066004 Hebei Peoples R China Hong Kong Polytech Univ Dept Logist & Maritime Studies Hong Kong Hong Kong Peoples R China Yanshan Univ Coll Informat Sci & Engn Qinhuangdao 066004 Hebei Peoples R China Beijing Jiaotong Univ Sch Elect & Informat Engn Beijing 100044 Peoples R China 

出 版 物：《APPLIED MATHEMATICAL MODELLING》 (应用数学模型)

年 卷 期：2009年第33卷第11期

页      面：4241-4258页

核心收录：

学科分类：07[理学] 070104[理学-应用数学] 0701[理学-数学] 0801[工学-力学（可授工学、理学学位）] 

基　　金：National Natural Science Foundation of China National Basic Research Program of China [2007CB307100] Natural Science Foundation of Hebei Province [F2008000864] HK PolyU Research Foundation [PB0W] 

主　　题：Queueing system Relative priority Cost function Service discrimination Nonlinear constraint optimization Lagrangian multiplier method 

摘      要：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 DIPS policy. Moreover, we also discuss variations where service rates of the two classes are decision variables under service equalization and service discrimination disciplines, respectively. (C) 2009 Elsevier Inc. All rights reserved.