Assembly of Systems Having Maximum Reliability
Abstract
The first problem considered in the paper is concerned with the assembly of independent components into parallel systems so as to maximize the expected number of system that perform satisfactorily. Associated with each component is a probability of it performing successfully. It is shown that an optimal assembly is obtained if the reliability of each assembled system can be made equal. If such equality is not attainable, then bounds are given so that the maximum expected number of systems that perform satisfactorily will lie within these stated bounds; the bounds being a function of an arbitrarily chosen assembly. An improvement algorithm is also presented. A second problem treated is concerned with the optimal design of a system. Instead of assembling given units, there is an opportunity to control their quality, i.e., the manufacturer is able to fix the probability, p, of a unit performing successfully. However, his resources are limited so that a constraint is imposed on these probabilities.
Document Details
- Document Type
- Technical Report
- Publication Date
- Sep 29, 1972
- Accession Number
- AD0750690
Entities
People
- Cyrus Derman
- Gerald J. Lieberman
- Sheldon M. Ross
Organizations
- Stanford University