.png){kind=icon}
返回
Sequential testing policies for complex systems under precedence constraints
.png){kind=icon}
OA
AI
DOI：10.1016/j.eswa.2012.07.060.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
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. (C) 2012 Elsevier Ltd. All rights reserved.
Keyword:
Sequential testing
Precedence constraints
Branch and bound
Dynamic programming
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7.5
论文数:
3.0W
被引数:
10.2W
机构
引用论文
.png){kind=icon}
分享收藏
查看更多内容