Waiting Times in the Non-Preemptive Priority M/M/c Queue
From MaRDI portal
Publication:3725302
DOI10.1080/15326348508807014zbMath0594.60096OpenAlexW2036346738MaRDI QIDQ3725302
Publication date: 1985
Published in: Communications in Statistics. Stochastic Models (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/15326348508807014
Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22)
Related Items (18)
M/M/c Queue with Two Priority Classes ⋮ Equilibrium analysis of unobservable \(M/M/n\) priority queues with balking and homogeneous customers ⋮ Performance evaluation and analysis of a discrete queue system with multiple working vacations and non-preemptive priority ⋮ Waiting times in classical priority queues via elementary lattice path counting ⋮ A foreground-background queueing model with speed or capacity modulation ⋮ Unnamed Item ⋮ Waiting time in the \(\mathrm{M}/\mathrm{M}/m\) LCFS nonpreemptive priority queue with impatient customers ⋮ A base-stock inventory model with service differentiation and response time guarantees ⋮ Approximations for the waiting-time distribution in an \(M/PH/c\) priority queue ⋮ Average waiting time of customers in a priority M/D/k queue with finite buffers ⋮ Waiting and sojourn times in a multi-server queue with mixed priorities ⋮ MULTI-CLASS RESOURCE SHARING WITH PREEMPTIVE PRIORITIES ⋮ Waiting times of a finite-capacity multi-server model with non-preemptive priorities ⋮ Unnamed Item ⋮ The Israeli Queue with Priorities ⋮ An exact solution for the state probabilities of the multi-class, multi-server queue with preemptive priorities ⋮ Multi-server queueing systems with multiple priority classes ⋮ Dynamic routing in large-scale service systems with heterogeneous servers
This page was built for publication: Waiting Times in the Non-Preemptive Priority M/M/c Queue