Admission policies in loss queueing models with heterogeneous arrivals

作     者：Carrizosa, E Conde, E Munoz-Marquez, M 

作者机构：Univ Sevilla Fac Matemat E-41012 Sevilla Spain Univ Cadiz Escuela Politecn Cadiz Dept Matemat Cadiz 11002 Spain 

出 版 物：《MANAGEMENT SCIENCE》 (管理科学)

年 卷 期：1998年第44卷第3期

页      面：311-320页

核心收录：

学科分类：12[管理学] 120202[管理学-企业管理（含：财务管理、市场营销、人力资源管理）] 0202[经济学-应用经济学] 02[经济学] 1202[管理学-工商管理] 1201[管理学-管理科学与工程(可授管理学、工学学位)] 

主　　题：algorithms multichannel queues nonlinear programming optimization 

摘      要：In this paper we consider a loss system where the arrivals can be classified into different groups according to their arrival rate and expected service time. While the standard admission policy consists of rejecting only those customers who arrive when all servers are busy, we address the problem of finding the optimal static admission policy (with respect to a given reward structure) when customers can be discriminated according to the group they belong to, thus customers of some groups might be automatically rejected (even if some servers remain idle) in order to enhance the global efficiency of the system. The optimality of a c mu-rule is shown, from which finite-time algorithms for the one-and two-server cases are derived.