A branch and bound algorithm for minimizing the expected cost of testing coherent systems

DOI10.1016/0377-2217(81)90350-7zbMath0466.90031OpenAlexW2042679375MaRDI QIDQ1155505

Yosi Ben-Dov

Publication date: 1981

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(81)90350-7

zbMATH Keywords

decision treebranch and bound algorithmcoherent systemsmulti-component systemreliability importanceoptimal testing policyimportance of componentsminimizing the expected cost

Mathematics Subject Classification ID

Applications of statistics in engineering and industry; control charts (62P30) Applications of mathematical programming (90C90) Reliability, availability, maintenance, inspection in operations research (90B25)

Related Items (3)

Sequential testing of complex systems: a review ⋮ Heuristic least-cost computation of discrete classification functions with uncertain argument values ⋮ Heuristic testing procedures for general coherent systems

Cites Work

• Technical Note—Fault Testing for a k-out-of-n System
• An Algorithm for the Traveling Salesman Problem
• Conversion of Limited-Entry Decision Tables to Optimal Computer Programs I: Minimum Average Processing Time
• Some Reliability Fault-Testing Models
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A branch and bound algorithm for minimizing the expected cost of testing coherent systems