Please use this identifier to cite or link to this item:
|Title:||Analysis of maintenance policies for finite life-cycle multi-state systems||Authors:||Wu, J.
Adam Ng, T.S.
|Keywords:||Discounted cost model
Multi-state system (MSS)
|Issue Date:||Nov-2010||Citation:||Wu, J., Adam Ng, T.S., Xie, M., Huang, H.-Z. (2010-11). Analysis of maintenance policies for finite life-cycle multi-state systems. Computers and Industrial Engineering 59 (4) : 638-646. ScholarBank@NUS Repository. https://doi.org/10.1016/j.cie.2010.07.013||Abstract:||Maintenance policies for multi-state systems (MSS) are often analyzed under infinite horizon assumptions. In practice, it is important to consider maintenance policies under a finite horizon because the life cycles of most systems are finite. In this paper, we consider a finite life-cycle MSS that is subject to both degradation and Poisson failures. We study two classes of maintenance policies - preventive replacements and corrective replacements, and their effectiveness in controlling the customer's expected discounted maintenance cost (EDMC). For both policies, replacement decisions are modelled via two control parameters - a threshold on the current system state and a threshold on the residual life cycle, which is measured as the time span from present to the end of life cycle. We derive close-to-explicit forms of the cost models under each of the policy. Methodologies for optimizing the maintenance thresholds are further proposed. Computational results verify that preventive replacements outperform corrective replacements typically when the downtime cost per failure is relatively high compared to the repair cost. © 2010 Elsevier Ltd. All rights reserved.||Source Title:||Computers and Industrial Engineering||URI:||http://scholarbank.nus.edu.sg/handle/10635/63022||ISSN:||03608352||DOI:||10.1016/j.cie.2010.07.013|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.