Replacement First and Last for a Parallel System  
Author Mingchih Chen


Co-Author(s) Xufeng Zhao; Toshio Nakagawa


Abstract This paper observes optimal replacement times for a parallel system with n units, when it is operating for successive jobs with a random working cycle. The classical “whichever occurs first” and the newly proposed “whichever occurs last” are respectively employed for replacements scheduled at time T and at working cycle Y , whose policies are called replacement first and replacement last. The case when the number of units for this parallel system is a given constant value is considered into modelings. We obtain their expected replacement cost rates and optimal solutions analytically. Further, comparisons of replacement first and replacement last are described in detail to determine which policy could save more replacement cost.


Keywords Parallel system, replacement first, replacement last, working cycle, random units
    Article #:  20208
Proceedings of the 20th ISSAT International Conference on Reliability and Quality in Design
August 7-9, 2014 - Seattle, Washington, U.S.A.