Analysis of the busy period for the M/M/c queue: an algorithmic approach

DOI10.1239/jap/996986654zbMath0985.60084OpenAlexW2073233802MaRDI QIDQ2731162

Maria Jesus Lopez-Herrero, Jesus R. Artalejo

Publication date: 9 May 2002

Published in: Journal of Applied Probability (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1239/jap/996986654

zbMATH Keywords

maximum entropy principlebusy periodM/M/\(c\) queuenumber of customer

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22)

Related Items

Processor-shared service systems with queue-dependent processors ⋮ Mean characteristics of Markov queueing systems ⋮ Busy period analysis for the \(n\)-policy \(GI/M/c\) queue ⋮ On multiserver feedback retrial queue with finite buffer ⋮ The \(M/M/1\) queue with synchronized abandonments ⋮ Modeling Load and Overwork Effects in Queueing Systems with Adaptive Service Rates ⋮ Recursive calculation of moments in priority queues ⋮ Markovian controllable queueing systems with hysteretic policies: Busy period and waiting time analysis