Optimal sequencing of inspection of dependent characteristics

We address the problem of sequentially inspecting the dependent characteris tics of a product, where the dependency is expressed in terms of the joint probabilities of the fitness of the characteristics. We show that, even whe n the inspection has classification errors, the joint probability mass func tion of the observed fitness of the characteristics is independent of the s equence of inspection. Using this result, a dynamic programming approach is presented for finding the optimal sequence that minimizes the expected tot al cost of inspection. Previously reported policies for independent charact eristics are shown to be special cases of the results presented here.