Virginia Polytechnic Institute and State University
Optimal resource allocation for reliability in series systems
Abstract
dc:description.abstractThis investigation treats the problem of optimally allocating resources in a series system in order to maximize the reliability of that system. Two aspects of the general resource allocation problem are explored: the determination of the optimal number of parallel redundancies to be placed at each stage, and the allocation of resources to a component in such a way as to reduce the component steady state failure probability. A function is formulated which relates a component's failure probability to the resources expended upon that component and this function is employed to relate the two aspects of the general problem. The first phase of the two-phase formulation consists of allocating redundant elements at various stages in the system in the face of scarce resources in an attempt to improve system reliability. Only the case of parallel redundancies was considered. A branch and bound algorithm was developed which optimally allocated these parallel redundant elements. Examples are presented and computational experience using the branch and bound technique is reported. This formulation of the problem proves to provide a very efficient method for the solution of even very large problems. The second phase of the procedure is presented. This phase consists of optimally allocating scarce resources to individual system components in a manner to reduce the failure probabilities of each element. An exponential function is chosen to represent the desired relationship in which a basic assumption is made that increased allocation will always induce decreased failure probability. Several optimization techniques were attempted and none performed well. The fundamental difficulty encountered with all techniques is that none can properly cope with constraints in a consistently efficient fashion. In some cases intelligent application of heuristics along with specific optimization techniques did prove effective. However, no consistent decision rules were developed. The generalized resource allocation problem is structured as a two-phase decomposable problem. A general solution algorithm is presented but no specific examples are included due to difficulties encountered in the second phase.
Degree
thesis:*- Name thesis:degree_name
- Ph. D
- Level thesis:degree_level
- doctoral
- Discipline thesis:degree_discipline
- Industrial Engineering
- Department dc:contributor.department
- Industrial Engineering
- Grantor dc:publisher
- Virginia Polytechnic Institute and State University
- Year dc:date.issued
- 1970
Author and committee
dc:creator, dc:contributor.*- Author dc:creator
-
- Taylor, Robert Edward
- Chair dc:contributor.committeechair
-
- Ghare, Prabhakar M.
- Committee members dc:contributor.committeemember
-
- Torgersen, Paul E.
- Gorsline, George W.
- Fabrycky, Wolter J.
- VanLandingham, Hugh F.
Rights
dc:rights- Statement dc:rights
-
- In Copyright
- Licence dc:rights.uri
- Language dc:language.iso
- en
Identifiers
dc:identifier.*- Handle dc:identifier.uri
- https://hdl.handle.net/10919/138632