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)
Ordering in a Sequential Storage System
1974
82 pages
Report
No indication
English
A sequential ordering problem in automotive paint shops
Tema Archive | 2004
|Sequential ordering problems for crane scheduling in port terminals
Tema Archive | 2008
|