کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
383214 | 660808 | 2013 | 10 صفحه PDF | دانلود رایگان |
![عکس صفحه اول مقاله: Sequential testing policies for complex systems under precedence constraints Sequential testing policies for complex systems under precedence constraints](/preview/png/383214.png)
We study the problem of sequentially testing the components of a multi-component system to learn the state of the system, when the tests are subject to precedence constraints and with the objective of minimizing the expected cost of the inspections. Our focus is on k-out-of-n systems, which function if at least k of the n components are functional. A solution is a testing policy, which is a set of decision rules that describe in which order to perform the tests. We distinguish two different classes of policies and describe exact algorithms (one branch-and-bound algorithm and one dynamic program) to find an optimal member of each class. We report on extensive computational experiments with the algorithms for representative datasets.
► We study sequential testing of k-out-of-n systems under precedence constraints.
► We propose exact algorithms for computing optimal inspection policies.
► We distinguish different classes of policies and find an optimal member in each class.
► We report on extensive computational experiments with the algorithms for representative datasets.
Journal: Expert Systems with Applications - Volume 40, Issue 2, 1 February 2013, Pages 611–620