No Detail Found!

Optimal Sequential Sampling Plans Using Dynamic Programming Approach

Author(s)
Mohammad Saber Fallah Nezhad Industrial Engineering Department, Yazd University, Yazd, Iran
Abolghasem Yousefi Babadi Industrial Engineering Department, Yazd University, Yazd, Iran
Minoo Momeni Industrial Engineering Department, Yazd University, Yazd, Iran
Noushin Sayani Industrial Engineering Department, Yazd University, Yazd, Iran
Fatemeh Akhoondi Industrial Engineering Department, Yazd University, Yazd, Iran
Abstract
In this paper we proposed a dynamic programming procedure to develop an optimal sequential sampling plan. A suitable cost model is employed for depicting the cost of sampling, accepting or rejecting the lot. This model is based on sequential approach. A sequential iterative approach is used for modeling the cost of different decisions in each stage. In addition a backward recursive algorithm is developed to solve the dynamic programming. On the other hand, the purpose of this paper is to introduce a new sequential acceptance sampling plan based on dynamic programming. At the end of this paper a numerical example is solved to show how this model works and then sensitivity analyses of main parameters of acceptance sampling model are carried out.
Publication Details
Page(s) 575-586
DOI DOI not available
Published Journal: Pakistan Journal of Statistics and Operation Research, Volume: 11, Issue: 4, Year: 2015

Request the full text from PASTIC

Keywords
Optimization, Dynamic programming, Recursive Approach, Sampling Plan
More from Pakistan Journal of Statistics and Operation Research
0

Citations

0

Downloads

34

Views

Copyright ©  PASTIC National Center, Islamabad www.pastic.gov.pk