Control charts for generalized exponential distribution percentiles

The generalized exponential (GE) distribution, which was introduced by Mudholkar and Srivastava in 1993 Mudholkar, G. S., Srivastava, D. K. (1993). Exponentiated Weibull family for analyzing bathtub failure data. IEEE Transactions on Reliability 42:299–302. [Google Scholar], has been studied for various applications of lifetime modelings. In this article, five control charts, that comprise the Shewhart-type chart and four parametric bootstrap charts based on maximum likelihood estimation method, the moment estimation method, probability plot method, and least-square error method for the GE percentiles, are investigated. An extensive Monte Carlo simulation study is conducted to compare the performance among all five control charts in terms of average run length. Finally, an example is given for illustration.     

Stationary distributions of the R[X]/R/1 cross-correlated queue

We consider an infinite buffer single server queue wherein batch interarrival and service times are correlated having a bivariate mixture of rational (R) distributions, where R denotes the class of distributions with rational Laplace–Stieltjes transform (LST), i.e., ratio of a polynomial of degree at most n to a polynomial of degree n. The LST of actual waiting time distribution has been obtained using Wiener–Hopf factorization of the characteristic equation. The virtual waiting time, idle period (actual and virtual) distributions, as well as inter-departure time distribution between two successive customers have been presented. We derive an approximate stationary queue-length distribution at different time epochs using the Markovian assumption of the service time distribution. We also derive the exact steady-state queue-length distribution at an arbitrary epoch using distributional form of Little’s law. Finally, some numerical results have been presented in the form of tables and figures.     

Multi-class M/PH/1 queues with deterministic impatience times

This article considers computational procedures for the waiting time and queue length distributions in stationary multi-class first-come, first-served single-server queues with deterministic impatience times. There are several classes of customers, which are distinguished by deterministic impatience times (i.e., maximum allowable waiting times). We assume that customers in each class arrive according to an independent Poisson process and a single server serves customers on a first-come, first-served basis. Service times of customers in each class are independent and identically distributed according to a phase-type distribution that may differ for different classes. We first consider the stationary distribution of the virtual waiting time and then derive numerically feasible formulas for the actual waiting time distribution and loss probability. We also analyze the joint queue length distribution and provide an algorithmic procedure for computing the probability mass function of the stationary joint queue length.     

Nonparametric control chart based on change-point model

A change-point control chart for detecting shifts in the mean of a process is developed for the case where the nominal value of the mean is unknown but some historical samples are available. This control chart is a nonparametric chart based on the Mann–Whitney statistic for a change in mean and adapted for repeated sequential use. We do not require any knowledge of the underlying distribution such as the normal assumption. Particularly, this distribution robustness could be a significant advantage in start-up or short-run situations where we usually do not have knowledge of the underlying distribution. The simulated results show that our approach has a good performance across the range of possible shifts and it can be used during the start-up stages of the process.      

Fast computing for dynamic screening systems when analyzing correlated data

In practice, we often need to identify individuals whose longitudinal behaviour is different from the behaviour of those well-functioning individuals, so that some unpleasant consequences (e.g. stroke) can be avoided or early detected. To handle such applications, a new statistical method, called dynamic screening system, has been developed in the literature. A recent version of this method can analyze correlated data. However, the computation involved is intensive. In this paper, we suggest a fast computing algorithm for the dynamic screening system. The algorithm can improve the effectiveness of the conventional dynamic screening system in certain cases. Numerical results show that the new algorithm works well in different cases.     

An alternative to confidence intervals constructed after a Hausman pretest in panel data

Consider panel data modelled by a linear random intercept model that includes a time‐varying covariate. Suppose that our aim is to construct a confidence interval for the slope parameter. Commonly, a Hausman pretest is used to decide whether this confidence interval is constructed using the random effects model or the fixed effects model. This post‐model‐selection confidence interval has the attractive features that it (a) is relatively short when the random effects model is correct and (b) reduces to the confidence interval based on the fixed effects model when the data and the random effects model are highly discordant. However, this confidence interval has the drawbacks that (i) its endpoints are discontinuous functions of the data and (ii) its minimum coverage can be far below its nominal coverage probability. We construct a new confidence interval that possesses these attractive features, but does not suffer from these drawbacks. This new confidence interval provides an intermediate between the post‐model‐selection confidence interval and the confidence interval obtained by always using the fixed effects model. The endpoints of the new confidence interval are smooth functions of the Hausman test statistic, whereas the endpoints of the post‐model‐selection confidence interval are discontinuous functions of this statistic.     

On confidence bounds for one-parameter exponential families

There exist various methods for providing confidence intervals for unknown parameters of interest on the basis of a random sample. Generally, the bounds are derived from a system of non-linear equations. In this article, we present a general solution to obtain an unbiased confidence interval with confidence coefficient 1 ? α in one-parameter exponential families. Also we discuss two Bayesian credible intervals, the highest posterior density (HPD) and relative surprise (RS) credible intervals. Standard criteria like the coverage length and coverage probability are used to assess the performance of the HPD and RS credible intervals. Simulation studies and real data applications are presented for illustrative purposes.     

Monitoring process mean using generally weighted moving average chart for exponentially distributed characteristics

In this article, we will present a control chart using normal transformation and generally weighted moving average (GWMA) statistic when the quality characteristic follows the exponential distribution. We will develop the necessary measures to monitor the mean of the process using GWMA statistic and analyze the performance using simulation. The average run lengths for monitoring process average are given for various process shifts. The performance of the proposed chart is examined and compared with the existing control chart. The proposed control chart is effective for the monitoring of small shifts in the mean process. The application of the proposed chart is illustrated with the help of simulated data.