Analysis of mean values of a multi-server model with non-preemptive priorities and non-renewal input

DOI10.1080/15326349708807413zbMath0871.60054OpenAlexW2003966007MaRDI QIDQ3128419

Dietmar Wagner

Publication date: 24 September 1997

Published in: Communications in Statistics. Stochastic Models (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/15326349708807413

zbMATH Keywords

phase-type distributionfirst passage timeMarkovian arrival processmulti-server queuenon-preemptive prioritymarked transitions

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22) Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20)

Related Items (5)

Space Reduction for a Class of Multidimensional Markov Chains: A Summary and Some Applications ⋮ Approximations for the waiting-time distribution in an \(M/PH/c\) priority queue ⋮ An Exact Analysis of the Multi‐classM/M/kPriority Queue with Partial Blocking ⋮ Waiting times of a finite-capacity multi-server model with non-preemptive priorities ⋮ An exact solution for the state probabilities of the multi-class, multi-server queue with preemptive priorities

This page was built for publication: Analysis of mean values of a multi-server model with non-preemptive priorities and non-renewal input