<?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%">Millhiser, W.P.</style></author><author><style face="normal" font="default" size="100%">Burnetas, AN</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Optimal admission control in series production systems with blocking</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%">Access control</style></keyword><keyword><style  face="normal" font="default" size="100%">Admission policies</style></keyword><keyword><style  face="normal" font="default" size="100%">Control of queues</style></keyword><keyword><style  face="normal" font="default" size="100%">Markov Decision Processes</style></keyword><keyword><style  face="normal" font="default" size="100%">Markov processes</style></keyword><keyword><style  face="normal" font="default" size="100%">Monotonicity property</style></keyword><keyword><style  face="normal" font="default" size="100%">Multiple processing</style></keyword><keyword><style  face="normal" font="default" size="100%">Optimization</style></keyword><keyword><style  face="normal" font="default" size="100%">Production engineering</style></keyword><keyword><style  face="normal" font="default" size="100%">Queueing theory</style></keyword><keyword><style  face="normal" font="default" size="100%">State-space description</style></keyword><keyword><style  face="normal" font="default" size="100%">Tandem queue</style></keyword><keyword><style  face="normal" font="default" size="100%">Threshold policies</style></keyword></keywords><dates><year><style  face="normal" font="default" size="100%">2013</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-84880212795&amp;doi=10.1080%2f0740817X.2012.706732&amp;partnerID=40&amp;md5=c6fa3eb96f2abea1a227cbc251dc8d3f</style></url></web-urls></urls><number><style face="normal" font="default" size="100%">10</style></number><volume><style face="normal" font="default" size="100%">45</style></volume><pages><style face="normal" font="default" size="100%">1035-1047</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">This article studies the dynamic control of arrivals of multiple job classes in N-stage production systems with finite buffers and blocking after service. A model with multiple processing stages in series is formulated as a Markov decision process and a state definition from the queueing analysis literature is used to simplify the state-space description. This allows several fundamental admission control results from M/M/N and M/M/N/N queueing models as well as tandem models without blocking to be extended to tandem systems with blocking. Specifically, it is shown that the net benefit of admitting a job declines monotonically with the system congestion; thus the decision to admit any job class is based on threshold values of the number of jobs present in the system. Furthermore, conditions under which a job class is always or never admitted, regardless of the state, are derived. The interaction of blocking and admission control is explored by analyzing the effect of blocking on the optimal admission policy and profit. The article concludes with analyses of why extensions including loss and abandonment cannot sustain the monotonicity properties and two surrogate admission rules that may be used in practice but do not account for the blocking effect. © 2013 Taylor &amp; Francis Group, LLC.</style></abstract><notes><style face="normal" font="default" size="100%">cited By 0</style></notes></record></records></xml>