Hostname: page-component-76d6cb85b7-rxvq6 Total loading time: 0 Render date: 2026-07-11T16:50:37.260Z Has data issue: false hasContentIssue false
  • English
  • Français

Dynamic Repair Allocation for a k−Out−of−n System Maintained by Distinguishable Repairmen

Published online by Cambridge University Press:  27 July 2009

Michael N. Katehakis  and
Costis Melolidakis
Michael N. Katehakis
Affiliation:
Department ofIndustrial Engineering Technical University of Crete Hania, 7300 Greece and Columbia University Department of Statistics New York, New York 10027
Costis Melolidakis
Affiliation:
Department ofIndustrial Engineering Technical University of Crete Hania, 7300 Greece
Get access Rights & Permissions [Opens in a new window]

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.

Information

Type
Articles
Information
Probability in the Engineering and Informational Sciences , Volume 2 , Issue 1 , January 1988 , pp. 51 - 62
Copyright
Copyright © Cambridge University Press 1988

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable

References

Derman, C. (1970). Finite state Markovian decision processes. New York: Academic Press.Google Scholar
Derman, C., Lieberman, G.J., & Ross, S.M. (1980). On the optimal assignment of servers and repairmen. Journal of Applied Probability 17: 577–581.CrossRefGoogle Scholar
Katehakis, M.N. & Derman, C. (1984). Optimal repair allocation in a series system. Mathematics of Operations Research 9(4): 615–623.CrossRefGoogle Scholar
Katehakis, M.N. & Melolidakis, C. (1987). On stochastic optimality of policies in first-passage time problems. Technical University of Crete, Department of Industrial Engineering Technical Report.Google Scholar
Lippman, S.A. (1975). Applying a new device in the optimization of exponential queuing systems. Operations Research 23: 687–710.CrossRefGoogle Scholar
Smith, D.R. (1978). Optimal repair of a series system. Operations Research 26: 653–662.CrossRefGoogle Scholar