Optimal Arrangement of Systems.

Abstract

To location L sub i we are to allocate a 'generator' and n sub i machines for i = 1,...,k where n sub 1 greater than or =...greater than or = n sub K. 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 sub 1 best machines to location L sub 1, the 2nd best generator and the n sub 2 next best machines to location L sub 2, etc. However this arrangement is not always stochastically optimal. For the case of 2 generators we give a necessary and sufficient condition that this arrangement is stochastically best, and illustrate the result with several examples. (Author)

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Jul 01, 1982
Accession Number
ADA121295

Entities

People

  • Frank Proschan
  • Philip J. Boland

Organizations

  • Florida State University

Tags

Communities of Interest

  • C4I

DTIC Thesaurus Topics

  • Abstracts
  • Air Force
  • Classification
  • Data Science
  • Identities
  • Information Science
  • Notation
  • Optimization
  • Permutations
  • Probability
  • Random Variables
  • Scientific Research
  • Security
  • Statistical Analysis
  • Statistics
  • Universities

Readers

  • Aerospace Test and Evaluation
  • Computational Modeling and Simulation
  • Computer Programming and Software Development.