An Exact Analysis of the Multi‐class M/M/k Priority Queue with Partial Blocking

Sleptchenko, A. and Harten van, A. and Heijden van der, M.C. (2003) An Exact Analysis of the Multi‐class M/M/k Priority Queue with Partial Blocking. Stochastic Models, 19 (4). pp. 527-548. ISSN 1532-6349

PDF
Restricted to UT campus only: Request a copy
168Kb

Abstract:	We consider a multi‐server queuing model with two priority classes that consist of multiple customer types. The customers belonging to one priority class customers are lost if they cannot be served immediately upon arrival. Each customer type has its own Poisson arrival and exponential service rate. We derive an exact method to calculate the steady state probabilities for both preemptive and nonpreemptive priority disciplines. Based on these probabilities, we can derive exact expressions for a wide range of relevant performance characteristics for each customer type, such as the moments of the number of customers in the queue and in the system, the expected postponement time and the blocking probability. We illustrate our method with some numerical examples
Item Type:	Article
Copyright:	© Taylor & Francis
Faculty:	Management and Governance (SMG)
Research Chair:	Operations Management and Logistics (OMPL)
Research Group:	Industrial Engineering & Business Information Systems (IEBIS)
Link to this item:	http://purl.utwente.nl/publications/81242
Official URL:	http://dx.doi.org/10.1081/STM-120025403
Export this item as:	BibTeX EndNote HTML Citation Reference Manager

Show download statistics for this publication

Repository Staff Only: item control page

Metis ID: 207193