TY - JOUR
T1 - Multiattribute bayesian acceptance sampling plans for screening and scrapping rejected lots
AU - Moskowitz, Herbert
AU - Plante, Robert
AU - Tang, Kwei
AU - Ravindran, Arunachalam
N1 - Funding Information:
The research is supported in part by National Science Foundation Grant Number 8007103.
PY - 1984/6
Y1 - 1984/6
N2 - A general model for multiattribute Bayesian acceptance sampling plans is developed which incorporates the multiattribute utility function of a decision maker in its design. The model accommodates various dispositions of rejected lots such as screening and scrapping. The disposition of rejected lots is shown to have a substantial impact on the solution approach used and on the ease of incorporation of multiattribute utility functions in terms of their measurement complexity, functional form, and parameter estimation. For example, if all attributes are screenable upon rejection, and the prior distributions of lot quality on each attribute are independent, then an optimal multiattribute sampling plan can be obtained simply by solving for an optimal single sampling plan on each attribute independently. A discrete search algorithm, based on pattern search, is also developed and shown to be very effective in obtaining an optimal multiattribute inspection plan when such separability cannot be accomplished.
AB - A general model for multiattribute Bayesian acceptance sampling plans is developed which incorporates the multiattribute utility function of a decision maker in its design. The model accommodates various dispositions of rejected lots such as screening and scrapping. The disposition of rejected lots is shown to have a substantial impact on the solution approach used and on the ease of incorporation of multiattribute utility functions in terms of their measurement complexity, functional form, and parameter estimation. For example, if all attributes are screenable upon rejection, and the prior distributions of lot quality on each attribute are independent, then an optimal multiattribute sampling plan can be obtained simply by solving for an optimal single sampling plan on each attribute independently. A discrete search algorithm, based on pattern search, is also developed and shown to be very effective in obtaining an optimal multiattribute inspection plan when such separability cannot be accomplished.
UR - http://www.scopus.com/inward/record.url?scp=0021443075&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=0021443075&partnerID=8YFLogxK
U2 - 10.1080/07408178408974684
DO - 10.1080/07408178408974684
M3 - Article
AN - SCOPUS:0021443075
SN - 0740-817X
VL - 16
SP - 185
EP - 192
JO - IIE Transactions (Institute of Industrial Engineers)
JF - IIE Transactions (Institute of Industrial Engineers)
IS - 2
ER -