Optimal screening procedures for items with a random number of defects

Abstract In this paper, we study optimal screening procedures for items with random number of defects. Each defect that causes an item’s failure during this screening procedure is repaired/removed. Upon observing the numbers of removed defects, a decision is made whether to discard an item or to justify its future field operation. It is shown that these decisions depend on the distribution of the number of defects in an item. Three discrete distributions are considered: negative binomial, Poisson and binomial. It is shown, e.g., for the negative binomial case, that screening out of items with any number of removed defects improves the quality of remaining items. On the other hand, for the Poisson distribution of defects, there is no need to screen out items, as the distribution of the number of remaining defects does not depend on the number of the removed defects. The optimal screening policies to minimize the corresponding expected cost functions for each case are analyzed. The numerical illustrations of the obtained results are provided. Through the numerical examples, it is shown that the optimal screening policy significantly differs depending on the distribution of the number of defects in an item as well as the involved costs.

Authors

Institutions

Publication Details

Journal
IMA Journal of Management Mathematics
Published
2026-03-03
DOI
https://doi.org/10.1093/imaman/dpag012
Primary Topic
Reliability and Maintenance Optimization
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Optimal screening procedures for items with a random number of defects

Ji Hwan, Maxim Finkelstein
IMA Journal of Management Mathematics
Reliability and Maintenance Optimization
article

Optimal screening procedures for items with a random number of defects

Ji Hwan, Maxim Finkelstein
article en

Abstract

Abstract In this paper, we study optimal screening procedures for items with random number of defects. Each defect that causes an item’s failure during this screening procedure is repaired/removed. Upon observing the numbers of removed defects, a decision is made whether to discard an item or to justify its future field operation. It is shown that these decisions depend on the distribution of the number of defects in an item. Three discrete distributions are considered: negative binomial, Poisson and binomial. It is shown, e.g., for the negative binomial case, that screening out of items with any number of removed defects improves the quality of remaining items. On the other hand, for the Poisson distribution of defects, there is no need to screen out items, as the distribution of the number of remaining defects does not depend on the number of the removed defects. The optimal screening policies to minimize the corresponding expected cost functions for each case are analyzed. The numerical illustrations of the obtained results are provided. Through the numerical examples, it is shown that the optimal screening policy significantly differs depending on the distribution of the number of defects in an item as well as the involved costs.

IMA Journal of Management Mathematics
Ewha Womans University (KR), University of Strathclyde (GB), University of the Free State (ZA)
Peace, Justice and strong institutions
Openalex Percentile: Top 38%
Reliability and Maintenance Optimization
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Optimal screening procedures for items with a random number of defects — Ji Hwan, Maxim Finkelstein · IMA Journal of Management Mathematics (2026) | TGRS Research Map | TGRS