Algorithms for the upper bound mean waiting time in the GI/GI/1 queue
From MaRDI portal
Publication:2306744
Recommendations
- Extremal \(GI/GI/1\) queues given two moments: exploiting Tchebycheff systems
- Applying optimization theory to study extremal GI/GI/1 transient mean waiting times
- Approximating the Mean Waiting Time in the GI/G/s Queue
- Bounds on the expected waiting time in a GI/G/1 queue: upgrading for low traffic intensity
- A Two-Moment Approximation for the Mean Waiting Time in the GI/G/s Queue
Cites work
- Applied Probability and Queues
- Comparison methods for stochastic models and risks
- Deciding Which Queue to Join: Some Counterexamples
- Engineering solution of a basic call-center model
- scientific article; zbMATH DE number 431647 (Why is no real title available?)
- scientific article; zbMATH DE number 1093829 (Why is no real title available?)
- scientific article; zbMATH DE number 3274494 (Why is no real title available?)
- Idle period approximations and bounds for the GI/G/1 queue
- Inequalities for moments of tails of random variables, with a queueing application
- Introduction to probability models
- On Approximations for Queues, I: Extremal Distributions
- On Approximations for Queues, II: Shape Constraints
- On Approximations for Queues, III: Mixtures of Exponential Distributions
- On the Lambert \(w\) function
- Sharp Bounds on Laplace-Stieltjes Transforms, with Applications to Various Queueing Problems
- Simple Inequalities for the D/G/1 Queue
- Some inequalities for the queue GI/G/1
- Some Inequalities in Queuing
- Technical Note—Simulating the GI/G/1 Queue in Heavy Traffic
- The Fourier-series method for inverting transforms of probability distributions
Cited in
(10)- Extremal \(GI/GI/1\) queues given two moments: exploiting Tchebycheff systems
- Applying optimization theory to study extremal GI/GI/1 transient mean waiting times
- Extremal models for the \(G I \slash G I \slash K\) waiting-time tail-probability decay rate
- Bounds on the expected waiting time in a GI/G/1 queue: upgrading for low traffic intensity
- Simple Inequalities for the D/G/1 Queue
- Set-valued performance approximations for the \(GI/GI/K\) queue given partial information
- MAD dispersion measure makes extremal queue analysis simple
- A robust queueing network analyzer based on indices of dispersion
- Heavy-traffic single-server queues and the transform method
- Eliciting claims development patterns and costs hidden in backlogs
This page was built for publication: Algorithms for the upper bound mean waiting time in the \(\mathrm{GI}/\mathrm{GI}/1\) queue
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2306744)
