Premium
Optimal sequential replenishment of ships during combat
Author(s) -
Pilnick S. E.,
Glazebrook K. D.,
Gaver D. P.
Publication year - 1991
Publication title -
naval research logistics (nrl)
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.665
H-Index - 68
eISSN - 1520-6750
pISSN - 0894-069X
DOI - 10.1002/1520-6750(199110)38:5<637::aid-nav3220380502>3.0.co;2-b
Subject(s) - ammunition , operations research , heuristics , computer science , schedule , range (aeronautics) , battle , heuristic , mathematical optimization , engineering , mathematics , artificial intelligence , archaeology , history , aerospace engineering , operating system
A carrier battle group is operating in an area where it is subject to attack by enemy aircraft. It is anticipated that air raids will occur in large waves. The uncertain time between raids is available for the replenishment of supplies. We consider the problem of how best to schedule ammunition replenishment during this period. The theory of Gittins indices provides the technical background to the development of a range of models which yield a hierarchy of index‐based heuristics for replenishment. One such heuristic is assessed computationally in a more realistic scenario than is explicitly allowed for by the models.