Hostname: page-component-7479d7b7d-rvbq7 Total loading time: 0 Render date: 2024-07-12T17:51:10.270Z Has data issue: false hasContentIssue false

Extended block replacement policy with used items

Published online by Cambridge University Press:  14 July 2016

Toshiro Tango*
Affiliation:
The Tokyo Metropolitan Institute of Medical Science

Abstract

Block replacement policy, under which items are replaced at constant intervals of time and at failure, is wasteful because sometimes almost new items are also replaced. In order to eliminate this kind of waste, the following replacement policy is suggested.

(1) Items are exchanged for new items at time kT (k ··· 1, 2, …).

(2) If items fail in [(k – 1) T, kT – v), they are replaced by new items, and if in [kT – v, kT), they are replaced by used items.

The results of this ‘extended block replacement policy with used items' are studied for the Erlang lifetime distribution.

Type
Research Papers
Copyright
Copyright © Applied Probability Trust 1978 

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] Barlow, R. E. and Proschan, F. (1965) Mathematical Theory of Reliability. Wiley, New York.Google Scholar
[2] Bhat, B. R. (1969) Used item replacement policy. J. Appl. Prob. 6, 309318.Google Scholar
[3] Cox, D. R. (1963) Renewal Theory. Methuen, London.Google Scholar
[4] Ross, S. M. (1970) Applied Probability Models with Optimization Applications. Holden-Day, San Francisco.Google Scholar
[5] Berg, M. and Epstein, B. (1976) A modified block replacement policy. Naval Res. Logist. Quart. 23, 1524.Google Scholar
[6] Dixon, L. C. W. (1972) Nonlinear Optimization. English Universities Press, London.Google Scholar