Hostname: page-component-cd9895bd7-dk4vv Total loading time: 0 Render date: 2024-12-27T06:17:21.044Z Has data issue: false hasContentIssue false

Scheduling spares with exponential lifetimes in a two-component parallel system

Published online by Cambridge University Press:  14 July 2016

Michael Pinedo*
Affiliation:
Instituto Venezolano de Investigaciones Científicas
*
Postal address: Centro de Ingeniería y Computacíon, Instituto Venezolano de Investigaciones Científicas (IVIC), Apartado 1827, Caracas 101, Venezuela.

Abstract

Consider a two-component parallel system. There is a stockpile of n spares, spare i having lifetime Xi, exponentially distributed with rate µi. The system breaks down when neither component functions. Every time a spare expires it has to be replaced, to avoid system breakdown. We investigate the policies which maximize the expected lifetime of the system using these n spares.

Type
Research Papers
Copyright
Copyright © Applied Probability Trust 

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] Hordijk, A. (1974) Dynamic Programming and Markov Potential Theory. Mathematical Centre Tracts 51, Mathematisch Centrum, Amsterdam.Google Scholar
[2] Pinedo, M. L. and Weiss, G. (1979) Scheduling stochastic tasks on two parallel processors. Naval Res. Log. Quart. 26, 527535.CrossRefGoogle Scholar
[3] Ross, S. M. (1970) Applied Probability Models with Optimization Applications. Holden-Day, San Francisco.Google Scholar
[4] Weber, R. R. (1978) Scheduling stochastic jobs on parallel machines. J. R. Statist. Soc. B. Google Scholar
[5] Weiss, G. and Pinedo, M. L. (1980) Scheduling tasks with exponential service times on non-identical processors to minimize various cost functions. J. Appl. Prob. 17, 187202.Google Scholar