Please use this identifier to cite or link to this item:
Title: Element maintenance and allocation for linear consecutively connected systems
Authors: Peng, R.
Xie, M.
Ng, S.H. 
Levitin, G.
Keywords: genetic algorithm
linear consecutively connected system
Maintenance decision
reliability allocation
universal generating function
Issue Date: 1-Nov-2012
Citation: Peng, R., Xie, M., Ng, S.H., Levitin, G. (2012-11-01). Element maintenance and allocation for linear consecutively connected systems. IIE Transactions (Institute of Industrial Engineers) 44 (11) : 964-973. ScholarBank@NUS Repository.
Abstract: This article considers optimal maintenance and allocation of elements in a Linear Multi-state Consecutively Connected System (LMCCS), which is important in signal transmission and other network systems. The system consists of N+1 linearly ordered positions (nodes) and fails if the first node (source) is not connected with the final node (sink). The reliability of an LMCCS has been studied in the past but has been restricted to the case when each system element has a constant reliability. In practice, system elements usually fail with increasing failure probability due to aging effects. Furthermore, in order to increase system availability, resources can be put into the maintenance of each element to increase the availability of the element. In this article, a framework is proposed to solve the cost optimal maintenance and allocation strategy of this type of system subject to an availability requirement. A universal generating function is used to estimate the availability of the system. A genetic algorithm is adopted for optimization. Illustrative examples are presented. © 2012 "IIE".
Source Title: IIE Transactions (Institute of Industrial Engineers)
ISSN: 0740817X
DOI: 10.1080/0740817X.2011.649388
Appears in Collections:Staff Publications

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


checked on Dec 11, 2018


checked on Dec 11, 2018

Page view(s)

checked on Oct 20, 2018

Google ScholarTM



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