Please use this identifier to cite or link to this item: https://doi.org/10.1109/IEEM.2011.6118118
Title: Redundancy allocation for series-parallel warm-standby systems
Authors: Tannous, O.
Xing, L.
Rui, P.
Xie, M. 
Ng, S.H. 
Keywords: Genetic Algorithm
Integer Programming
Reliability Optimization
Warm Standby
Issue Date: 2011
Source: Tannous, O.,Xing, L.,Rui, P.,Xie, M.,Ng, S.H. (2011). Redundancy allocation for series-parallel warm-standby systems. IEEE International Conference on Industrial Engineering and Engineering Management : 1261-1265. ScholarBank@NUS Repository. https://doi.org/10.1109/IEEM.2011.6118118
Abstract: Increasing the reliability of a system is generally achieved by using redundant components, which results in raising the system cost. A great challenge in system design is to improve the system reliability while still meeting the resources limitations, typically the budget constraints. This paper considers the redundancy allocation problem (RAP) for series-parallel systems with warm standby sparing (WSP). WSP is a type of dynamic redundancy that compromises the energy consumption of a hot standby sparing system and the recovery time of a cold standby sparing system. The existing RAP solutions mainly focus on systems with cold and hot standby redundancies. This paper presents two optimization solution methodologies, respectively based on genetic algorithm and integer programming to achieve optimal design of a series-parallel with warm standby redundancy. Both methodologies are illustrated using examples. © 2011 IEEE.
Source Title: IEEE International Conference on Industrial Engineering and Engineering Management
URI: http://scholarbank.nus.edu.sg/handle/10635/72388
ISBN: 9781457707391
ISSN: 21573611
DOI: 10.1109/IEEM.2011.6118118
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.

SCOPUSTM   
Citations

24
checked on Dec 13, 2017

Page view(s)

21
checked on Dec 9, 2017

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.