Open access

# New Models of Acceptance Sampling Plans

Written By

Submitted: 29 March 2012 Published: 19 December 2012

DOI: 10.5772/50835

From the Edited Volume

## Practical Concepts of Quality Control

Chapter metrics overview

View Full Metrics

## 1. Introduction

Acceptance sampling is a procedure used for sentencing incoming batches. Sampling plan consist of a sample size and a decision making rule. The sample size is the number of items to sample or the number of measurements to take. The decision making rule involves the acceptance threshold and a description of how to use the sample result to accept or reject the lot. Acceptance sampling plans are also practical tools for quality control applications, which involve quality contracting on product orders between the vendor and the buyer. Those sampling plans provide the vendor and the buyer rules for lot sentencing while meeting their preset requirements on product quality. Scientific sampling plans are the primary tools for quality and performance management in industry today. In an industrial plant, sampling plans are used to decide either to accept or reject a received batch of items. With attribute sampling plans, these accept/reject decisions are based on a count of the number of defective items. The sample size is assumed constant in traditional sampling plans.

In this section, several new decision making policies for the acceptance sampling problem are introduced. The objective of these models is to find constant control thresholds for lot sentencing problem.

The single stage acceptance sampling plan based on the control threshold policy is presented in section 2, the acceptance sampling policy based on number of successive conforming items is presented in section 3, and acceptance sampling policy using the minimum angle method is presented in sections 4. Acceptance sampling policy based on cumulative sum of conforming Items run lengths comes in section 5 and acceptance sampling policy based on Bayesian inference comes in section 6. Finally the chapter is concluded in section 7.

## 2. Single Stage Acceptance Sampling Plan based on the Control Threshold Policy [1]

We suppose a batch of size n is received which its proportion of the defectives items is equal to p . For a batch of size n , random variable Y is defined as the number of inspected items and z is defined as the number of items classified as 'defective' after inspection. The number of inspected items has an upper threshold equal to m . For Y = 1 , 2 , ... , m inspected items ( m n ) the batch will be rejected if x z where x is the upper control level for batch acceptance. In the other words, when the number of defective items in the inspected items gets more than the control threshold x then decision making process stops and the batch is rejected.

The probability distribution function of Y is determined by the following equations,

Pr { Y } = { { z = 0 x Pr { z } = Pr { z x 1 } + Pr { z = x } = z = 0 x 1 ( m z ) p z ( 1 p ) m z + ( m 1 x 1 ) p x ( 1 p ) m x Y = m ( Y 1 x 1 ) p x ( 1 p ) Y x      x Y m E1

In Eq. (1), Y = m indicates that all items are inspected therefore, the number of defective items has been less than x or x t h defective item has been m t h inspected item. For the case x Y m , x t h defective item has been Y t h inspected item thus, the probability distribution function of Y follows a negative binomial distribution. The expected mean of the number of inspected items is determined as follows:

E [ Y ] x = m z = 0 x 1 ( m z ) p z ( 1 p ) m z + m ( m 1 x 1 ) p x ( 1 p ) m x + Y = x m 1 Y ( Y 1 x 1 ) p x ( 1 p ) Y x = m z = 0 x 1 ( m z ) p z ( 1 p ) m z + Y = x m Y ( Y 1 x 1 ) p x ( 1 p ) Y x E2

Since Pr { Y } = ( Y 1 x 1 ) p x ( 1 p ) Y x x Y m is a negative binomial distribution thus using the approximation method of estimating negative binomial probabilities with Poisson distribution [2], following is concluded,

Pr { Y } = P o i s s o n ( λ ) = e λ λ Y x Γ ( Y x + 1 ) E3

where λ = x 1 p p is the parameter of Poisson distribution. In order to improve the accuracy of this approximation, m and x should be sufficiently large numbers. Using the above approximation method, following is concluded,

E [ Y ] x m z = 0 x 1 ( m z ) p z ( 1 p ) m z + Y = x m Y e λ λ Y x Γ ( Y x + 1 ) E4

Now, let P x denotes the probability of rejecting the batch. The batch is rejected if the number of defective items is more than or equal to x thus the value of P x is determined by the following equation,

P x = z = x m ( m z ) p z ( 1 p ) m z E5

In order to calculate the total cost, including the cost of rejecting the batch, the cost of inspection and the cost of defective items, assume R is the cost of rejecting the batch, c is the inspection cost of one item and c ' is the cost of one defective item, so the total cost, C x , is determined by conditioning C x on two events of rejecting or accepting the batch, thus the objective function is written as follows:

C x =E( C x | Reject the batch )P( Reject the batch )+ E( C x | Accept the batch )P( Accept the batch )= P x ( R+cE [ Y ] x )+ ( np c ' +cE [ Y ] x )( 1 P x )= P x R+np c ' ( 1 P x )+cE [ Y ] x E6

Thus we have,

C x = P x R + n p c ' ( 1 P x ) + m c z = 0 x 1 ( m z ) p z ( 1 p ) m z + c Y = x m Y e λ λ Y x Γ ( Y x + 1 ) = R z = x m ( m z ) p z ( 1 p ) m z + z = 0 x 1 ( m z ) p z ( 1 p ) m z ( n p c ' + m c ) + c Y = x m Y e λ λ Y x Γ ( Y x + 1 ) E7

In Eq. (7), c E [ Y ] x is the total cost of inspection and n p c ' is the total cost of defective items. The optimal value of x is determined by minimizing the value of objective function C x . Using the optimization methods, it is concluded that,

Δ C x = C x C x1 =R z=x m ( m z ) p z ( 1p ) mz +( mc+np c ' ) z=0 x1 ( m z ) p z ( 1p ) mz + c Y=x m Y e λ λ Yx Γ( Yx+1 ) =( R z=x1 m ( m z ) p z ( 1p ) mz + ( mc+np c ' ) z=0 x2 ( m z ) p z ( 1p ) mz + c Y=x1 m Y e λ λ Yx Γ( Y(x1)+1 ) + ) E8

To evaluate above equation, following equality is considered,

Y = x m Y e λ λ Y x Γ ( Y x + 1 ) Y = x 1 m Y e λ λ Y ( x 1 ) Γ ( Y ( x 1 ) + 1 ) = Y = x m e λ λ Y x Γ ( Y x + 1 ) m e λ λ m ( x 1 ) Γ ( m ( x 1 ) + 1 ) E9

Since m is a sufficiently large number thus the value of m e λ λ m ( x 1 ) Γ ( m ( x 1 ) + 1 ) is approximately equal to zero therefore it is concluded that,

Δ C x = R ( m x 1 ) p x 1 ( 1 p ) m ( x 1 ) + ( m c + n p c ' ) ( m x 1 ) p x 1 ( 1 p ) m ( x 1 ) + c Y = x m e λ λ Y x Γ ( Y x + 1 ) = ( m c + n p c ' R ) ( m x 1 ) p x 1 ( 1 p ) m ( x 1 ) + c Y = x m e λ λ Y x Γ ( Y x + 1 ) E10

To ensure that x minimizes the objective function (7), it is necessary to find the value of x that satisfies following inequalities:

Δ C x+1 = C x+1 C x >0,Δ C x = C x C x1 <0 E11

Hence,

Δ C x+1 =( mc+npc'R )( m x ) p x ( 1p ) mx +c Y=x+1 m e λ λ Y( x+1 ) Γ( Y( x+1 )+1 ) >0 Δ C x =( mc+npc'R )( m x1 ) p x1 ( 1p ) m( x1 ) +c Y=x m e λ λ Yx Γ( Yx+1 ) <0 E12

Now If mc+npc'<R , then,

( m x 1 ) p x 1 ( 1 p ) m ( x 1 ) c Y = x m e λ λ Y x Γ ( Y x + 1 ) ( R ( m c + n p c ' ) ) c Y = x + 1 m e λ λ Y x Γ ( Y x + 1 ) ( R ( m c + n p c ' ) ) ( m x ) p x ( 1 p ) m x E13

Since with increasing the value of x the value of binomial distribution with parameters m and p decreases thus according to the properties of binomial distribution, it is concluded that x>( m+1 )p therefore, the optimal value of x is determined using the following formula,

x = M i n { x ; x ( m + 1 ) p ; ( m x 1 ) p x 1 ( 1 p ) m ( x 1 ) c Y = x m e λ λ Y x Γ ( Y x + 1 ) ( R ( m c + n p c ' ) ) c Y = x + 1 m e λ λ Y x Γ ( Y x + 1 ) ( R ( m c + n p c ' ) ) ( m x ) p x ( 1 p ) m x } E14

Also The objective function, C x , should be minimized regarding two constraints on Type-I and Type-II errors associated with the acceptance sampling plans. Type-I error is the probability of rejecting the batch when the nonconformity proportion of the batch is acceptable. Type-II error is the probability of accepting the batch when the nonconforming proportion of the batch is not acceptable. Then, in one hand, if p = δ 1 , the probability of rejecting the batch should be less than α . On the other hand, in case where p = δ 2 , the probability of accepting the batch should be less than β where δ 1 is the AQL (Accepted Quality Level ) and δ 2 is the LQL (Limiting Quality Level) and α is the probability of Type-I error and β is the probability of Type-II error in making a decision, therefore, the optimal value of x is determined using the following formula,

x = M i n { x ; x ( m + 1 ) p ; ( m x 1 ) p x 1 ( 1 p ) m ( x 1 ) c Y = x m e λ λ Y x Γ ( Y x + 1 ) ( R ( m c + n p c ' ) ) c Y = x + 1 m e λ λ Y x Γ ( Y x + 1 ) ( R ( m c + n p c ' ) ) ( m x ) p x ( 1 p ) m x z = x m ( m z ) δ 1 z ( 1 δ 1 ) m z α , z = 0 x 1 ( m z ) δ 2 z ( 1 δ 2 ) m z β } E15

When mc+npc'>R , It is concluded that Eq. (16) is positive for all values of x so x = 0 . In this case, if one defective item is found in an inspected sample then the batch would be rejected. In this case, the rejection cost R is less than the total cost of inspecting m items and the cost of defective items, hence rejecting the batch would be the optimal decision. However, in practice the rejection cost R is usually big enough so that, we overlooked that case.

Δ C x =( mc+npc'R )( m x1 ) p x1 ( 1p ) m( x1 ) +c Y=x m e λ λ Yx Γ( Yx+1 ) E16

## 3. Acceptance Sampling Policy Based on Number of Successive Conforming Items [3]

In a typical acceptance-sampling plan, when the number of conforming items between successive nonconforming items is more than an upper control threshold, the batch is accepted, and when it is less than a lower control threshold, the batch is rejected otherwise, the inspection process continues. This initiates the idea of employing a Markovian approach to model the acceptance-sampling problem. As a result, in this method, a new acceptance-sampling policy using Markovian models is proposed, in which determining the control thresholds are aimed. The notations required to model the problem at hand are given as:

1. N : The number of items in the batch

2. p : The proportion of nonconforming items in the batch

3. I : The cost of inspecting one item

4. c : The cost of one nonconforming item

5. R : The cost of rejecting the batch

6. E ( T C ) : The expected total cost of the system

7. E ( A C ) : The expected total cost of accepting the batch

8. E ( R P ) : The expected total cost of rejecting the batch

9. E ( I ) : The expected total cost of inspecting the items of the batch

10. U : The upper control threshold

11. L : The lower control threshold

Consider an incoming batch of N items with a proportion of nonconformities p , of which items are randomly selected for inspection and based on the number of conforming items between two successive nonconforming items, the batch is accepted, rejected, or the inspection continues. The expected total cost associated with this inspection policy can be expressed using Eq. (17).

E ( T C ) = E ( A C ) + E ( R P ) + E ( I ) E17

Let Y i be the number of conforming items between the successive ( i 1 ) t h and i t h nonconforming items, U the upper and L the lower control thresholds. Then, if Y i U the batch is accepted, if Y i L the batch is rejected. Otherwise, if L< Y i <U the process of inspecting items continues. The states involved in this process can be defined as follows.

State 1: Y i falls within two control thresholds L, i.e., L< Y i <U , thus the inspection process continues.

State 2: Y i is more than or equal the upper control threshold, i.e., Y i U , hence the batch is accepted.

State 3: Y i is less than or equal the lower control threshold, i.e., Y i L , hence the batch is rejected.

The transition probabilities among the states can be obtained as follows.

Probability of inspecting more items= p 11 = Pr { L< Y i <U }

Probability of accepting the batch= p 12 = Pr { Y i U }

Probability of rejecting the batch= p 13 = Pr { Y i L }

where the probabilities can be obtained based on the fact that the number of conforming items between the successive ( i 1 ) t h and i t h nonconforming items, Y i , follows a geometric distribution with parameter p , i.e., Pr ( Y i = r ) = ( 1 p ) r p ; r = 0 , 1 , 2 , ... Then, the transition probability matrix is expressed as follows:

P = 1 2 3 [ p 11 0 0 p 12 1 0 p 13 0 1 ] 1          2           3 E18

As it can be seen, the matrix P is an absorbing Markov chain with states 2 and 3 being absorbing and state 1 being transient.

To analyze the above absorbing Markov chain, the transition probability matrix should be rearranged in the following form:

[ A O R Q ] E19

Rearranging the P matrix yields the following matrix:

2 3 1 [ 1 0 p 12 0 1 p 13 0 0 p 11 ]    2         3         1   E20

Then, the fundamental matrix M can be obtained as follows [4],

M= m 11 = ( I-Q ) 1 = 1 1 p 11 = 1 1Pr{ L< Y i <U } E21

Where I is the identity matrix and m 11 denotes the expected long-run number of times the transient state 1 is occupied before absorption occurs (i.e., accepted or rejected), given that the initial state is 1. The long-run absorption probability matrix, F , is calculated as follows [4],

F = M × R = 1 [ p 12 1 p 11 p 13 1 p 11 ] 2                           3 E22

The elements of the F matrix, f 12 , f 13 , denote the probabilities of the batch being accepted or rejected, respectively.

The expected cost can be obtained using Eq. (17) containing the batch acceptance, rejection, and inspection costs. The expected acceptance cost is the cost of nonconforming items ( N p c ) multiplied by the probability of the batch being accepted (i.e., f 12 ). The expected rejection cost is the rejection cost ( R ) multiplied by the probability of the batch being rejected (i.e., f 13 ). Moreover, m 11 is the expected long-run number of times the transient state 1 is occupied before absorption occurs. Knowing that in each visit to transient state, the average number of inspections is 1 p (the mean of the geometric distribution), the expected inspection cost is given by

E ( I ) = I p m 11 E23

Therefore, the expected cost for acceptance-sampling policy can be expressed as a function of f 12 , f 13 and m 11 as follows:

E ( T C ) = c N p f 12 + R f 13 + I p m 11 E24

Substituting for f 12 and m 11 , the expected cost equation can be rewritten as:

E ( T C ) = N p c p 12 1 p 11 + R ( 1 p 12 1 p 11 ) + I p ( 1 1 p 11 ) E25

Eq. (25) can be solved numerically using search algorithms to find L and U that minimize the expected total cost. The objective function, E ( T C ) , should be minimized regarding two constraints on Type-I and Type-II errors associated with the acceptance sampling plans. Type-I error is the probability of rejecting the batch when the nonconformity proportion of the batch is acceptable. Type-II error is the probability of accepting the batch when the nonconforming proportion of the batch is not acceptable. Then, in one hand, if p = A Q L , the probability of rejecting the batch should be less than α . On the other hand, in case where p = L Q L , the probability of accepting the batch should be less than β where α and β are the probabilities of Type-I and Type-II errors, hence,

p=AQL Pr{ Y i U } 1Pr{ L< Y i <U } 1α p=LQL1 Pr{ Y i U i } 1Pr{ L< Y i <U } 1β E26

The optimum values of L and U among a set of alternative values are determined solving the model given in (25), numerically, where the probabilities are obtained using the geometric distribution.

## 4. Acceptance Sampling Policy Using the Minimum Angle Method based on Number of Successive Conforming Items [5]

The practical performance of any sampling plan is determined through its operating characteristic curve. When producer and consumer are negotiating for designing sampling plans, it is important especially to minimize the consumer risk. In order to minimize the consumer’s risk, the ideal OC curve could be made to pass as closely through [ A Q L , 1 α ] , [ A Q L , β ] . One approach to minimize the consumers risks for ideal condition is proposed with minimization of angle ϕ between the lines joining the points [ A Q L , 1 α ] , [ A Q L , β ] and [ A Q L , 1 α ] , [ L Q L , β ] . Therefore in this case, the value of performance criteria in minimum angle method will be [6],

T a n ( ϕ ) = ( L Q L - A Q L Pr a ( A Q L ) Pr a ( L Q L ) ) E27

where Pr a ( L Q L ) , Pr a ( A Q L ) is the probability of accepting the batch when the proportion of defective items in the batch is respectively L Q L , A Q L . Assume A is the point [ A Q L , 1 α ] , B is the point [ A Q L , β ] and C is the point [ L Q L , β ] thus the smaller value of T a n ( ϕ ) , the angle ϕ approaching zero, and the chord A C approaching A B , the ideal condition.

The values of Pr a ( L Q L ) , Pr a ( A Q L ) are determined as follows,

p=AQL Pr a ( AQL )= f 12 ( AQL )= Pr{ U Y i } 1Pr{ U> Y i >L } p=LQL1 Pr a ( LQL )=1 f 12 ( LQL )=1 Pr{ U Y i } 1Pr{ U> Y i >L } E28

Since the values of L Q L , A Q L are constant and L Q L A Q L therefore the objective function is determined as follows,

V = M i n L , U { Pr a ( L Q L ) Pr a ( A Q L ) } E29

Another performance measure of acceptance sampling plans is the expected number of inspected items. Since sampling and inspecting usually has cost, therefore designs that minimizes this measure and satisfy the first and second type error inequalities are considered to be optimal sampling plans. Since the proportion of defective items is not known in the start of process, in order to consider this property in designing the acceptance sampling plans, we try to minimize the expected number of inspected items for acceptable and not acceptable lots simultaneously. Therefore the optimal acceptance sampling plan should have three properties, first it should have a minimized value in the objective function of the minimum angle method that is resulted from the ideal OC curve and also it should minimize the expected number of inspected items either in the decisions of rejecting or accepting the lot. Therefore the second objective function is defined as the expected number of items inspected. The value of this objective function is determined based on the value of m 11 ( p ) where m 11 ( p ) is the expected number of times in the long run that the transient state 1 is occupied before absorption occurs, since in each visit to transient state, the average number of inspections is 1 p , consequently the expected number of items inspected is given by 1 p m 11 ( p ) . Now the objective functions W and Z are defined as the expected number of items inspected respectively in the acceptable condition ( p = A Q L ) and not acceptable condition ( p = L Q L ) .

W = M i n L , U { 1 A Q L m 11 ( A Q L ) } Z = M i n L , U { 1 L Q L m 11 ( L Q L ) } E30

Now one approach to optimize the objective functions simultaneously is to define control thresholds for objective functions Z , W and then trying to minimize the value of objective function V . For example if parameters Z 1 , W 1 are defined as the upper control thresholds for Z , W then the optimization problem can be defined as follows,

M i n L , U { V } S . t . Z Z 1 , W W 1 E31

Optimal values of L , U can be determined by solving above nonlinear optimization problem using search procedures or other optimization tools.

## 5. Acceptance Sampling Policy Based on Cumulative Sum of Conforming Items Run Lengths [7]

In an acceptance-sampling plan, assume Y i is the number of conforming items between the successive ( i 1 ) t h and i t h defective items. Decision making is based on the value of S i that is defined as,

S i = Y i + Y i 1 E32

The proposed acceptance sampling policy is defined as follows,

1. If S i U then the batch is accepted

2. If S i L the batch is rejected

3. If L< S i <U the process of inspecting the items continues

where U is the upper control threshold and L is the lower control threshold.

In each stage of the data gathering process, the index of different states of the Markov model, j , is defined as:

1. j = 1 represents the state of rejecting the batch. In this state S i L thus the batch is rejected.

2. j = Y i + 2   where Y i = 0 , 1 , 2... , U 1 represents the state of continuing data gathering. In this state, L< S i = Y i + Y i1 <U thus the inspecting process continues.

3. j = U + 2 represents the state of accepting the batch. In this state S i U hence the batch is accepted.

In other word, the acceptance-sampling plan can be expressed by a Markov model, in which the transition probability matrix among the states of the batch can be expressed as:

p j k = { 1                                        j = k = 1 0                                          j = 1 , k 1 Pr ( Y i + 1 L - j + 2 )             U + 2 j 1 , L j 2 , k = 1 0                                          U + 2 j 1 , L j 2 , k = 1 0                                          U + 2 j 1 , U + 2 k 1 , j + k 4 L 0                                          U + 2 j 1 , U + 2 k 1 , j + k 4 U   Pr ( Y i + 1 = k 2 )                  U + 2 j 1 , U + 2 k 1 , U j + k 4 L 1                                           j = k = U + 2 0                                          j = U + 2 , k U + 2 Pr ( Y i + 1 U j + 2 )            U + 2 j 1 , k = U + 2 E33

where, p j k is probability of going from state j to state k in a single step and Y i + 1 denotes the number of conforming items between the successive defective items and Pr( Y i+1 =r )= ( 1p ) r p r=0,1,2,... where p denotes the proportion of defective items in the batch.

The values of p j k are determined based on the relations among the states, for example where U+2>j>1,Lj2,k=1 then according to the definition of j , it is concluded that j = Y i + 2   and transition probability of going form state j to state k = 1 is equal to the probability of rejecting the batch that is evaluated as follows,

p j 1 = Pr ( L S i + 1 = Y i + 1 + Y i ) = Pr ( L Y i + 1 + j 2 ) = Pr ( Y i + 1 L j + 2 ) E34

In the other case where, U+2>j>1,U+2>k>1,U>j+k4>L , based on the definition of j , we have j = Y i + 2   thus it is concluded that

p jk =Pr( L< S i+1 = Y i+1 + Y i <U, Y i+1 =k2 )= Pr( L<j2+ Y i+1 <U, Y i+1 =k2 )= Pr( L<j2+k2<U, Y i+1 =k2 )=Pr( L<j+k4<U, Y i+1 =k2 ) E35

In the other case where, U+2>j>1,k=U+2 , then according to the definition of j , we have j = Y i + 2   thus it is concluded that,

p j U + 2 = Pr ( S i + 1 = Y i + 1 + Y i U ) = Pr ( Y i + 1 + j 2 U ) = Pr ( Y i + 1 U j + 2 ) E36

In the other case where, U+2>j>1,U+2>k>1,j+k4U  , then according to the definition of j, we have j = Y i + 2   thus it is concluded that,

p jk =Pr( L< S i+1 = Y i+1 + Y i <U, Y i+1 =k2,j+k4U  ) =Pr( L<j2+ Y i+1 <U, Y i+1 =k2,j+k4U ) =Pr( L<j+k4<U,j+k4U )=0 E37

As a result, when L = 1 and U = 3 for example, the transition probability matrix among the states of the system can be expressed as:

P = 1 2 3 4 5 [ 1 0 0 0 0 Pr ( Y 1 ) 0 0 Pr ( Y = 2 ) Pr ( Y 3 ) Pr ( Y 0 ) 0 Pr ( Y = 1 ) 0 Pr ( Y 2 ) 0 Pr ( Y = 0 ) 0 0 Pr ( Y 1 ) 0 0 0 0 1 ] 1                            2                                 3                               4                             5 E38

And it can be seen the matrix P is an absorbing Markov chain with states 1 and 5 being absorbing and states 2, 3, and 4 being transient.

Analyzing the above absorbing Markov chain requires to rearrange the single-step probability matrix in the following form:

P = [ A O R Q ] E39

where A is the identity matrix representing the probability of staying in a state that is defined as follows

A = [ 1 0 0 1 ] E40

O is the probability matrix of escaping an absorbing state (always zero) that is defined as follows

O = 1 5 [ 0 0 0 0 0 0 ]   2        3         4 E41

Q is a square matrix containing the transition probabilities of going from a non-absorbing state to another non-absorbing state that is defined as follows

Q = 2 3 4 [ 0 0 Pr ( Y = 2 ) 0 Pr ( Y = 1 ) 0 Pr ( Y = 0 ) 0 0 ]   2                            3                              4 E42

And R is the Matrix containing all probabilities of going from a non-absorbing state to an absorbing state (i.e., accepted or rejected batch) that is defined as follows

R = 2 3 4 [ Pr ( Y 1 ) Pr ( Y 3 ) Pr ( Y 0 ) Pr ( Y 2 ) 0 Pr ( Y 1 ) ] 1                                 5 E43

Rearranging the P matrix in the latter form yields the following:

P = 1 5 2 3 4 [ 1 0 0 0 0 0 1 0 0 0 Pr ( Y 1 ) Pr ( Y 3 ) 0 0 Pr ( Y = 2 ) Pr ( Y 0 ) Pr ( Y 2 ) 0 Pr ( Y = 1 ) 0 0 Pr ( Y 1 ) Pr ( Y = 0 ) 0 0 ] 1                             5                            2                            3                              4 E44

Bowling et. al. [4] proposed an absorbing Markov chain model for determining the optimal process means. According to their method, matrix M that is the fundamental matrix containing the expected number of transitions from a non-absorbing state to another non-absorbing state before absorption occurs can be obtained by the following equation,

M = ( I - Q ) - 1 E45

For the above numerical example, i.e., when L = 1 and U = 3 , the fundamental matrix M can be obtained as:

M = ( I - Q ) - 1 = 2 3 4 [ 1 0 Pr ( Y = 2 ) 0 1 Pr ( Y = 1 ) 0 Pr ( Y = 0 ) 0 1 ] 2                               3                               4 1 E46

where I is the identity matrix.

Since m j j represents the expected number of the times in the long-run the transient state j is occupied before absorption occurs (i.e., before accepted or rejected), and matrix F is the absorption probability matrix containing the long run probabilities of the transition from a non-absorbing state to an absorbing state. The long-run absorption probability matrix, F , can be calculated as follows:

F = M × R E47

Again when L = 1 and U = 3 , the elements of F ( f j k     ;     j = 2 , 3 , 4     ;     k = 1 , 5 ) represent the probabilities of the batch being accepted and rejected, respectively, given that the initial state is j = 2 , 3 , 4 . In this case, the probability of accepting the batch is obtained as:

Probability of accepting the batch= j = 2 Pr ( Accepting the batch | the initial state is  j ) × Pr ( the initial state is  j ) = j = 2 4 f j 5 Pr ( Y = j 2 ) + Pr ( Y 3 ) E48

Also the expected number of inspected items will be determined as follows,

Expected number of inspected items = j = 2 U + 1 ( ( the number of inspected items in state j ) ( the number of visits to state j ) ) = j = 2 U + 1 ( j 2 ) m j j E49

This new acceptance-sampling plan should satisfy two constraints of the first and the second types of errors. The probability of Type-I error shows the probability of rejecting the batch when the defective proportion of the batch is acceptable. The probability of Type-II error is the probability of accepting the batch when the defective proportion of the batch is not acceptable. Then on the one hand if p = A Q L , the probability of rejecting the batch will be less than α and on the other hand, in case where p = L Q L , the probability of accepting the batch will be less than β where α and β are the probabilities of Type-I and Type-II errors. Hence,

p = A Q L Probability of accepting the batch 1 α p = L Q L Probability of accepting the batch β E50

From the inequalities in (50), the proper values of the thresholds L and U are determined and among the feasible ones, we select one that has the least value for expected number of inspected items that is obtained using Eq. (49).

## 6. A New Acceptance Sampling Design Using Bayesian Modelling and Backwards Induction [8]

In this research, a new selection approach on the choices between accepting and rejecting a batch based on Bayesian modelling and backwards induction is proposed. The Bayesian modelling is utilized to model the uncertainty involved in the probability distribution of the nonconforming proportion of the items and the backwards induction method is employed to determine the sample size. Moreover, when the decision on accepting or rejecting a batch cannot be made, we assume additional observations can be gathered with a cost to update the probability distribution of the nonconforming proportion of the batch. In other words, a mathematical model is developed in this research to design optimal single sampling plans. This model finds the optimum sampling design whereas its optimality is resulted by using the decision tree approach. As a result, the main contribution of the method is to model the acceptance-sampling problem as a cost optimization model so that the optimal solution can be achieved via using the decision tree approach. In this approach, the required probabilities of decision tree are determined employing the Bayesian Inference. To do this, the probability distribution function of nonconforming proportion of items is first determined by Bayesian inference using a non-informative prior distribution. Then, the required probabilities are determined by applying Bayesian inference in the backward induction method of the decision tree approach. Since this model is completely designed based on the Bayesian inference and no approximation is needed, it can be viewed as a new tool to be used by practitioners in real case problems to design an economically optimal acceptance-sampling plan. However, the main limitation of the proposed methodology is that it can only be applied to items not requiring very low fractions of nonconformities.

### 6.1. Notations

The following notations are used throughout the paper.

Set of decisions: A = { a 1 , a 2 } is defined the set of possible decisions where a 1 and a 2 refer to accepting and rejecting the batch, respectively.

State space: P={ p l ;l=1,2,...;0< p l <1 } is defined the state of the process where p l represents nonconforming proportion items of the batch in l t h state of the process. The decision maker believes the consequences of selecting decision a 1 or a 2 depend on P that cannot be determined with certainty. However, the probability distribution function of the random variable p can be obtained using Bayesian inference.

Set of experiments: E = { e i ; i = 1 , 2 , ... } is the set of experiments to gather more information on p and consequently to update the probability distribution of p . Further, e i is defined an experiment in which i items of the batch are inspected.

Sample space: Z = { z j ; j = 0 , 1 , 2 , ... , i } denotes the outcomes of experiment e i where z j shows the number of nonconforming items in e i .

Cost function: The function u ( e , z , a , p ) on E × Z × A × P denotes the cost associated with performing experiment e , observing z , making decision a , and finding p .

N : The total number of items in a batch

R : The cost of rejecting a batch

C : The cost of one nonconforming item

S : The cost of inspecting one item

n : An upper bound on the number of inspected item

### 6.2. Problem Definition

Consider a batch of size N with an unknown percentage of nonconforming p and assume m items are randomly selected for inspection. Based on the outcome of the inspection process in terms of the observed number of nonconforming items, the decision-maker desires to accept the batch, reject it, or to perform more inspections by taking more samples. As Raiffa & Schlaifer [9] stated "the problem is how the decision maker chose e and then, having observed z , choose e such that u ( e , z , a , p ) is minimized. Although the decision maker has full control over his choice of e and a , he has neither control over the choices of z nor p . However, we can assume he is able to assign probability distribution function over these choices." They formulated this problem in the framework of the decision tree approach, the one that is partially adapted in this research as well.

### 6.3. Bayesian Modelling

For a nonconforming proportion p , referring to Jeffrey’s prior (Nair et al. [10]), we first take a Beta prior distribution with parameters v 0 = 0.5 and u 0 = 0.5 to model the absolute uncertainty. Then, the posterior probability density function of p using a sample of v + u inspected items is

f ( p ) = B e t a ( v + 0.5 , u + 0.5 ) = Γ ( v + u + 1 ) Γ ( v + 0.5 ) Γ ( u + 0.5 ) p v 0.5 ( 1 p ) u 0.5 E51

where v is the number of nonconforming items and u is the number of conforming items in the sample. Moreover, to allow more flexibility in representing prior uncertainty it is convenient to define a discrete distribution by discretization of the Beta density (Mazzuchi, & Soyer [11]). In other words, we define the prior distribution for p l as

Pr { p = p l } = p 1 δ 2 p 1 + δ 2 f ( p ) d p E52

where p 1 =( 2l1 2 )δ  and δ= 1 m  for l=1,2,...,m

Now, define ( j , i ) ; i = 1 , 2 , ... , n and   j = 0 , 1 , 2 , ... , i the experiment in which j nonconforming items are found when i items are inspected. Then, the sample space Z becomes Z = { ( j , i ) : 0 j i n } , resulting in the cost function representation of u [ e i , ( j , i ) , a k , p 1 ] ; k = 1 , 2 that is associated with taking a sample of i items, observing j nonconforming and adopting a 1 or  a 2 when the defective proportion is p l . Using the notations defined, the cost function is determined by the following equations:

1) for accepted batch          u ( e i , ( j , i ) , a 1 , p 1 ) = C N p 1 + S e i 2) for rejected batch           u ( e i , ( j , i ) , a 2 , p 1 ) = R + S e i E53

Moreover, the probability of finding j nonconforming items in a sample of i inspected items, i.e., Pr { ( j , i ) | p = p 1 } , can be obtained using a binomial distribution with parameters ( i , p = p l ) as:

Pr { ( j , i ) | p = p 1 } = C j i p 1 j ( 1 p 1 ) i j E54

Hence, the probability Pr { p = p 1 , z = z j | e = e i } can be calculated as follows

Pr { p = p 1 , z = z j | e = e i } = Pr { z = z j | p = p 1 , e = e i } Pr { p = p 1 } = C j i p 1 j ( 1 p 1 ) i j p 1 δ 2 p 1 + δ 2 f ( p ) d p E55

Thus,

Pr { z = z j | e = e i } = l = 1 m Pr { p = p 1 , z = z j | e = e i } Pr { p = p l } = l = 1 m ( C j i p 1 j ( 1 p 1 ) i j p 1 δ 2 p 1 + δ 2 f ( p ) d p ) E56

In other words, applying the Bayesian rule, the probability Pr { p = p l | z = z j , e = e i } can be obtained by

Pr { p = p 1 | z = z j , e = e i } = Pr { p = p 1 , z = z j | e = e i } Pr { z = z j | e = e i } = C j i p 1 j ( 1 p 1 ) i j p l δ 2 p l + δ 2 f ( p ) d p k = 1 m C j i p k j ( 1 p k ) i j p k δ 2 p k + δ 2 f ( p ) d p   E57

In the next Section, a backward induction approach is taken to determine the optimal sample size.

### 6.4. Backward Induction

The analysis continues by working backwards from the terminal decisions of the decision tree to the base of the tree, instead of starting by asking which experiment e the decision maker should select when he does not know the outcomes of the random events. This method of working back from the outermost branches of the decision tree to the initial starting point is often called "backwards induction" [9]. As a result, the steps involved in the solution algorithm of the problem at hand using the backwards induction becomes

1. Probabilities Pr { p = p l } and Pr { ( j , i ) | p = p l } are determined using Eq. (52) and Eq. (54), respectively.

2. The conditional probability Pr { p = p l | z = z j , e = e i } is determined using Eq. (57).

3. With a known history ( e , z ) , since p is a random variable, the costs of various possible terminal decisions are uncertain. Therefore the cost of any decision a for the given ( e , z ) is set as a random variable u ( e , z , a , p ) . Applying the conditional expectation, E p | z , which takes the expected value of u ( e , z , a , p ) with respect to the conditional probability P p | z (Eq. 57), the conditional expected value of the cost function on state variable p 1 is determined by the following equation.

u *   ( e i , z j , a k ) = l = 1 m ( u *   ( e i , z j , a k , p 1 ) Pr { p = p 1 | z = z j , e = e i } ) E58

4. Since the objective is to minimize the expected cost, the cost of having history ( e , z ) and the choice of decision (accepting or rejecting) can be determined by

u *   ( e i , z j ) = min a k u *   ( e i , z j , a k ) E59

5. The conditional probability Pr { z = z j | e = e i } is determined using Eq. (56).

6. The costs of various possible experiments are random because the outcome z is a random variable. Defining a probability distribution function over the results of experiments and taking expected values, we can determine the expected cost of each experiment. The conditional expected value of function u *   ( e i , z j ) on the variable z j is determined by the following equation.

u * ( e i ) = j = 0 i { u *   ( e i , z j ) Pr { z = z j | e = e i } } E60

7. Now the minimum of the values u * ( e i ) would be the optimal decision, which leads to an optimal sample size.

u *   = min e   u *   ( e i ) =   min e   E z | e   min a   E p | z u ( e i , z j , a k , p 1 ) E61

## 7. Conclusion

Acceptance sampling plans have been widely used in industry to determine whether a specific batch of manufactured or purchased items satisfy a pre-specified quality. In this chapter, new models for determining optimal acceptance sampling plans have been presented. The relationship between the cost model and a decision theory model with probabilistic utilities has been investigated. However, the acceptance sampling plan, which are derived from the optimization of these models, may differ substantially from the plans that other economic approaches suggest but optimization of these models are simple and efficient, with negligible computational requirements. In next sections, a new methodology based on Markov chain was developed to design proper lot acceptance sampling plans. In the proposed procedure, the sum of two successive numbers of nonconforming items was monitored using two lower and upper thresholds, where the proper values of these thresholds could be determined numerically using a Markovian approach based on the two points on OC curve. In last section, based on the Bayesian modelling and the backwards induction method of the decision-tree approach, a sampling plan is developed to deal with the lot-sentencing problem; aiming to determine an optimal sample size to provide desired levels of protection for customers as well as manufacturers. A logical analysis of the choices between accepting and rejecting a batch is made when the distribution function of nonconforming proportion could be updated by taking additional observations and using Bayesian modelling.

## References

1. 1. Fallahnezhad M. S. Hosseininasab H. 2011 Designing a Single Stage Acceptance Sampling Plan based on the control Threshold policy. International Journal of Industrial Engineering & Production Research 22 3 143 150
2. 2. Hilbe J. M. 2007 Negative Binomial Regression. Cambridge, UK : Cambridge University Press
3. 3. Fallahnezhad M. S. Niaki S. T. A. 2011 A New Acceptance Sampling Policy Based on Number of Successive Conforming Items. To Appear in Communications in Statistics-Theory and Methods.
4. 4. Bowling S. R. Khasawneh M. T. Kaewkuekool S. Cho B. R. 2004 A Markovian approach to determining optimum process target levels for a multi-stage serial production system. European Journal of Operational Research 159 636
5. 5. Fallahnezhad M. S. 2012 A New Approach for Acceptance Sampling Policy Based on the Number of Successive Conforming Items and Minimum Angle Method. To Appear in Iranian Journal of Operations Research. 3 1 104 111
6. 6. Soundararajan V. Christina A. L. 1997 Selection of single sampling variables plans based on the minimum angle. Journal of Applied Statistics 24 2 207 218
7. 7. Fallahnezhad M. S. Niaki S. T. A. Abooie M. H. 2011 A New Acceptance Sampling Plan Based on Cumulative Sums of Conforming Run-Lengths. Journal of Industrial and Systems Engineering 4 4 256 264
8. 8. Fallahnezhad M. S. Niaki S. T. A. Vahdat M. A. 2012 A New Acceptance Sampling Design Using Bayesian Modeling and Backwards Induction. International Journal of Engineering, Islamic Republic of Iran 25 1 45 54
9. 9. Raiffa H. 2000 Schlaifer R. Applied statistical decision theory. New York Wiley Classical Library
10. 10. Nair V. N. Tang B. Xu L. 2001 Bayesian inference for some mixture problems in quality and reliability. Journal of Quality Technology 33 16
11. 11. Mazzuchi T. A. Soyer R. 1996 Adaptive Bayesian replacement strategies. Proceedings of the Fifth Valencia International Meeting on Bayesian Statistics(J.M. Bernardo, J. O. Berger, A. P. Dawid, and A. F. M. Smith, eds.)Elsevier 667 674

Written By