<?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, AN</style></author><author><style face="normal" font="default" size="100%">Emmons, H.</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Dynamic policies of admission to a two-class system based on customer offers</style></title><secondary-title><style face="normal" font="default" size="100%">IIE Transactions (Institute of Industrial Engineers)</style></secondary-title></titles><keywords><keyword><style  face="normal" font="default" size="100%">Computer integrated manufacturing</style></keyword><keyword><style  face="normal" font="default" size="100%">Dynamic admission control</style></keyword><keyword><style  face="normal" font="default" size="100%">Markov processes</style></keyword><keyword><style  face="normal" font="default" size="100%">Markovian loss queueing system</style></keyword><keyword><style  face="normal" font="default" size="100%">Mathematical models</style></keyword><keyword><style  face="normal" font="default" size="100%">Optimization</style></keyword><keyword><style  face="normal" font="default" size="100%">Poisson distribution</style></keyword><keyword><style  face="normal" font="default" size="100%">Queueing networks</style></keyword><keyword><style  face="normal" font="default" size="100%">Scheduling</style></keyword><keyword><style  face="normal" font="default" size="100%">Servers</style></keyword><keyword><style  face="normal" font="default" size="100%">Theorem proving</style></keyword></keywords><dates><year><style  face="normal" font="default" size="100%">2002</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-0036722524&amp;doi=10.1023%2fA%3a1015552906175&amp;partnerID=40&amp;md5=212ab3520a5a9235a69d7c0b020e1706</style></url></web-urls></urls><number><style face="normal" font="default" size="100%">9</style></number><volume><style face="normal" font="default" size="100%">34</style></volume><pages><style face="normal" font="default" size="100%">813-822</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 jobs with different service rates and random revenues. We establish the existence of an optimal monotone policy. We also show that under certain conditions there exist preferred jobs from either class.</style></abstract><notes><style face="normal" font="default" size="100%">cited By 9</style></notes></record></records></xml>