Comparing short-memory charts to monitor the traffic intensity of single server queues
From MaRDI portal
Publication:1757219
DOI10.1515/eqc-2017-0030zbMath1408.62201OpenAlexW2804010085MaRDI QIDQ1757219
Publication date: 3 January 2019
Published in: Stochastics and Quality Control (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1515/eqc-2017-0030
Applications of statistics in engineering and industry; control charts (62P30) Applications of Markov renewal processes (reliability, queueing networks, etc.) (60K20)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Control of traffic intensity in hyperexponential and mixed Erlang queueing systems with a method based on SPRT
- Control of traffic intensity in a queue - a method based on SPRT
- On the linear combination of exponential and gamma random variables
- Markov chain approximation methods in a class of level-crossing problems
- An autoregressive process and its application to queueing model
- Performance analysis of queue length monitoring of M/G/1 systems
- On stochastic ordering and control charts for traffic intensity
- Introduction to Modeling and Analysis of Stochastic Systems
- Adaptive server staffing in the presence of time-varying arrivals: a feed-forward control approach
- Applied Probability and Queues
- A Statistical Technique for the Control of Traffic Intensity in the Queuing Systems M/G/1 and GI/M/1
- An approach to the probability distribution of cusum run length
- Stochastic Processes Occurring in the Theory of Queues and their Analysis by the Method of the Imbedded Markov Chain
This page was built for publication: Comparing short-memory charts to monitor the traffic intensity of single server queues