Assessing process capability based on Bayesian approach with subsamples

Process capability indices (PCIs) have been widely used to measure the actual process information with respect to the manufacturing specifications, and become the common language for process quality between the customer and the supplier. Most of existing research works for capability testing are based on the traditional frequentist point of view and statistical properties of the estimated PCIs are derived based on the assumption of one single sample. In this paper, we consider the problem of estimating and testing process capability using Bayesian approach based on subsamples collected over time from an in-control process. The posterior probability and the credible interval for the most popular index _Cpk$C_{\mathit{pk}}$ under a non-informative prior are derived. The manufacturers can use the presented approach to perform capability testing and determine whether their processes are capable of reproducing product items satisfying customers’ stringent quality requirements when a daily-based or weekly-based production control plan is implemented for monitoring process stability.     

Variable sampling inspection for resubmitted lots based on process capability index Cpk for normally distributed items

In this article, a variables sampling inspection plan for resubmitted lot based on the process capability index C_pk is developed for normally distributed items with unknown mean and variance. The three plan parameters, sample size n, critical acceptance value k_a and the number of resubmissions m, are determined simultaneously by minimizing average sample number (ASN) with two conditions specified by the producer and the consumer. The advantages of the proposed resubmitted sampling plan over the variables single sampling plan are also discussed. Tables of plan parameters for selected values of acceptable quality level (AQL), limiting quality level (LQL), producer’s α-risk and consumer’s β-risk are provided and discussed with the help of an application example.     

Decision-making in testing process performance with fuzzy data

Over the years, numerous process capability indices (PCIs) have been proposed to the manufacturing industry to provide numerical measures of process performance. Most research efforts have focused on developing and investigating PCIs that assess process capability by precise measurements of output quality. However, real observations of continuous quantities are not precise numbers; in practice, they are more or less imprecise. Since observations of continuous random variables are imprecise the values of related test statistics become imprecise. Therefore, decision rules for statistical tests have to be adapted to this situation. This article presents a set of confidence intervals that produces triangular fuzzy numbers for the estimation of C_pk index using Buckley’s approach with some modification. Additionally, a three-decision testing rule and step-by-step procedure are developed to assess process performance based on fuzzy critical values and fuzzy p-values. This concept is also illustrated with an example for testing process performance.     

A Bayesian approach for assessing process precision based on multiple samples

Using process capability indices to quantify manufacturing process precision (consistency) and performance, is an essential part of implementing any quality improvement program. Most research works for testing the capability indices have focused on using the traditional distribution frequency approaches. Cheng and Spiring [IIE Trans. 21 (1) 97] proposed a Bayesian procedure for assessing process capability index C_p based on one single sample. In practice, manufacturing information regarding product quality characteristic is often derived from multiple samples, particularly, when a routine-based quality control plan is implemented for monitoring process stability. In this paper, we consider estimating and testing C_p with multiple samples using Bayesian approach, and propose accordingly a Bayesian procedure for capability testing. The posterior probability, p, for which the process under investigation is capable, is derived. The credible interval, a Bayesian analogue of the classical lower confidence interval, is obtained. The results obtained in this paper, are generalizations of those obtained in Cheng and Spiring [IIE Trans. 21 (1), 97]. Practitioners can use the proposed procedure to Cheng and Spiring determine whether their manufacturing processes are capable of reproducing products satisfying the preset precision requirement.     

Production yield measure for multiple characteristics processes based on {S_{pk}^T} under multiple samples

Process yield is an important criterion used in the manufacturing industry for measuring process performance. Methods for measuring yield for processes with single characteristic have been investigated extensively. However, methods for measuring yield for processes with multiple characteristics have been comparatively neglected. Chen et al. (Qual Reliab Eng Int 19:101–110, 2003) proposed a measurement formula called S_pk^T{S_{pk}^T } , which provides an exact measure of the overall process yield, for processes with multiple characteristics. In this paper, we considered the natural estimator of S_pk^T{S_{pk}^T } under multiple samples, and derived the asymptotic distribution for the estimator. In addition, a comparison between the SB (standard bootstrap) and the proposed method based on the lower confidence bound is executed. Generally, the result indicates that the proposed approach is more reliable than the standard bootstrap method.     

Cpk index estimation using fuzzy numbers

Process capacity indices (PCIs) were developed and have been successfully used by companies to compete in and dominate the high-profit markets by improving the quality and the productivity since the past two decades. There is an essential assumption, in the conventional application, wherein the output process measurements are precise and distributed as normal random variables. Since the assumption of normal distribution is untenable, errors can occur if the C_pk index is computed using non-normal data. In the present study, we address the situation that the output of data from measurement of the quality of a product is insufficiently precise or scarce. This is possible when the quality measurement refers to the decision-maker’s subjective determination. In such a situation, the linguistic variable that is easier to capture the decision-maker’s subjective perception is applied to construct the PCI C_pk. The present approach can mitigate the effect when the normal assumption is inappropriate and extends the application of C_pk index.     

Lower Bounds for Scheduling on Identical Parallel Machines with Heads and Tails

In this paper, we investigate new lower bounds for the P|r _j ,q _j |C _max scheduling problem. A new bin packing based lower bound, as well as several new lifting procedures are derived for this strongly NP -hard problem. Extensive numerical experiments show that the proposed lower bounds consistently outperform the best existing ones.     

Optimal designs for weighted approximation and integration of stochastic processes on [0,∞)

We study minimal errors and optimal designs for weighted L₂-approximation and weighted integration of Gaussian stochastic processes X defined on the half-line [0,∞). Under some regularity conditions, we obtain sharp bounds for the minimal errors for approximation and upper bounds for the minimal errors for integration. The upper bounds are proven constructively for approximation and non-constructively for integration. For integration of the r-fold integrated Brownian motion, the upper bound is proven constructively and we have a matching lower bound.     

Code constructions and existence bounds for relative generalized Hamming weight

The relative generalized Hamming weight (RGHW) of a linear code C and a subcode C ¹ is an extension of generalized Hamming weight. The concept was firstly used to protect messages from an adversary in the wiretap channel of type II with illegitimate parties. It was also applied to the wiretap network II for secrecy control of network coding and to trellis-based decoding algorithms for complexity estimation. For RGHW, bounds and code constructions are two related issues. Upper bounds on RGHW show the possible optimality for the applications, and code constructions meeting upper bounds are for designing optimal schemes. In this article, we show indirect and direct code constructions for known upper bounds on RGHW. When upper bounds are not tight or constructions are hard to find, we provide two asymptotically equivalent existence bounds about good code pairs for designing suboptimal schemes. Particularly, most code pairs (C, C ¹) are good when the length n of C is sufficiently large, the dimension k of C is proportional to n and other parameters are fixed. Moreover, the first existence bound yields an implicit lower bound on RGHW, and the asymptotic form of this existence bound generalizes the usual asymptotic Gilbert–Varshamov bound.     

Bounds for solid angles of lattices of rank three

We find sharp absolute constants C₁ and C₂ with the following property: every well-rounded lattice of rank 3 in a Euclidean space has a minimal basis so that the solid angle spanned by these basis vectors lies in the interval [C₁,C₂]. In fact, we show that these absolute bounds hold for a larger class of lattices than just well-rounded, and the upper bound holds for all. We state a technical condition on the lattice that may prevent it from satisfying the absolute lower bound on the solid angle, in which case we derive a lower bound in terms of the ratios of successive minima of the lattice. We use this result to show that among all spherical triangles on the unit sphere in RN with vertices on the minimal vectors of a lattice, the smallest possible area is achieved by a configuration of minimal vectors of the (normalized) face centered cubic lattice in R³. Such spherical configurations come up in connection with the kissing number problem.