Reliability allocation problem in a series–parallel system

https://doi.org/10.1016/j.ress.2004.10.007Get rights and content

Abstract

In order to improve system reliability, designers may introduce in a system different technologies in parallel. When each technology is composed of components in series, the configuration belongs to the series–parallel systems. This type of system has not been studied as much as the parallel–series architecture. There exist no methods dedicated to the reliability allocation in series–parallel systems with different technologies. We propose in this paper theoretical and practical results for the allocation problem in a series–parallel system. Two resolution approaches are developed. Firstly, a one stage problem is studied and the results are exploited for the multi-stages problem. A theoretical condition for obtaining the optimal allocation is developed. Since this condition is too restrictive, we secondly propose an alternative approach based on an approximated function and the results of the one-stage study. This second approach is applied to numerical examples.

Introduction

Reliability engineering attracts many researchers due to reliability's critical importance in a variety of systems. A considerable amount of work has been done for design problems with reliability requirements, and a variety of techniques have been used. As explained by Tzafestas in 1980 [1], one of the undeniable steps in the design of such multi-component systems is the problem of using the available resources in the most effective way so as to maximize the overall system reliability, or so as to minimize the consumption of resources while achieving specific reliability goals. The diversity of system structures, resource constraints, and options for reliability improvement has led to the construction and analysis of several optimization models [2]. Surveys on reliability optimization have regularly appeared (e.g. [1], [3], [4], [5]). One of the most recent publications on this subject is the book of Kuo et al. [6].

According to Kuo et al. [6], several investigations have been done for the optimization of parallel–series systems, but few are devoted to the series–parallel systems. Most of these works deal with redundancy allocation as the method developed by Jensen 1968 [7] for series–parallel–series networks using dynamic programming. He assumed that the studied systems are composed of blocks in series and each block is composed of identical technologies in parallel. Recently, Marquez and Coit [8] have proposed an heuristic for the redundancy allocation in multi-state series–parallel system. The new solution methodology that they proposed offers several distinct benefits compared to traditional formulations of this problem. Levitin et al. [9], [10], Zuo [11], Hoang Pham [12] and Venugopal [13] suggest solutions for more general redundancy optimization problem.

In this paper, we are interested in the reliability allocation problem in which the reliability of the components have to be determine in order to minimize the consumption of a resource under a reliability constraint, in a series–parallel systems. This problem arises when different technologies which have the same function are used in parallel.

Two resolution approaches for this problem are proposed, in the case of convex cost functions. First, we present a theoretical study, which is composed of two steps: the optimal resolution study of a one-stage problem and the one of the multi-stages problem. We obtain a convexity condition on the cost functions for guaranteeing the optimality of the global solution. Unfortunately, this theoretical condition is a too restrictive for being applied. Then, alternatively, an approximation resolution method is proposed. This approach provides an approximated reliability allocation to each technology. Then, the reliability allocation for each of them is realized with the results on the one-stage theoretical study. This paper is organized as follows. In Section 2, we present the problem description, with the assumptions and mathematical formulation. Section 3 is dedicated to the theoretical study of a one-stage problem. The optimality condition for the multi-stages problem is developed in Section 4. We show that this theoretical condition is too restrictive. Section 5 is dedicated to the approximation resolution method. Section 7 describes the numerical experiments for investigating the performances of this second approach.

Section snippets

Problem description

A series–parallel system is composed of k subsystems in parallel, where each subsystem i (i=1,…,k) is composed of ni components in series (Fig. 1). The reliability of the system isRs=1i1k(1j=1nirij)with rij, the reliability of the jth component of subsystem i (i=1,…,k and j=1,…,ni). We assume that cij is the cost associated to rij with cij=fij(rij). Then, the total cost of the system is:Cs=i=1kCi=i=1kj=1nifij(rij)

We assume that the decision variables rij may be any real value between 0

Theoretical study of the one-stage problem

In this section, we assume that we know the reliability target Ri for the technology i (i=1,…,k). We develop the optimal resolution of the one stage problem corresponding to the technology. Then, this subproblem i is to find the reliability allocation of the ni components in a series structure. The model is:(M2)minj=1nifij(rij)

j=1nirij=Ri

0<rij<1j=1,,ni

We introduce a substitution of variable: yij=ln(rij) which is equivalent to rij=exp(yij). We define the function hij(yij)=fij(rij). Then, we

Theoretical study of the multi-stage problem

We propose in this section a theoretical study of the multi-stage problem. We obtain a convexity condition that must stratify the cost function. We show that this condition is too restrictive.

The approximation method

Since we are unable to exploit the convexity condition of Section 4, we propose in this section an alternative approximation method in order to obtain reliability allocation for each technology.

We define Zi=ln(Ri), for i=1,…,k. Then, we have the cost function of subsystem i, in function of the reliability level Zi required which is hi(Zi)=minj=1nihij(yij(Zi)) so that yij(Zi)=hij1(A(Zi)) and j=1niyij(Zi)=Zi. The global problem is:(M5)mini=1khi(Zi)

1i=1k(1exp(Zi))=Rmin

Zi];0[i=1,,s

We

Numerical experiment

We propose in this section a detailed example for the approximation method in the Truelove case and several numerical experiments.

Conclusion

Reliability allocation in series–parallel systems is one of the less studied problems in reliability optimization. We have proposed in this paper a study of this reliability allocation problem. First, we have developed the optimal resolution of a one stage-problem, assuming the cost functions satisfy a convexity condition. Then, we have established a convexity condition on the component cost functions in order to obtain the global optimal solution. We have considered two of the most used cost

Acknowledgements

We are grateful to the Associate Editor and the referee for their constructive comments and suggestions which led to an improvement of the paper.

References (15)

  • S.G. Tzafestas

    Optimization of system reliability: a survey of problems and techniques

    Int J Syst Sci

    (1980)
  • W. Kuo et al.

    An annotated overview of system reliability optimization

    IEEE Trans Reliab

    (2000)
  • F.A. Tillman et al.

    Optimization techniques for systems reliability with redundancy

    IEEE Trans Reliab

    (1977)
  • F.A. Tillman et al.

    Optimization of systems reliability

    (1980)
  • K. Misra

    On optimal reliability design: a review

    Syst Sci

    (1986)
  • W. Kuo et al.

    Optimal reliability design: fundamentals and applications

    (2001)
  • P.A. Jensen

    Optimization of series–parallel–series networks

    Oper Res

    (1970)
There are more references available in the full text version of this article.

Cited by (110)

  • Optimal tasks assignment policy in multi-task multi-attempt missions

    2024, Reliability Engineering and System Safety
  • Universal redundancy strategy for system reliability optimization

    2022, Reliability Engineering and System Safety
  • Redundancy strategies assessment and optimization of k-out-of-n systems based on Markov chains and genetic algorithms

    2022, Reliability Engineering and System Safety
    Citation Excerpt :

    However, due to the paper length limitations and CPU time comparison with reported in literature, a general form of series parallel system, which can be extended to any example and has been used in literature, is considered. The benchmark problem is a 14-subsystem series-parallel system created by Fyffe et al. [27] and used by several researchers [9,12,15,28-30]. Each subsystem has multiple choices of components available but only one type can be chosen.

  • Modelling and estimation of system reliability under dynamic operating environments and lifetime ordering constraints

    2022, Reliability Engineering and System Safety
    Citation Excerpt :

    In fact, the dependent or correlated component failures have been observed in a variety of application areas including the software system [3], the distributed computing system [4], the medical system [5], and the network system [6]. The second assumption commonly adopted in the RBD procedure is that the components are operating under the time-invariant environment (e.g., [7; 8; 9]]). Nevertheless, this assumption is neither appropriate in practice as the operating environmental conditions are inevitably changing over time.

View all citing articles on Scopus
View full text