Repeat inspection planning using dynamic programming

M. Elshafei*, M. Khan, S. O. Duffuaa

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

10 Scopus citations

Abstract

In this paper we propose a dynamic programming approach to the problem of determination of the inspection sequence of multi-characteristic critical components, and the number of repeat inspection for each characteristic. The model presented here considers the case of several classification of a product by an inspector. An inspector could classify a product as non-defective, to be reworked, or to be scrapped, with respect to a certain characteristic. The model accounts as well for possible misclassification by the inspector. The dynamic programming algorithm searches for a solution that minimizes the total cost of inspection per accepted component. The total cost includes the cost of false rejection of good items, the cost due to false acceptance of an item which is either reworkable or to be scrapped, the cost of inspection, and the cost of rework.

Original languageEnglish
Pages (from-to)257-270
Number of pages14
JournalInternational Journal of Production Research
Volume44
Issue number2
DOIs
StatePublished - 15 Jan 2006

Keywords

  • Beam search
  • Dynamic programming
  • Inspection planning
  • Product testing
  • Quality control

ASJC Scopus subject areas

  • Strategy and Management
  • Management Science and Operations Research
  • Industrial and Manufacturing Engineering

Fingerprint

Dive into the research topics of 'Repeat inspection planning using dynamic programming'. Together they form a unique fingerprint.

Cite this