Skip to Main Content
This paper presents a solution and computer program for steady-state availability of a k-out-of-n:G system with single repair. Techniques and methodologies are commonly treated in text books to solve one and two element availabilities. This paper provides both the solution for k-out-of-n system availability and a FORTRAN source program for calculating the availability. The managers of mass transit and computer systems can put n elements on line with the assurance that, on the average, at least k elements will actually be available to complete the mission.
Date of Publication: June 1983