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

Authors:
Maw-Sheng Chern
Affiliations:
Department of Industrial Engineering, National Tsing Hua University, Hsinchu, Taiwan, ROC
Venue:
Operations Research Letters
Year:
1992

Citing 1
Cited 18

Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness

A knowledge management system for series-parallel availability optimization and design

Expert Systems with Applications: An International Journal
A two-stage discrete particle swarm optimization for the problem of multiple multi-level redundancy allocation in series systems

Expert Systems with Applications: An International Journal
A GA based penalty function technique for solving constrained redundancy allocation problem of series system with interval valued reliability of components

Journal of Computational and Applied Mathematics
An efficient heuristic for reliability design optimization problems

Computers and Operations Research
Immune algorithms-based approach for redundant reliability problems with multiple component choices

Computers in Industry - Special issue: Application of genetics algorithms in industry
A preference ordered classification for a multi-objective max-min redundancy allocation problem

Computers and Operations Research
Alternative design redundancy allocation using an efficient heuristic and a honey bee mating algorithm

Expert Systems with Applications: An International Journal
Penalty guided bees search for redundancy allocation problems with a mix of components in series-parallel systems

Computers and Operations Research
A bi-objective model to optimize reliability and cost of system with a choice of redundancy strategies

Computers and Industrial Engineering
GORA: an algorithm for designing optical cross-connect nodes with improved dependability

Computer Communications
Optimal cyclic replacement policy in MSS maintenance via Binomial-PSO

Proceedings of the 14th annual conference on Genetic and evolutionary computation
Annealing-based particle swarm optimization to solve the redundant reliability problem with multiple component choices

Applied Soft Computing
Efficient immune algorithm for optimal allocations in series-parallel continuous manufacturing systems

Journal of Intelligent Manufacturing
Multilevel redundancy allocation using two dimensional arrays encoding and hybrid genetic algorithm

Computers and Industrial Engineering
A New Multiple Objective Evolutionary Algorithm for Reliability Optimization of Series-Parallel Systems

International Journal of Applied Evolutionary Computation
Exact cost minimization of a series-parallel reliable system with multiple component choices using an algebraic method

Computers and Operations Research
Original article: Cost minimization of butter-oil processing plant using artificial bee colony technique

Mathematics and Computers in Simulation
A PSO algorithm for constrained redundancy allocation in multi-state systems with bridge topology

Computers and Industrial Engineering

Quantified Score

Hi-index	0.01

Visualization

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. In this paper, we prove that some reliability redundancy optimization problems are NP-hard. We also derive alternative proofs for the NP-hardness of some special cases of the knapsack problem.