Article ID: | iaor19941309 |
Country: | Netherlands |
Volume: | 33 |
Start Page Number: | 109 |
End Page Number: | 199 |
Publication Date: | Jan 1994 |
Journal: | International Journal of Production Economics |
Authors: | Lin Tsong-Ming, Liou Ming-Jong, Tseng Sheng-Tsaing |
Keywords: | programming: branch and bound |
Multiple inspections are necessary in some important areas of production systems. The quality of a product is enhanced by the inspections of a sequence of inspectors. Based on a cost-minimization model, Raz and Thomas proposed in 1983 a branch-and-bound method to determine the optimal sequence subject to inspection errors. Although their model is quite practical, the suggested branch-and-bound solution does not seem to be so attractive. By modifying their cost model slightly, under some regular conditions, the authors derived an analytic solution to determine the optimal number of inspectors and the optimal sequence of inspectors.