Replacement policies for a parallel system with shortage and excess costs
Xufeng Zhao,
Mingchih Chen and
Toshio Nakagawa
Reliability Engineering and System Safety, 2016, vol. 150, issue C, 89-95
Abstract:
It has been assumed in most maintenance models that (i) the number of units for a parallel system can be predefined precisely, (ii) maintenance cost after failure should be avoided, and (iii) age replacement can always be performed at its optimized times. However, these assumptions are challenged from practical perspectives in this paper. For this purpose, shortage and excess costs, which claim that replacement done too early before failure involves a waste of operation, are introduced into replacement models, such as replacement plans with time T or distribution G(t) for constant n or random N of units. Furthermore, the number N of working times and the number n of available units for a scheduled replacement time T are discussed. For each model, the expected replacement cost for one cycle and expected replacement cost rate for a long run are optimized, and numerical examples are given.
Keywords: Parallel system; Age replacement; Random replacement; Working times; Parallel computing (search for similar items in EconPapers)
Date: 2016
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (4)
Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S095183201600017X
Full text for ScienceDirect subscribers only
Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
HTML/Text
Persistent link: https://EconPapers.repec.org/RePEc:eee:reensy:v:150:y:2016:i:c:p:89-95
DOI: 10.1016/j.ress.2016.01.008
Access Statistics for this article
Reliability Engineering and System Safety is currently edited by Carlos Guedes Soares
More articles in Reliability Engineering and System Safety from Elsevier
Bibliographic data for series maintained by Catherine Liu ().