Abstract
In this paper, an optimal maintenance policy is developed for a k-out-of-n system that works in a random cycle. A k-out-of-n system, which consists of \(n\) independent components and functions if at least \(k\) of the \(n\) components function, is one of the most important systems in reliability engineering. Consider that a component suffers from either minor or catastrophic failure, which is minimally repaired or lying idle, respectively. When \(n - k + 1\) idle components occur, the system completely fails and undergoes corrective replacement. The notations of preventive replacement first and last are adopted; in other words, the system undergoes preventive replacement before complete failure at a planned time or at a random working time, whichever occurs first or last. The present paper aims to develop a two-stage maintenance methodology for a k-out-of-n system, and determine the optimal number of components and preventive replacement time that minimize the mean cost rate functions, respectively. For each model, the mean cost rate function is formulated analytically and the optimization problem is solved theoretically. Finally, a numerical example is given to demonstrate the applicability of the methodology derived from this paper. The proposed models provide a more general framework to analyze the maintenance policy for the k-out-of-n system.
Similar content being viewed by others
References
Beichelt, F. (1993). A unifying treatment of replacement policies with minimal repair. Naval Research Logistics, 40, 51–67.
Brown, M., & Proschan, F. (1965). Mathematical theory of reliability. Wiley.
Brown, M., & Proschan, F. (1983). Imperfect repair. Journal of Applied Probability, 20, 851–859.
Chang, C. C. (2016). Optimal preventive policies for imperfect maintenance models with replacement first and last. Communications in Statistics-Theory and Methods, 45(17), 5123–5136.
Chang, C. C., & Chen, Y. L. (2015). Optimisation of preventive maintenance policies with replacement first and last for systems subject to shocks. International Journal of Systems Science: Operations & Logistics, 2(1), 35–48.
Chang, C. C., Chen, Y. L., Yin, X., & Zhang, Z. G. (2019). Generalized multi-parameter preventive replacement policy for systems with random processing times. INFOR: Information Systems and Operational Research, 57(2), 187–203.
Chen, M., Mizutani, S., & Nakagawa, T. (2010). Random and age replacement policies. International Journal of Reliability, Quality and Safety Engineering, 17(1), 27–39.
Chen, Y. L., & Chang, C. C. (2020). Optimum sequential preventive maintenance first or last policies with imperfect maintenance for a system subject to shocks. Communications in Statistics-Theory and Methods. https://doi.org/10.1080/03610926.2020.1746807
Eryilmaz, S., & Devrimb, Y. (2019). Reliability and optimal replacement policy for a k-out-of-n system subject to shocks. Reliability Engineering and System Safety, 188, 393–397.
Jian, R. (2018). Performance evaluation of seven optimization models of age replacement policy. Reliability Engineering and System Safety, 180, 302–311.
MannaiGasmi, N. S. (2020). Optimal design of k-out-of-n system under first and last replacement in reliability theory. Operational Research, 20, 1353–1368.
Nakagawa, T. (2005). Maintenance theory of reliability. Springer.
Park, M., Lee, J., & Kim, S. (2019). An optimal maintenance policy for a k-out-of-n system without monitoring component failures. Quality Technology & Quantitative Management, 16(2), 140–153.
Pham, H. (2003). Handbook of reliability engineering. London: Springer.
Sheu, S. H., Liu, T. H., Tsai, H. N., & Zhang, Z. G. (2019). Optimization issues in k-out-of-n systems. Applied Mathematical Modelling, 73, 563–580.
Sugiura, T., Mizutani, S., and Nakagawa, T. (2004), Optimal random replacement policies, In: 10th ISSAT International conference on reliability and quality design, pp. 99–103
Zhao, X., Al-Khalifa, K. N., Hamouda, A. M., & Nakagawa, T. (2017). Age replacement models: A summary with new perspectives and methods. Reliability Engineering and System Safety, 161, 95–105.
Acknowledgements
The author would like to thank the referees for their insightful comments and suggestions, which greatly enhanced the clarity of the article. All of the suggestions were incorporated directly in the text. This research was supported by the National Science and Technology Council of Taiwan, ROC, under Grant No. MOST110-2410-H-147-004.
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Appendices
Appendix 1 Proof of Theorem 1
The inequalities \(C(n + 1) \ge C(n)\) and \(C(n) < C(n - 1)\) imply inequalities (9). If \(\zeta (n)\) is increasing in \(n\), then \(L(n)\) is also increasing in \(n\) since
Furthermore, \(L(0) = 0\) and \(\mathop {\lim }\limits_{n \to \infty } L(n) \to \infty\) since \(\mathop {\lim }\limits_{n \to \infty } \zeta (n) \to \infty\). There exists an unique \(n^{*}\) satisfies inequalities (7), which minimizes \(C(n)\) in Expression (6). □
Appendix 2 Proof of Theorem 2
Taking the first order derivative of \(C_{f} (T)\) with respect to \(T\) and setting it to zero imply (17). If \(\varphi_{f} (T)\) is increasing in \(T\), it causes that \(Q_{f} (T)\) is also increasing in \(T\). Further, \(Q_{f} (0) = 0\) and
If \(\varphi_{f} (\infty ) > \theta\), then \(Q_{f} (\infty ) > n^{*} c_{1}\). Thus, form the increasing property of \(Q_{f} (T)\), there exists a finite and unique \(T_{f}^{*}\) \((0 < T_{f}^{*} < \infty )\) satisfies (17), which minimizes \(C_{f} (T)\). If \(T_{f}^{*}\) is the solution, from Eqs. (17) and (18), \(C_{f} \left( {T_{f}^{*} } \right) = \varphi_{f} \left( {T_{f}^{*} } \right)\). □
Appendix 3 Proof of Theorem 3
Taking the first order derivative of \(C_{l} (T)\) with respect to \(T\) and setting it to zero imply (28). If \(\varphi_{l} (T)\) is increasing in \(T\), it causes that \(Q_{l} (T)\) is also increasing in \(T\). Further,
If \(\varphi_{l} (\infty ) > \delta\), then \(Q_{l} (\infty ) > n^{*} c_{1}\). Thus, form the increasing property of \(Q_{l} (T)\), there exists a finite and unique \(T_{l}^{*}\) satisfies (28), which minimizes \(C_{l} (T)\). If \(T_{l}^{*}\) is the solution, from Eqs. (28) and (29), \(C_{l} \left( {T_{l}^{*} } \right) = \varphi_{l} \left( {T_{l}^{*} } \right)\). □
Rights and permissions
Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.
About this article
Cite this article
Chang, CC. Optimal maintenance policy for a k-out-of-n system with replacement first and last. Ann Oper Res 323, 31–43 (2023). https://doi.org/10.1007/s10479-023-05236-2
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10479-023-05236-2