On stochastic ordering and control charts for traffic intensity

DOI10.1080/07474946.2016.1238266MaRDI QIDQ2958403zbMATH OpenOpenAlexWikidataFDO

Authors Manuel Cabral Morais, A. Pacheco

Publication date 1 February 2017

Published in Sequential Analysis (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/07474946.2016.1238266

zbMATH Keywords

stochastic orderingcontrol chartsqueueing systemsrun length

Mathematics Subject Classification ID

Applications of statistics in engineering and industry; control charts (62P30) Inequalities; stochastic orderings (60E15) Queues and service in operations research (90B22) Traffic problems in operations research (90B20)

Recommendations

• Comparing short and long-memory charts to monitor the traffic intensity of single server queues
• Control of traffic intensity in a queue - a method based on SPRT
• Comparing short-memory charts to monitor the traffic intensity of single server queues
• scientific article; zbMATH DE number 1210598
• Control of traffic intensity in hyperexponential and mixed Erlang queueing systems with a method based on SPRT

Cites work

• scientific article; zbMATH DE number 605729 (Why is no real title available?)
• scientific article; zbMATH DE number 3349081 (Why is no real title available?)
• scientific article; zbMATH DE number 3373158 (Why is no real title available?)
• scientific article; zbMATH DE number 965582 (Why is no real title available?)
• scientific article; zbMATH DE number 3069542 (Why is no real title available?)
• A Statistical Technique for the Control of Traffic Intensity in the Queuing Systems M/G/1 and GI/M/1
• A note on the aging properties of the run length of Markov-type control charts
• Ageing first-passage times of Markov processes: a matrix approach
• An approach to the probability distribution of cusum run length
• An autoregressive process and its application to queueing model
• Applied Probability and Queues
• Assessing the Impact of Head Starts in the Performance of One-Sided Markov-Type Control Schemes
• Control of traffic intensity in a queue - a method based on SPRT
• Control of traffic intensity in hyperexponential and mixed Erlang queueing systems with a method based on SPRT
• Foundations of queueing theory
• Fundamentals of queueing theory
• General control charts for variables
• Life distributions. Structure of nonparametric, semiparametric, and parametric families.
• Markov chain approximation methods in a class of level-crossing problems
• Maximum Likelihood Estimates in a Simple Queue
• NBUE and NWUE properties of increasing Markov processes
• On the first passage time distribution for a class of Markov chains
• On the first passage times for Markov processes with monotone convex transition kernels
• On the linear combination of exponential and gamma random variables
• Stochastic Processes Occurring in the Theory of Queues and their Analysis by the Method of the Imbedded Markov Chain
• Stochastic inequalities on partially ordered spaces

Cited in

(2)

• Comparing short and long-memory charts to monitor the traffic intensity of single server queues
• Comparing short-memory charts to monitor the traffic intensity of single server queues

This page was built for publication: On stochastic ordering and control charts for traffic intensity

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2958403)