Title
A fast algorithm for repair-depot reliability-evaluation
Keywords
Numerical analysis; Reliability computation; Supportability turnaround time
Abstract
Conclusions -The repair-depot (where failed items are replaced with spares and scheduled for repair) systemreliability (RDSR) is the probability that spares are immediately available to replace failed units during the time period of interest, and it is calculated in terms of the constant failure rate for parts under consideration, the number of spare units on-hand (s). and projected repair completion dates for (n -1) units in the repair process, n > 2. Linton et al (1995) show an expression for RDSR in terms of n nested sums, where the upper limit of each sum is a function of s. This paper derives a restructured expression (LKYH algorithm) for computing RDSR, and shows that the nested-sum form for RDSR uses O(s") mathematical operations^while LKYH requires only O(s) mathematical operations. Numerical examples illustrate the increase in efficiency of LKYH; eg, when n = s=10, the execution time for computing RDSR on a 486/66-computer is reduced from 198 seconds for the multiple-sum form to less than 1 second for LKYH. ©1996 IEEE.
Publication Date
12-1-1996
Publication Title
IEEE Transactions on Reliability
Volume
45
Issue
3
Number of Pages
429-432
Document Type
Article
Personal Identifier
scopus
DOI Link
https://doi.org/10.1109/24.537013
Copyright Status
Unknown
Socpus ID
0030247452 (Scopus)
Source API URL
https://api.elsevier.com/content/abstract/scopus_id/0030247452
STARS Citation
Linton, D. G.; Khajenoori, S.; and Hebert, G., "A fast algorithm for repair-depot reliability-evaluation" (1996). Scopus Export 1990s. 2648.
https://stars.library.ucf.edu/scopus1990/2648