Optimal allocation of inspection effort over a finite planning horizon

Research output: Contribution to journalArticlepeer-review

18 Scopus citations


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 of 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 O(NM2 + N2) time.

Original languageEnglish
Pages (from-to)515-527
Number of pages13
JournalIIE Transactions (Institute of Industrial Engineers)
Issue number6
StatePublished - Jun 2002


Dive into the research topics of 'Optimal allocation of inspection effort over a finite planning horizon'. Together they form a unique fingerprint.

Cite this