Hostname: page-component-586b7cd67f-t7fkt Total loading time: 0 Render date: 2024-11-22T04:06:13.179Z Has data issue: false hasContentIssue false
  • English
  • Français

Optimal policies for machine repairmen problems

Part of: Operations research and management science

Published online by Cambridge University Press:  14 July 2016

Esther Frostig
Esther Frostig*
Affiliation:
University of Haifa
*
∗ Postal address: Department of Statistics, University of Haifa, Mount Carmel, Haifa 31999, Israel.
Get access Rights & Permissions [Opens in a new window]

Abstract

n unreliable machines are maintained by m repairmen. Assuming exponentially distributed up-time and repair time we find the optimal policy to allocate the repairmen to the failed machines in order to stochastically minimize the time until all machines work. Considering only one repairman, we find the optimal policy to maximize the expected total discount time that machines work. We find the optimal policy for the cases where the up-time and repair time are exponentially distributed or identically arbitrarily distributed up-times and increasing failure rate distribution repair times.

Keywords

MARKOV DECISION PROCESSRELIABILITYPRODUCTION

MSC classification

Primary: 90C40: Markov and semi-Markov decision processes
Secondary: 90B25: Reliability, availability, maintenance, inspection 90B30: Production models
Type
Research Papers
Information
Journal of Applied Probability , Volume 30 , Issue 3 , September 1993 , pp. 703 - 715
Copyright
Copyright © Applied Probability Trust 1993 

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.)

References

[1] Derman, C., Liberman, G. J. and Ross, S. M. (1980) On the optimal assignment of servers and a repairman. J. Appl. Prob. 17, 577–581.Google Scholar
[2] Heyman, D. and Sobel, M. J. (1982) Stochastic Models in Operations Research, Vol. II. McGraw-Hill, New York.Google Scholar
[3] Katehakis, M. N. and Derman, C. (1984) Optimal repair allocation in a series system. Math. Operat. Res. 9, 615–623.Google Scholar
[4] Katehakis, M. and Derman, C. (1989) On the maintenance of systems composed of highly reliable components. Management Sci. 35, 551–560.Google Scholar
[5] Katehakis, M. and Melolidakis, C. (1988) Dynamic repair allocation for a k-out-of-n system maintained by distinguishable repairmen. Prob. Eng. Inf. Sci. 2, 51–62.Google Scholar
[6] Katehakis, M. and Melolidakis, C. (1990) On stochastic optimality of policies in first passage problems. Stoch. Anal. Appl. 8, 209–223.Google Scholar
[7] Main, P., Tsoucas, P. and Walrand, J. (1989) Interchange arguments in stochastic scheduling. J. Appl. Prob. 27, 815–826.Google Scholar
[8] Ross, S. M. (1982) Introduction to Stochastic Dynamic Programming. Academic Press, New York.Google Scholar
[9] Smith, D. R. (1978) Optimal repair of series system. Operat. Res. 26, 653–662.Google Scholar
[10] Van Der Heyden, L. (1981) Scheduling jobs with exponential processing and arrival times on identical processes so as to minimize the expected makespan. Math. Operat. Res. 6, 305–312.Google Scholar