Steady-State Probability Distribution in Machine Repair Systems with Unreliable Repair Servers and Multi-Phase Recovery

This study provides a mathematical analysis of the steady-state probability distribution in a machine repair system characterized by threshold recovery, unreliable repair servers, and phase-type repairs. A series of steady-state equations shows the possibility of distinct failure states in the system. The number of broken machines can be ranging from 0 to N. The recovery policy is based on a threshold, which means that repairs only start when failures reach above a certain level T. This is the greatest way to use resources. Repair servers, on the other hand, aren't always trustworthy, which means that there is a potential of failure that takes longer to fix, making the system even less reliable. There are various processes in the repair process, and machines go through a number of random repair phases before they can be utilized again. You can find the steady-state distribution by utilizing probability balance equations. This tells us how well the system works, how likely it is to break down, and how reliable it is overall. The results help businesses figure out the best ways to keep their machines running smoothly, which helps them avoid breakdowns, make machines more available, and better plan repairs when things don't go as planned.

Authors

Institutions

Publication Details

Journal
International Journal of Mathematical Engineering and Management Sciences
Published
2026-01-04
DOI
https://doi.org/10.33889/ijmems.2026.11.1.018
Primary Topic
Reliability and Maintenance Optimization
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Steady-State Probability Distribution in Machine Repair Systems with Unreliable Repair Servers and Multi-Phase Recovery

Supriya Maheshwari, Khursheed Alam, Masood Alam
International Journal of Mathematical Engineering and Management Sciences
Reliability and Maintenance Optimization
article

Steady-State Probability Distribution in Machine Repair Systems with Unreliable Repair Servers and Multi-Phase Recovery

Supriya Maheshwari, Khursheed Alam, Masood Alam
article en

Abstract

This study provides a mathematical analysis of the steady-state probability distribution in a machine repair system characterized by threshold recovery, unreliable repair servers, and phase-type repairs. A series of steady-state equations shows the possibility of distinct failure states in the system. The number of broken machines can be ranging from 0 to N. The recovery policy is based on a threshold, which means that repairs only start when failures reach above a certain level T. This is the greatest way to use resources. Repair servers, on the other hand, aren't always trustworthy, which means that there is a potential of failure that takes longer to fix, making the system even less reliable. There are various processes in the repair process, and machines go through a number of random repair phases before they can be utilized again. You can find the steady-state distribution by utilizing probability balance equations. This tells us how well the system works, how likely it is to break down, and how reliable it is overall. The results help businesses figure out the best ways to keep their machines running smoothly, which helps them avoid breakdowns, make machines more available, and better plan repairs when things don't go as planned.

International Journal of Mathematical Engineering and Management SciencesVol. 11(1)
Institute of Engineering (NP), Sultan Qaboos University (OM), Sharda University (IN)
Openalex Percentile: Top 99%
Reliability and Maintenance Optimization
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.