Please use this identifier to cite or link to this item:
https://repository.iimb.ac.in/handle/2074/11526
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Mahajan, Siddharth | |
dc.date.accessioned | 2020-04-10T13:25:44Z | - |
dc.date.available | 2020-04-10T13:25:44Z | - |
dc.date.issued | 2013 | |
dc.identifier.issn | 1748-5037 | |
dc.identifier.uri | https://repository.iimb.ac.in/handle/2074/11526 | - |
dc.description.abstract | In this paper, we find the best sampling plan in acceptance sampling, to reduce producer and consumer risks. A sampling plan consists of two parameters, the sample size and the maximum allowed number of defectives. For a given sample size, there is a trade-off between the producer risk and the consumer risk. Which risk would be higher would depend on the other parameter which decides the sampling plan, the maximum allowed number of defectives. We show that as the sample size is increased, both producer and consumer risks can be reduced together. But increasing the sample size, means additional inspection cost for each and every sample. So, risk reduction would happen at a cost. Typically, the binomial distribution is used to determine the producer and consumer risks for a sampling plan. In the model, we use the normal approximation to the binomial. With the model, the sampling plan can be found very quickly, using Excel. | |
dc.publisher | Inderscience Enterprises Ltd. | |
dc.subject | Acceptance Sampling | |
dc.subject | Consumer Risk | |
dc.subject | Producer Risk | |
dc.subject | Quality | |
dc.subject | Risk | |
dc.subject | Risk Reduction | |
dc.title | Determining sampling plans in acceptance sampling to reduce producer and consumer risks | |
dc.type | Journal Article | |
dc.identifier.doi | 10.1504/IJISE.2013.057480 | |
dc.pages | 462-474p. | |
dc.vol.no | Vol.15 | - |
dc.issue.no | Iss.4 | - |
dc.journal.name | International Journal of industrial and Systems Engineering | |
Appears in Collections: | 2010-2019 |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.