Allocation of Screening Inspection Effort--A Dynamic-Programming Approach

Glenn F. Lindsay and Albert B. Bishop
Additional contact information
Glenn F. Lindsay: The Ohio Slate University, Columbus
Albert B. Bishop: The Ohio Slate University, Columbus

Management Science, 1964, vol. 10, issue 2, 342-352

Abstract: A general screening inspection program is developed in which inspection levels and the locations of inspection points are treated as variables. It is shown that the function representing the total of inspection and scrap costs will be minimized by an extreme-point solution, thus the minimum-cost inspection program will lie in a relatively restricted subset of all possible allocations. Application of a computational procedure based on dynamic-programming allows the minimum-cost program to be readily determined for instances in which the requirement for inspection is the maintenance of a specified quality level or when a linear cost may be associated with outgoing defective material.

Date: 1964
References: Add references at CitEc
Citations: View citations in EconPapers (6)

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.10.2.342 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:ormnsc:v:10:y:1964:i:2:p:342-352

Access Statistics for this article

More articles in Management Science from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().