On a two-server reliability system with one-server idle below a threshold (Q2664631): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1504/ijmor.2021.114209 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W4238070691 / rank | |||
Normal rank |
Latest revision as of 11:00, 30 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On a two-server reliability system with one-server idle below a threshold |
scientific article |
Statements
On a two-server reliability system with one-server idle below a threshold (English)
0 references
17 November 2021
0 references
Summary: In this work, we study a two-server \(k\)-out-of-\(n\): \(G\) repairable system with identical components. Lifetimes of components follow an exponential distribution with parameter \(\lambda \). For the repair of failed components, we consider two servers called server1 and server2 and the repair times are independent exponential random variables with parameters \(\mu_1\) and \(\mu_2\) \((\mu_1 < \mu_2)\) respectively for server1 and server2. It is assumed that server1 alone is active if the number of failed components is below a prescribed threshold say \(N (>1)\), whereas both servers are active above that threshold. That is, activating server2 only when the number of failed components reaches the threshold \(N\) and when it falls below that threshold, switch off the server. It will again reactivate only on the accumulation of \(N\) units. We obtained the system state distributions in finite time and the steady-state, by analysing a continuous time Markov chain and derived several other characteristics of the system such as system reliability, mean time to failure, mean busy period of the servers, etc. Also, we investigated a control problem and proved that the total expected cost of the system is convex in \(N\) and hence global minimum exists. Some numerical illustrations also provided.
0 references
reliability
0 references
\(k\)-out-of-\(n\) system
0 references
busy period analysis
0 references
Markov chain
0 references
optimisation
0 references