Some comparability results for waiting times in single- and many-server queues

DOI10.2307/3213704zbMath0552.60086OpenAlexW2326249958MaRDI QIDQ3345553

Tomasz Rolski, Daryl J. Daley

Publication date: 1984

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

Full work available at URL: https://doi.org/10.2307/3213704

zbMATH Keywords

ordering relations in queueingstationary waiting-time

Mathematics Subject Classification ID

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

Related Items

On the inapproximability of \(M/G/K\): Why two moments of job size distribution are not enough, Comparison conjectures about the M/G/s queue, Approximations and Optimal Control for State-Dependent Limited Processor Sharing Queues, On Markov-Krein characterization of the mean waiting time in \(M/G/K\) and other queueing systems, Mathematical theory of queueing networks, An effective method for constructing bounds for ruin probabilities for the surplus process perturbed by diffusion, Spatiotemporal Convexity of Stochastic Processes and Applications, Bedienungstheorie: Tendenzen und neuere Entwicklungen. (Servicing theory: Tendencies and new developments), Bounds for the mean queue length of the \(M/K_ 2/m\) queue