The $M/D/1+D$ queue has the minimum loss probability among $M/G/1+G$ queues

DOI10.1016/J.ORL.2015.10.003zbMath1408.60084OpenAlexW1782200028MaRDI QIDQ1785452

Yoshiaki Inoue, Tetsuya Takine

Publication date: 28 September 2018

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.orl.2015.10.003

zbMATH Keywords

order statisticsspacingsexcess wealth orderloss probability$M/G/1$ queuegeneral impatient customers

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (3)

A computational algorithm for the loss probability in the M/G/1+PH queue ⋮ Analysis of \(M^{ X}/ G/1\) queues with impatient customers ⋮ Comparison results for M/G/1 queues with waiting and sojourn time deadlines

Cites Work

• Stochastic orders
• Dispersive ordering and the total time on test transformation
• On the probability of abandonment in queues with limited sojourn and waiting times
• Analysis of the loss probability in the \(\mathrm{M}/\mathrm{G}/1+\mathrm{G}\) queue
• Single-server queues with impatient customers
• Order Statistics
• General customer impatience in the queue GI/G/1

This page was built for publication: The $M/D/1+D$ queue has the minimum loss probability among $M/G/1+G$ queues