Ordering in a Sequential Storage System.

Abstract

A missile system in which L launchers were available in a row and S spare missiles were stored in a continuation of this row was considered. Additionally, an assortment of warheads was available, but only one could be mounted in each missile. The ability of this system to meet a demand for a particular warhead was dependent on the mix of warheads in the L+S missiles and the order in which the missiles with their varying warheads were mounted on the launchers and in storage. Since the missiles were in a continuous row, some missiles would not be available for firing before the missiles in front of them had been fired. Because of the myriad possible permutations of the L+S warheads, determination of optimal ordering of the warheads by simulation was found to be too time-consuming. Hence, analytic expressions were developed after an appropriate measure of effectiveness was devised. A computer program was developed to perform the recursive calculations necessary. (Author)

Document Details

Document Type
Technical Report
Publication Date
Mar 01, 1974
Accession Number
AD0777883

Entities

People

  • Michael Lynn Mulhern

Organizations

  • Naval Postgraduate School

Tags

Communities of Interest

  • Weapons Technologies

DTIC Thesaurus Topics

  • Computer Programs
  • Computers
  • Launchers
  • Permutations
  • Simulations
  • Simulators

Readers

  • Aerospace Test and Evaluation
  • Explosive Engineering.
  • Graph Algorithms and Convex Optimization.