Optimal Parallel Inspection for Finding the First Nonconforming Unit in a Batch—An Information Theoretic Approach
用信息论方法解决在已知失效概率分布的生产批次中，以最小成本找到首个不合格品的问题，提出了确定检验哪些单元及同时送检数量的算法，并与动态规划等优化方法对比验证。
We consider the case of a batch of discrete units produced by a process subject to failures under a known probability distribution function, and apply information theory to the problem of finding the first nonconforming unit in the batch at minimum cost. Two distinct but related aspects of this problem were treated: determining which units should be inspected, and determining how many units should be sent for inspection at the same time. The solution is based on the principles of inspecting the product units that maximize the reduction in the uncertainty regarding the location of the first nonconforming unit, and of minimizing the cost per unit of uncertainty reduced. These principles are formalized by means of a series of theorems leading to an easy-to-implement algorithm for managing parallel inspection. This approach is successfully compared with the optimal solution obtained with dynamic programming and with other heuristics.