Optimal arrangement of systems |
| |
Authors: | Philip J. Boland Frank Proschan |
| |
Affiliation: | 1. Department of Mathematics, University College, Dublin, Belfield, Dublin 4, Ireland;2. Department of Statistics, The Florida State University, Tallahassee, Florida 32306 |
| |
Abstract: | To location Li we are to allocate a “generator” and ni “machines” for i = 1, …,k, where n1 … n1 ≧ … ≧ nk. Although the generators and machines function independently of one another, a machine is operable only if it and the generator at its location are functioning. The problem we consider is that of finding the arrangement or allocation optimizing the number of operable machines. We show that if the objective is to maximize the expected number of operable machines at some future time, then it is best to allocate the best generator and the n1 best machines to location L1, the second-best generator and the n2-next-best machines to location L2, etc. However, this arrangement is not always stochastically optimal. For the case of two generators we give a necessary and sufficient condition that this arrangement is stochastically best, and illustrate the result with several examples. |
| |
Keywords: | |
|
|