Calculation of Steady-State Probabilities for Repair Facilities with Multiple Sources and Dynamic Return Priorities

DOI10.1287/OPRE.40.3.S248zbMATH Open0763.90045OpenAlexW2057386011MaRDI QIDQ4016948FDOQ4016948

Authors: Sikander Daryanani, Douglas R. Miller 

Publication date: 16 January 1993

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/opre.40.3.s248

Recommendations

• A recursive method to compute the steady state probabilities of the machine interference model: (M/G/1)/\(K\)
• The Markovian Two-echelon Repairable Item Provisioning Problem
• Iterative solution methods for obtaining the steady-state probability distributions of Markovian multi-echelon repairable item inventory systems
• Iterative Method for Steady State Reliability Analysis of Complex Markov Systems
• Computing Steady-State Probabilities of a Nonpreemptive Priority Multiserver Queue

zbMATH Keywords

steady-state probabilitiesdynamic return policyexponential single-channel repair facilitymultiple Poisson sourcesstate-reduction computational method

Mathematics Subject Classification ID

Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Reliability, availability, maintenance, inspection in operations research (90B25) Applications of Markov renewal processes (reliability, queueing networks, etc.) (60K20)

Cited In (3)

• Service facilities with Markovian demand and deterministic supply with an application in repair modelling
• A note on repair systems with exchangeable items and the longest queue mechanism
• Repair systems with exchangeable items and the longest queue mechanism

This page was built for publication: Calculation of Steady-State Probabilities for Repair Facilities with Multiple Sources and Dynamic Return Priorities

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4016948)