Hostname: page-component-7b7567c8c-wxvwp Total loading time: 0 Render date: 2026-11-16T08:41:33.341Z Has data issue: false hasContentIssue false

Optimal allocation of resources to nodes of parallel and series systems

Published online by Cambridge University Press:  01 July 2016

Moshe Shaked*
Affiliation:
University of Arizona
J. George Shanthikumar*
Affiliation:
University of California, Berkeley
*
∗Postal address: Department of Mathematics, University of Arizona, Tucson, AZ 85721, USA.
∗∗Postal address: Walter A. Haas School of Business, University of California, Berkeley, CA 94720, USA.

Abstract

In this paper we consider parallel and series systems, the components of which can be ‘improved'. The ‘improvement' consists of supplying the components with cold or hot standby spares or by allotting to them fixed budgets for minimal repairs. A fixed total resource of spares or minimal repairs is available. We find the optimal allocation of the resource items in several commonly encountered settings.

Information

Type
Research Article
Copyright
Copyright © Applied Probability Trust 1992 

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