TY - JOUR
T1 - Optimal allocation of inspection effort over a finite planning horizon
AU - Kogan, Konstantin
AU - Raz, Tzvl
PY - 2002/6/1
Y1 - 2002/6/1
N2 - We address the problem of managing the intensity, sequence and timing of inspection effort in an N-stage production system with M inspection activities possible at each stage. The objective is to minimize the sum of the inspection costs and the penalties caused by undetected defects. By means of the maximum principle we prove several properties or the optimal solution, which allow us to reduce the continuous-time inspection effort allocation problem to a combinatorial one. We suggest an efficient algorithm that solves the problem in 0(NM2 + N2) time.
AB - We address the problem of managing the intensity, sequence and timing of inspection effort in an N-stage production system with M inspection activities possible at each stage. The objective is to minimize the sum of the inspection costs and the penalties caused by undetected defects. By means of the maximum principle we prove several properties or the optimal solution, which allow us to reduce the continuous-time inspection effort allocation problem to a combinatorial one. We suggest an efficient algorithm that solves the problem in 0(NM2 + N2) time.
UR - http://www.scopus.com/inward/record.url?scp=85023822842&partnerID=8YFLogxK
U2 - 10.1080/07408170208928888
DO - 10.1080/07408170208928888
M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???
AN - SCOPUS:85023822842
SN - 0740-817X
VL - 34
SP - 515
EP - 527
JO - IIE Transactions (Institute of Industrial Engineers)
JF - IIE Transactions (Institute of Industrial Engineers)
IS - 6
ER -