An Optimal Design of Reliability Test Plans for a Parallel System Using Integer Programming

DOI : 10.17577/IJERTV2IS100289

Download Full-Text PDF Cite this Publication

Text Only Version

An Optimal Design of Reliability Test Plans for a Parallel System Using Integer Programming

Mahesh Kumar* Department of Mathematics

National Institute of Technology Calicut India

*Corresponding author Amrutha P

Department of Mathematics National Institute of Technology Calicut India

Abstract: Consider a problem of acceptance testing for a parallel system with independent components having constant but unknown failure rates. The components are individually tested and the tests are terminated as soon as the pre-assigned numbers of components fail. In this paper, we obtain a reliability test plan based on unbiased estimator of component failure rates which leads to minimum testing cost and satisfying the usual probability requirements. Further, we solve a resulting nonlinear integer optimization problem. Finally, we illustrate our approach through numerical examples.

Keywords: Parallel System, System Reliability, Component testing, Cost minimization, Optimization, Type I and Type II errors, Integer programming.

Biographical Notes: Mahesh Kumar received his Ph.D. from Indian Institute of Technology Bombay, India. Presently he is working as Assistant Professor, in the Department of Mathematics, National Institute of Technology Calicut, India. His research interests include reliability theory, non-linear optimization, estimation and design of reliability test plans, software reliability, and financial mathematics. You can contact him through

Amrutha P is a M.Sc. (Tech) graduate in Mathematics and Scientific Computing, from National Institute of Technology Calicut, India. Presently, she is working as lecturer in Mathematics in Mar Baselios College of Engineering & Technology, Peermade, Kerala, India.

1Introduction

Manufacturers of the products want to test their products for reliability to make sure that it lasts for longtime. They need simple and cost effective technique to test the reliability. Rajgopal and Mazumdar (1996) obtained reliability test plans for series system based on Type II censoring. This work led to the conclusion that all components has to be tested equally. Rajagopal and Mazumdar (1988) examined component testing procedure that provides a criterion for accepting or rejecting the parallel system based on sum of the logarithms on the total times on test for each component and it needs several approximation procedures for obtaining the parameters for the test plan, and in general, the methods discussed were difficult for implementation for testing the system with more than two components. Emre Yamangil et al. (2011) discuss the system reliability test plans by considering the system performance measures, namely, MTTF and system availability concepts. However, the problem of testing the reliability of parallel system with more than two components remained complicated under the assumptions mentioned in Section 2.

In this paper, we consider a parallel system consisting of n independent components with constant and unknown failure rates. Under the assumptions made in Section 2, we obtain the data from Type- II censoring, that is, a predetermined number of each type of component is tested to failure with replacement after each failure. We describe a procedure to develop an optimal reliability test plan based on the unbiased estimator of failure rates of components. These procedures are simpler than thosediscussed in Rajgopal and Mazumdar (1988), and it can be applied to a general n component parallel system. We obtain the optimal reliability test plans by solving a nonlinear integer optimization problem. Finally, we design a general algorithm for n component parallel system and implement it in LINGO software which will give the optimal value of the test plan. Further, we illustrate our procedure for a 3component parallel system.

This paper is organized as follows. In Section 2, we give a set of assumptions needed to develop the solution of the problem. In Section 3, we formulate the problem and find an unbiased estimator of failure rate and hence the estimate for system reliability. We use well-known delta method (see, Rajgopal and Mazumdar (1997)) for obtaining the distribution of test statistic. In Section 4, we give algorithm to solve non-linear integer optimization problem and discuss some numerical examples to illustrate our approach. In Section 5, we give conclusions and discuss the scope for further research.

  1. Assumptions

    We make the following assumptions before the problem formulation.

    1. The system representation has n independent components in parallel.

    2. The failure rate of the component i is exponentially distributed random variable with unknown constant failure rate i , 1 i n.

    3. During the testing, whenever a component fails, we replace it immediately by an i.i.d.

      component.

    4. The interfaces within the system are perfect and no need to test them and the system is highly reliable.

    5. The failure rate of each individual component is small, so that the system reliability R(t) for t

      units of time, can be approximated by

      n

      n

      R(t) 1 it.

      i1

      Under the above assumptions, the expression for reliability estimate of the parallel system with

      n independent components , for a mission time of one unit, is given by

      Rs 1 ,

      Rs 1 ,

      n

      i

      where i

      i 1

      is an unbiased estimate of failure rate to be obtained later.

      Note that Assumptions (d) and (e), can be seen in Rajgopal and Mazumdar (1997).

  2. Problem Formation

    1. An unbiased estimator of failure rates.

      We test thei-th component for ki number of times. Let

      X i denote lifetime of the i-th component.

      Let Ti be defined by

      ki

      Ti X i ,

      i 1

      which is the total of

      ki failure times. Then

      if Xi ~ exp(i ) , Ti ~ G(ki , i ).

      We see that

      E( 1 ) i

      Ti ki 1

      ki 1

      i E

      Hence

      ^

      .

      Ti

      i

      i

      ki 1,1 i n.

      Ti

      Thus

      i is an unbiased estimator of i, 1 i n.

      Suppose that ci is the cost of testing the i-th component for unit time period, then our objective is to solve the following non-linear optimization Problem P:

      n

      n

      min ciki such that

      i1

      Pr {accept system | R(1) R0 } ,

      Pr {reject system |R(1) R1 } ,

      where R(1) is the reliability of the system for unit time, and 0 <R0<R1< 1, +< 1. Here we call ROas lower bound probability for rejecting the system, and R1 the lower bound probability for accepting the system. That is, when R(1) R0we reject the system and in this case, the system is bad. Also when R(1) R1 we accept the system and in this case, the system is good.

      The test procedure is to Rejectthe system if Rs B, and accept otherwise, whereB is the

      n

      i

      i

      constant to be determined later and Rs 1 .

      i1

      We have the following two cases

      Case1. R s B. Here we have

      n ki 1

      1

      i1

      B

      Ti

      n ki 1

      That is iff

      i1

      d.

      Ti

      Case2. Rs B. Then we have

      n ki 1

      i1 Ti

      d , where 1 B d.

      n ki 1

      Since the system is highly reliable, th acceptance rule becomes

      i1

      d , where d (0,1).

      Ti

      Also note that

      n ki 1

      n k 1

      d ln i ln d

      i1 Ti i1 Ti

      n ki 1

      ln T M ,

      where M ln d.

      i1 i

      That is,

      n ki 1

      T ln T M .

      (3.1)

      i1 i

      This gives the alternate rule of acceptance of the system. The value of M will be determined in next section.

    2. Distribution of the test statistics using delta method

      We have Ti

      N ( ki

      i

      , ki ).

      2

      2

      i

      T

      T

      Let g(T ) ln( ki 1 , T N ( ki , ki ) . Let ki . Then by well-known delta method, we have

      i ) i 2

      i i i i

      g(T ) N(g(), (g ' ())2 V (T )),

      i

      T

      T

      i

      i

      g ' (T ) 1 . Thus

      i

      i

      g ' () i .

      ki

      and

      k

      k

      (g ' ())2 V (T ) 1 .

      i

      i

      i (ki 1) 1

      Now g(Ti ) N ln k , k .

      i i

      Using Lindebergcentral limit theorem, we have

      n n i (ki 1) n 1

      g(T ) g(Ti ) ~ N ln

      k , k

      , and

      i 1

      g(T ) T

      i 1

      i i 1

      i

      i (ki 1) 2 1

      2

      2

      Z ~ N (0,1), where T T

      ln

      ki

      and

      T .

      k

      k

      i

    3. Solution of the problem P

    LetZ~N(0,1)be standard normal random variable. Thenusing the rule stated above in equation (3.1), the probability of acceptance of the system becomes

    Pr {accept the system | R(1) R0 }

    M T n

    PrZ | 1 i Ro

    T i1

    PrZ M T | n ln ln(1 R ) ,

    i 0

    T i 1

    and

    Pr {reject the system | R R1 } which is equivalent to Pr {accept the system | R(1) R1 } 1 ,

    becomes

    PrZ M T | n ln ln(1 R ) 1 .

    i 1

    T i1

    Then the Problem P becomes Problem P1 as under:

    n

    n

    min ci ki

    i i1

    n

    n

    max PrZ M T | ln ln(1 R )

    i 0

    i T i1

    min PrZ M T |

    n

    ln

    ln(1 R ) 1 .

    i

    i 1

    T i1

    Let z

    be the cumulative distribution function of the standard normal random variable.Note

    that it is strictly increasing function in its argument. So the Problem P1 can be rewritten as Problem P2 as

    n

    n

    min ciki

    i i1

    such that

    M T n

    max | ln i ln(1 R0 ) Z

    i T

    i1

    M T n

    min | ln i ln(1 R1 ) Z1 .

    i T

    i1

    After substituting for µT and T, the Problem P2 becomes Problem P3:

    n

    n

    min ciki

    i i1

    such that

    n i (ki 1)

    M ln k n

    i 1 i

    max |

    max |

    ln

    ln(1 R ) Z

    n

    n

    i

    1 ki i 1

    i

    i 1

    0

    n i (ki 1)

    M ln k n

    i 1 i

    min |

    min |

    ln

    ln(1 R ) Z .

    n

    n

    i

    1 ki i 1

    i

    i 1

    1 1

  3. An Algorithm to solve Problem P3

    1. An algorithm

      1. Initialize

        j 0, n n0 , R0 , R1,, , d (0,1).

        n

        n

        i i 0

      2. Initialize ( j ) such that ( j ) 1 R in

        i1

        n ( j ) (k ( j ) 1)

        ln d ln( i i )

        i1

        k ( j ) n

        L i | ( j ) 1 R Z

        n

        n

        1

        i1

        1

        k

        k

        ( j )

        i

        i 0

        i1

        n

        n

        and ( j ) 1 R in

        i

        i1

        1

        n ( j ) (k ( j ) 1)

        ln d ln( i i )

        i1

        k ( j ) n

        L i | ( j ) 1 R

        Z

        n

        n

        2

        i1

        1

        k

        k

        ( j )

        i

        i

        i1

        1 1

        n

        n

      3. If the problem is feasible, find the value of k ( j ) and calculate C ( j ) c k ( j ) , then go to

        Step4. Else

        i

        j j 1 and go to Step 2.

        i i

        i1

      4. Compare the cost C ( j ) C ( j1) then declare C ( j ) as the minimum cost and go to Step 5.

        Otherwise go to Step 2 and repeat the procedure.

      5. Stop the algorithm.

    2. Numerical Examples

    To illustrate the above algorithm, we consider a 3-component parallel system. In Table 1, the

    first and second column give various values of

    R0 , and . R1. The Z values are obtained from

    statistical table.The third column gives the number of times each component to be tested. The last column gives the minimum cost. Here we are considering the initial cost vector as C= (120,180,150). The value of d chosen in (0, 1) was 0.3.

    Table 1

    R0

    R1

    k1 , k2 , k3

    Minimum total cost($)

    0.82

    0.90

    2,3,3

    1230

    0.86

    0.92

    2,2,2

    0900

    0.87

    0.93

    3,3,4

    1500

    0.95

    0.99

    3,2,3

    1170

    From Table 1, we conclude that to achieve the reliability of 0.93, one has to test the first component three times, second component three times and the third component four times, and this plan incurs the minimum cost of $ 1500. Note that in case of series system, one has to test all components equally under Type II censoring(Rajgopal and Mazumdar (1996)) But, here we see that components need not be tested equally.

    Table 2

    R0

    R1

    k1 , k2 , k3

    Minimum total cost($)

    0.80

    0.90

    3,3,2

    34

    0.81

    0.95

    3,2,2

    30

    0.88

    0.99

    2,2,2

    28

    In Table 2, we have taken the initial cost C = (2, 4, 8). We tested for various values of

    R0 and

    R1 . To get a reliability of 0.90, one has to test the first and second components three times, third component only two times.The value of d chosen in (0,1) was 0.025. The cost incurred is $ 34.

    Table 3

    R0

    R1

    k1 , k2 , k3 , k4

    C= (100,120,160,180)

    Minimum total cost ($)

    0.80

    0.95

    5,4,3,3

    2000

    0.82

    0.97

    5,4,4,4

    2340

    0.82

    0.98

    5,4,4,4

    2340

    Table 4

    R0

    R1

    k1 , k2 , k3 , k4

    C= (100,120,160,180)

    Minimum total cost ($)

    0.88

    0.99

    3,3,3,2

    1500

    0.85

    0.98

    p>4,2,2,2

    1320

    0.87

    0.99

    4,3,2,2

    1440

    In Table 3, d =0.3 and =0.05, and in Table 4, d=0.3 = 0.01.

  4. Conclusions and scope for further research

In this work, we have considered a parallel system consisting of n independent components with constant and unknown failure rates. In previous works in the literature, the reliability estimates are not based on unbiased estimators, except for few works. Also in this case, problem was difficult to solve for parallel system with more than 2 components. For a 3-component system, we have solved a nonlinear integer optimization problem using LINGO software. We note here that the number of components of each type to be tested is not equal when we have data from Type II censoring. Also the algorithm developed can be applied for any general n- component system. We have made an attempt to design a reliability test plan for a parallel system, which uses unbiased estimator for estimating the failure rate of components. This is essential part in reliability testing. However, there is a wide scope for developments in this area. For example, one can try to work with Weibull distribution as underlying distribution for lifetimes, where one can assume both parameters unknown and can try to estimate them from data.

References

Mazumdar, M. (1977).An optimum procedure for component testing in the demonstration of series system reliability, IEEE Transactions on Reliability, Vol. R-26, pp. 342-345.

Orhan Feyzioglu, I. K. Altinel, S. Ozekici (2006). The design of optimum component test plans for system reliability, Computational statistics and data analysis, 50, pp. 3099-3112.

Rajagopal, J and Mazumdar,M.(1988). A type II censored, log test time based, componenttesting Procedure for a parallel system, IEEE Transactions on Reliability,Vol. R-37, No. 4, pp. 406-412.

Rajagopal, J and Mazumdar,M. (1996).A system based component test plan for a series system with type II censoring, IEEE Transactions on Reliability, Vol. 45, pp. 375-378.

Rajagopal, Jand Mazumdar,M. (1997).Minimum cost component test plans for evaluating reliability of highly reliable parallel system, Naval Research Logistics, Vol. 44, 401-418.

Rao, S.S. (1996) Engineering optimization, (3/e), John Wiley & Sons, Inc, New York.

Yan, J.H. and Mazumdar,M. (1986).A comparison of several component testing plans for a series system, IEEE Transactions on Reliability, Vol. R-35, pp. 437-443.

Yan, J.H. and Mazumdar, M.(1987).A component testing procedure for a parallel with type II censoring, IEEE Transactions on Reliability, Vol. R-36, pp. 425-428.

Yamangil, E, Altnel, I.K., Çekyay, B., Feyziog, O., andÖzekici, S.(2011).Design of optimum component test plans in the demonstration of diverse system performance measures,IIE Transactions, Vol. 43, Issue 7, pp. 535-546.

Leave a Reply