Admission Policies in Loss Queueing Models with Heterogeneous Arrivals
研究损失排队系统中，根据到达率和期望服务时间将顾客分组，并寻找最优静态准入策略（即是否自动拒绝某些组别顾客）以提升系统整体效率，证明了cμ规则的最优性。
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μ-rule is shown, from which finite-time algorithms for the one- and two-server cases are derived.