Dynamic repair allocation for a k-out-of-n system maintained by distinguishable repairmen

Michael N. Katehakis, Costis Melolidakis, Michael N. Katehakis

Research output: Contribution to journalArticlepeer-review

7 Scopus citations

Abstract

We consider a K-out-of-N system maintained by R repairmen, where the lifetime of the ith component is an exponentially distributed random variable with parameter εi. Repairmen are distinguishable, and the time it takes the rth repairman to repair a failed component is an exponentially distributed random variable with parameter λr. Repaired components are as good as new and preemptions are allowed. We show that the policy that assigns the faster repairmen to the most reliable components is optimal with respect to several optimality criteria. The approach we take in establishing stochastic optimality with respect to the number of functioning components is of wide applicability to different classes of stochastic optimization problems.

Original languageEnglish (US)
Pages (from-to)51-62
Number of pages12
JournalProbability in the Engineering and Informational Sciences
Volume2
Issue number1
DOIs
StatePublished - Jan 1988
Externally publishedYes

All Science Journal Classification (ASJC) codes

  • Statistics and Probability
  • Statistics, Probability and Uncertainty
  • Management Science and Operations Research
  • Industrial and Manufacturing Engineering

Fingerprint Dive into the research topics of 'Dynamic repair allocation for a k-out-of-n system maintained by distinguishable repairmen'. Together they form a unique fingerprint.

Cite this