File Download

There are no files associated with this item.

  • Find it @ UNIST can give you direct access to the published full text of this article. (UNISTARs only)

Views & Downloads

Detailed Information

Cited time in webofscience Cited time in scopus
Metadata Downloads

Modified iterative aggregation procedure for maintenance optimisation of multi-component systems with failure interaction

Author(s)
Zhang, ZhuoqiWu, SuLee, SeungchulNi, Jun
Issued Date
2014-12
DOI
10.1080/00207721.2013.771759
URI
https://scholarworks.unist.ac.kr/handle/201301/9823
Fulltext
http://www.scopus.com/inward/record.url?partnerID=HzOxMe3b&scp=84904807629
Citation
INTERNATIONAL JOURNAL OF SYSTEMS SCIENCE, v.45, no.12, pp.2480 - 2489
Abstract
This paper studies maintenance policies for multi-component systems which have failure interaction among their components. Component failure might accelerate deterioration processes or induce instantaneous failures of the remaining components. We formulate this maintenance problem as a Markov decision process (MDP) with an objective of minimising a total discounted maintenance cost. However, the action set and state space in MDP exponentially grow as the number of components increases. This makes traditional approaches computationally intractable. To deal with this curse of dimensionality, a modified iterative aggregation procedure (MIAP) is proposed. We mathematically prove that iterations in MIAP guarantee the convergence and the policy obtained is optimal. Numerical case studies find that failure interaction should not be ignored in a maintenance policy decision making and the proposed MIAP is faster and requires less computational memory size than that of linear programming.
Publisher
TAYLOR & FRANCIS LTD
ISSN
0020-7721
Keyword (Author)
maintenancemulti-component systemfailure interactionMarkov decision processesmodified iterative aggregation procedure
Keyword
OPTIMAL REPLACEMENT POLICIESMARKOV DECISION-PROCESSESSHOCK DAMAGE INTERACTION2-UNIT SYSTEMPREVENTIVE MAINTENANCE2-COMPONENT SYSTEMLINEAR-PROGRAMSBOUNDSMODELS

qrcode

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