Repeat inspection planning using dynamic programming

• Published in: International journal of production research Vol. 44; no. 2; pp. 257 - 270
• Main Authors: Elshafei, M., Khan, M., Duffuaa, S. O.
• Format: Journal Article
• Language: English
• Published: London Taylor & Francis Group 15.01.2006; Washington, DC Taylor & Francis; Taylor & Francis LLC
• Subjects: Algorithms; Applied sciences; Beam search; Dynamic programming; Exact sciences and technology; Inspection planning; Inspections; Mathematical programming; Operational research and scientific management; Operational research. Management science; Operations research; Product testing; Production planning; Quality control; Studies; Inspection planning; Beam search; Quality control; Inspection; Planning; Dynamic programming; Product testing; Mathematical model; By product; Search algorithm
• ISSN: 0020-7543; 1366-588X
• DOI: 10.1080/13528160500245749

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.