Extremal models for the \(G I \slash G I \slash K\) waiting-time tail-probability decay rate
From MaRDI portal
Publication:2661563
DOI10.1016/j.orl.2020.09.004OpenAlexW3086757755MaRDI QIDQ2661563
Publication date: 7 April 2021
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.orl.2020.09.004
Related Items (4)
SET-VALUED PERFORMANCE APPROXIMATIONS FOR THE QUEUE GIVEN PARTIAL INFORMATION ⋮ Applying optimization theory to study extremal \(GI/GI/1\) transient mean waiting times ⋮ Extremal \(GI/GI/1\) queues given two moments: exploiting Tchebycheff systems ⋮ Correction to: ``Extremal \(GI/GI/1\) queues given two moments: exploiting Tchebycheff systems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On Markov-Krein characterization of the mean waiting time in \(M/G/K\) and other queueing systems
- Algorithms for the upper bound mean waiting time in the \(\mathrm{GI}/\mathrm{GI}/1\) queue
- Asymptotic behavior of the stationary distributions in the GI/PH/c queue with heterogeneous servers
- Approximating a Point Process by a Renewal Process, I: Two Basic Methods
- Sharp Bounds on Laplace-Stieltjes Transforms, with Applications to Various Queueing Problems
- Tchebycheff Systems for Probabilistic Analysis
- Logarithmic asymptotics for steady-state tail probabilities in a single-server queue
- Applied Probability and Queues
- The Accuracy of the Equivalent Random Method With Renewal Inputs*
- Generalized Chebychev Inequalities: Theory and Applications in Decision Analysis
- Exponential Approximations for Tail Probabilities in Queues, I: Waiting Times
This page was built for publication: Extremal models for the \(G I \slash G I \slash K\) waiting-time tail-probability decay rate
