Performance analysis of Markovian queue with impatience and vacation times
classification
🧮 math.PR
keywords
customersimpatientperformancesystemanalysisassumedconsiderderive
read the original abstract
We consider an $M/M/1$ queueing system with impatient customers with multiple and single vacations. It is assumed that customers are impatient whenever the state of the server. We derive the probability generating functions of the number of customers in the system and we obtain some performance measures.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.