A Polynomial-Time Approximation Scheme for Sequential Batch Testing of Series Systems
SSRN, ISSN: 1556-5068
2018
- 1Citations
- 898Usage
Metric Options: Counts1 Year3 YearSelecting the 1-year or 3-year option will change the metrics count to percentiles, illustrating how an article or review compares to other articles or reviews within the selected time period in the same journal. Selecting the 1-year option compares the metrics against other articles/reviews that were also published in the same calendar year. Selecting the 3-year option compares the metrics against other articles/reviews that were also published in the same calendar year plus the two years prior.
Example: if you select the 1-year option for an article published in 2019 and a metric category shows 90%, that means that the article or review is performing better than 90% of the other articles/reviews published in that journal in 2019. If you select the 3-year option for the same article published in 2019 and the metric category shows 90%, that means that the article or review is performing better than 90% of the other articles/reviews published in that journal in 2019, 2018 and 2017.
Citation Benchmarking is provided by Scopus and SciVal and is different from the metrics context provided by PlumX Metrics.
Example: if you select the 1-year option for an article published in 2019 and a metric category shows 90%, that means that the article or review is performing better than 90% of the other articles/reviews published in that journal in 2019. If you select the 3-year option for the same article published in 2019 and the metric category shows 90%, that means that the article or review is performing better than 90% of the other articles/reviews published in that journal in 2019, 2018 and 2017.
Citation Benchmarking is provided by Scopus and SciVal and is different from the metrics context provided by PlumX Metrics.
Article Description
We study a recently-introduced generalization of the classic sequential testing problem for series systems, consisting of multiple stochastic components. The conventional assumption in such settings is that the overall system state can be expressed as a boolean function, defined with respect to the states of individual components. However, unlike the classic setting, rather than testing components separately, one after the other, we allow aggregating multiple tests to be conducted simultaneously, while incurring an additional set-up cost. This feature is present in many practical applications, where decision-makers are incentivized to exploit economy of scale by testing subsets of components in batches. The main contribution of this paper is to devise a polynomial-time approximation scheme (PTAS) for the sequential batch testing problem, thereby significantly improving on the constant-factor performance guarantee of 6.829 eps due to Daldal et al. [Naval Research Logistics, 63(4):275-286, 2016]. Our approach is based on developing and leveraging a number of innovative techniques in approximate dynamic programming, based on a synthesis of ideas related to efficient enumeration methods, state-space collapse, and charging schemes. These theoretical findings are complemented by extensive computational experiments, where we demonstrate the practical advantages of our methods.
Bibliographic Details
http://www.scopus.com/inward/record.url?partnerID=HzOxMe3b&scp=85115565531&origin=inward; http://dx.doi.org/10.2139/ssrn.3277805; https://www.ssrn.com/abstract=3277805; https://dx.doi.org/10.2139/ssrn.3277805; https://papers.ssrn.com/sol3/papers.cfm?abstract_id=3277805; https://ssrn.com/abstract=3277805
Elsevier BV
Provide Feedback
Have ideas for a new metric? Would you like to see something else here?Let us know