Optimal arrangement of systems
β Scribed by Philip J. Boland; Frank Proschan
- Publisher
- John Wiley and Sons
- Year
- 1984
- Tongue
- English
- Weight
- 354 KB
- Volume
- 31
- Category
- Article
- ISSN
- 0894-069X
No coin nor oath required. For personal study only.
β¦ Synopsis
To location 15, we are to allocate a "generator" and n, "machines" for i = 1, . . . ,k, where n , 2 . . . 2 n,. 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 n, best machines to location L , , the second-best generator and the n,-next-best machines to location Lz, 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.
'
π SIMILAR VOLUMES
We consider a reader-writer system consisting of a single server and a fixed number of jobs (or customers) belonging to two classes. Class one jobs are called readers and any number of them can be processed simultaneously. Class two jobs are called writers and they have to be processed one at a time