In this research, a new control policy for the acceptance sampling problem is introduced. Decision is made based on the number of defectives items in an inspected batch. The objective of the model is to find a constant control level that minimizes the total costs, including the cost of rejecting the batch, the cost of inspection and the cost of defective items. The optimization is performed by...

In the classical combinatorial (adaptive) group testing problem, one is given two integers d and n, where 0 ≤ d ≤ n, and a population of n items, exactly d of which are known to be defective. The question is to devise an optimal sequential algorithm that, at each step, tests a subset of the population and determines whether such subset is contaminated (i.e. contains defective items) or otherwis...

The original problem of group testing consists in the identification defective items a collection, by applying tests on groups that detect presence at least one element group. aim is then to identify all collection with as few possible. This relevant several fields, among which biology and computer sciences. In present article we consider applied returns load , measuring how most item is. this ...

We study practically efficient methods for performing combinatorial group testing. We present efficient non-adaptive and two-stage combinatorial group testing algorithms, which identify the at most d items out of a given set of n items that are defective, using fewer tests for all practical set sizes. For example, our two-stage algorithm matches the information theoretic lower bound for the num...

We study practically efficient methods for performing combinatorial group testing. We present efficient non-adaptive and two-stage combinatorial group testing algorithms, which identify the at most d items out of a given set of n items that are defective, using fewer tests for all practical set sizes. For example, our two-stage algorithm matches the information theoretic lower bound for the num...