On the computational complexity of reliability redundancy allocation in a series system

On the computational complexity of reliability redundancy allocation in a series system

0.00 Avg rating0 Votes
Article ID: iaor19931158
Country: Netherlands
Volume: 11
Issue: 5
Start Page Number: 309
End Page Number: 315
Publication Date: Jun 1992
Journal: Operations Research Letters
Authors:
Keywords: computational analysis
Abstract:

Finding the optimal redundancy that maximizes the system reliability is one of the important problems in reliability theory. A good deal of effort has been done in this field. This paper proves that some reliability redundancy optimization problems are NP-hard. It also derives alternative proofs for the NP-hardness of some special cases of the knapsack problem.

Reviews

Required fields are marked *. Your email address will not be published.