<?xml version="1.0" encoding="UTF-8"?><xml><records><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Örmeci, EL</style></author><author><style face="normal" font="default" size="100%">Burnetas, A</style></author><author><style face="normal" font="default" size="100%">Van Der Wal, J.</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Admission policies for a two class loss system</style></title><secondary-title><style face="normal" font="default" size="100%">Communications in Statistics. Part C: Stochastic Models</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2001</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">https://www.scopus.com/inward/record.uri?eid=2-s2.0-2342486375&amp;partnerID=40&amp;md5=645716c43df506e197fdf89677d510df</style></url></web-urls></urls><number><style face="normal" font="default" size="100%">4</style></number><volume><style face="normal" font="default" size="100%">17</style></volume><pages><style face="normal" font="default" size="100%">513-539</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">We consider the problem of dynamic admission control in a Markovian loss queueing system with two classes of customers with different service rates and revenues. We show that under certain conditions, customers of one class, which we call a preferred class, are always admitted to the system. Moreover, the optimal policy is of threshold type, and we establish that the thresholds are monotone under very restrictive conditions. Copyright © 2001 by Marcel Dekker, Inc.</style></abstract><notes><style face="normal" font="default" size="100%">cited By 22</style></notes></record></records></xml>