Skip to main content

Advertisement

Log in

Reliability and Optimization for k-out-of-n: G Mixed Standby Retrial System with Dependency and J-Vacation

  • Research
  • Published:
Methodology and Computing in Applied Probability Aims and scope Submit manuscript

Abstract

Based on the design and potential application of wind-solar storage intelligent power generation systems in engineering practice, this paper develops a novel reliability model of k-out-of-n: G mixed standby retrial system with failure dependency and J-vacation policy. The working components in the system have redundant dependencies. When any component of the system fails and the repairman is working or on vacation, the failed component goes into the retrial space. If the retrial space has no failed components, the idle repairman goes on vacation, which may last for up to J consecutive vacations, until at a minimum one failed component appears in the retrial space on a vacation return. Firstly, the performance indexes of the system under steady state are analyzed based on the Markov process theory. Secondly, an algorithm for modelling the failure process of the proposed model is developed through a Monte Carlo method, and numerical solutions for the reliability function and mean time to first failure (MTTFF) are presented. Then, some numerical examples are provided to demonstrate the influence of different parameters on the system reliability indexes. Finally, a system cost optimization model based on availability control is developed, and the optimal component configuration schemes for systems with no vacations and different maximum numbers of vacations J are compared and analyzed by genetic algorithm (GA).

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Fig. 1
Algorithm 1
Algorithm 2
Algorithm 3
Algorithm 4
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6

Similar content being viewed by others

Data Availability

No data was used for the research described in the article.

References

Download references

Funding

This work was supported by the National Natural Science Foundation of China [grant number 72071175], the Project of Hebei Key Laboratory of Software Engineering [grant number22567637H], and the Basic Innovative Research and Cultivation Project of Yanshan University [grant number 2023LGZD003].

Author information

Authors and Affiliations

Authors

Contributions

All authors contributed to the study conception and design. Material preparation, data collection and analysis were performed by Qi Shao, Linmin Hu and Fan Xu. The first draft of the manuscript was written by Qi Shao and all authors commented on previous versions of the manuscript. All authors read and approved the final manuscript.

Corresponding author

Correspondence to Linmin Hu.

Ethics declarations

Competing Interest

The authors declare no competing interests.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Appendices

Appendix 1 Sub-blocks of the Transition Rate Matrix Q

The sub-blocks \(\boldsymbol{Q}_{i,i}\)(\(i=0, 1, \cdots , L\)), \(\boldsymbol{Q}_{i,i-1}\)(\(i=1, 2, \cdots , L\)) and \(\boldsymbol{Q}_{i,i+1}\)(\(i=0, 1, \cdots , L-1\)) are provided as follows:

$$\begin{aligned} \boldsymbol{Q}_{0,0}= \left( \begin{array}{ccccccccc}{-\lambda }_{0}&{}{\lambda }_{0}&{}{0}&{}{0}&{}\cdots &{}{0}\\ {0}&{}-({\lambda }_{1}+{\mu })&{}{\mu }&{}{0}&{}\cdots &{}{0}\\ {0}&{}{0}&{}-({\lambda }_{0}+{\theta })&{}{\theta }&{}\cdots &{}{0}\\ {0}&{}{0}&{}{0}&{}-({\lambda }_{0}+{\theta })&{}\cdots &{}{0}\\ \vdots &{}\vdots &{}\vdots &{}\vdots &{}\ddots &{}\vdots \\ {\theta }&{}{0}&{}{0}&{}{0}&{}\cdots &{}-({\lambda }_{0}+{\theta }) \end{array}\right) _{(J+2)\times (J+2)}, \end{aligned}$$
$$\begin{aligned} \boldsymbol{Q}_{i,i-1}= \left( \begin{array}{ccccccccc}{0}&{}{\eta }_{i}&{}{0}&{}{0}&{}\cdots &{}{0}\\ {0}&{}{0}&{}{0}&{}{0}&{}\cdots &{}{0}\\ {0}&{}{0}&{}{0}&{}{0}&{}\cdots &{}{0}\\ {0}&{}{0}&{}{0}&{}{0}&{}\cdots &{}{0}\\ \vdots &{}\vdots &{}\vdots &{}\vdots &{}\ddots &{}\vdots \\ {0}&{}{0}&{}{0}&{}{0}&{}\cdots &{}{0} \end{array}\right) _{(J+2)\times (J+2)},{i=1, 2, \cdots , L-1}, \end{aligned}$$
$$\begin{aligned} \boldsymbol{Q}_{i,i}= \left( \begin{array}{ccccccccc}-({\lambda }_{i}+{\eta }_{i})&{}{\lambda }_{i}&{}{0}&{}{0}&{}\cdots &{}{0}\\ {\mu }&{}-({\lambda }_{i+1}+{\mu })&{}{0}&{}{0}&{}\cdots &{}{0}\\ {\theta }&{}{0}&{}-({\lambda }_{i}+{\theta })&{}{\theta }&{}\cdots &{}{0}\\ {\theta }&{}{0}&{}{0}&{}-({\lambda }_{i}+{\theta })&{}\cdots &{}{0}\\ \vdots &{}\vdots &{}\vdots &{}\vdots &{}\ddots &{}\vdots \\ {\theta }&{}{0}&{}{0}&{}{0}&{}\cdots &{}-({\lambda }_{i}+{\theta }) \end{array}\right) _{(J+2)\times (J+2)}, \end{aligned}$$

\(i=1, 2, \cdots , L-1\),

$$\begin{aligned} \boldsymbol{Q}_{i-1,i}= \left( \begin{array}{ccccccccc}{0}&{}{0}&{}{0}&{}{0}&{}\cdots &{}{0}\\ {0}&{}{\lambda }_{i}&{}{0}&{}{0}&{}\cdots &{}{0}\\ {0}&{}{0}&{}{\lambda }_{i-1}&{}{0}&{}\cdots &{}{0}\\ {0}&{}{0}&{}{0}&{}{\lambda }_{i-1}&{}\cdots &{}{0}\\ \vdots &{}\vdots &{}\vdots &{}\vdots &{}\ddots &{}\vdots \\ {0}&{}{0}&{}{0}&{}{0}&{}\cdots &{}{\lambda }_{i-1} \end{array}\right) _{(J+2)\times (J+2)},{i=1, 2, \cdots , L-1}, \end{aligned}$$
$$\begin{aligned} \boldsymbol{Q}_{L-1,L}= \left( \begin{array}{ccccccccc}{0}&{}{0}&{}{0}&{}{0}&{}\cdots &{}{0}\\ {0}&{}{0}&{}{0}&{}{0}&{}\cdots &{}{0}\\ {0}&{}{\lambda }_{L-1}&{}{0}&{}{0}&{}\cdots &{}{0}\\ {0}&{}{0}&{}{\lambda }_{L-1}&{}{0}&{}\cdots &{}{0}\\ \vdots &{}\vdots &{}\vdots &{}\vdots &{}\ddots &{}\vdots \\ {0}&{}{0}&{}{0}&{}{0}&{}\cdots &{}{\lambda }_{L-1} \end{array}\right) _{(J+2)\times (J+1)}, \end{aligned}$$
$$\begin{aligned} \boldsymbol{Q}_{L,L-1}= \left( \begin{array}{ccccccccc}{0}&{}{\eta }_{L}&{}{0}&{}{0}&{}\cdots &{}{0}\\ {0}&{}{0}&{}{0}&{}{0}&{}\cdots &{}{0}\\ {0}&{}{0}&{}{0}&{}{0}&{}\cdots &{}{0}\\ {0}&{}{0}&{}{0}&{}{0}&{}\cdots &{}{0}\\ \vdots &{}\vdots &{}\vdots &{}\vdots &{}\ddots &{}\vdots \\ {0}&{}{0}&{}{0}&{}{0}&{}\cdots &{}{0} \end{array}\right) _{(J+1)\times (J+2)}, \end{aligned}$$
$$\begin{aligned} \boldsymbol{Q}_{L,L}= \left( \begin{array}{ccccccccc}{-\eta }_{L}&{}{0}&{}{0}&{}{0}&{}\cdots &{}{0}\\ {\theta }&{}{-\theta }&{}{0}&{}{0}&{}\cdots &{}{0}\\ {\theta }&{}{0}&{}{-\theta }&{}{0}&{}\cdots &{}{0}\\ {\theta }&{}{0}&{}{0}&{}{-\theta }&{}\cdots &{}{0}\\ \vdots &{}\vdots &{}\vdots &{}\vdots &{}\ddots &{}\vdots \\ {\theta }&{}{0}&{}{0}&{}{0}&{}\cdots &{}{-\theta } \end{array}\right) _{(J+1)\times (J+1)}. \end{aligned}$$

Appendix 2 Sub-blocks of the Matrix \(D_{1}\)

The sub-blocks \(\boldsymbol{A}_{L-1,L-1}\), \(\boldsymbol{A}_{L-1,L-2}\) and \(\boldsymbol{A}_{L-2,L-1}\) are provided as follows:

$$\begin{aligned} \boldsymbol{A}_{L-1,L-2}= \left( \begin{array}{ccccccccc}{0}&{}{\eta }_{L-1}&{}{0}&{}{0}&{}\cdots &{}{0}\\ {0}&{}{0}&{}{0}&{}{0}&{}\cdots &{}{0}\\ {0}&{}{0}&{}{0}&{}{0}&{}\cdots &{}{0}\\ {0}&{}{0}&{}{0}&{}{0}&{}\cdots &{}{0}\\ \vdots &{}\vdots &{}\vdots &{}\vdots &{}\ddots &{}\vdots \\ {0}&{}{0}&{}{0}&{}{0}&{}\cdots &{}{0} \end{array}\right) _{(J+1)\times (J+2)}, \end{aligned}$$
$$\begin{aligned} \boldsymbol{A}_{L-2,L-1}= \left( \begin{array}{ccccccccc}{0}&{}{0}&{}{0}&{}{0}&{}\cdots &{}{0}\\ {0}&{}{0}&{}{0}&{}{0}&{}\cdots &{}{0}\\ {0}&{}{\lambda }_{L-2}&{}{0}&{}{0}&{}\cdots &{}{0}\\ {0}&{}{0}&{}{\lambda }_{L-2}&{}{0}&{}\cdots &{}{0}\\ \vdots &{}\vdots &{}\vdots &{}\vdots &{}\ddots &{}\vdots \\ {0}&{}{0}&{}{0}&{}{0}&{}\cdots &{}{\lambda }_{L-2} \end{array}\right) _{(J+2)\times (J+1)}, \end{aligned}$$
$$\begin{aligned} \boldsymbol{A}_{L-1,L-1}= \left( \begin{array}{ccccccccc}-(\lambda _{L-1}+\eta _{L-1})&{}{0}&{}{0}&{}{0}&{}\cdots &{}{0}\\ {\theta }&{}{-(\lambda _{L-1}+\theta )}&{}{0}&{}{0}&{}\cdots &{}{0}\\ {\theta }&{}{0}&{}{-(\lambda _{L-1}+\theta )}&{}{0}&{}\cdots &{}{0}\\ \vdots &{}\vdots &{}\vdots &{}\vdots &{}\ddots &{}\vdots \\ {\theta }&{}{0}&{}{0}&{}{0}&{}\cdots &{}{-(\lambda _{L-1}+\theta )} \end{array}\right) _{(J+1)\times (J+1)}. \end{aligned}$$

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.

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Shao, Q., Hu, L. & Xu, F. Reliability and Optimization for k-out-of-n: G Mixed Standby Retrial System with Dependency and J-Vacation. Methodol Comput Appl Probab 26, 8 (2024). https://doi.org/10.1007/s11009-024-10078-x

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • DOI: https://doi.org/10.1007/s11009-024-10078-x

Keywords

Mathematics Subject Classification

Navigation