2008-05 2008. 7. 22
Fire Scheduling for Planned Artillery Attack Operations under Time-Dependent Destruction Probabilities
Young-Ho Cha, Yeong-Dae Kim
Department of Industrial Engineering, Korea Advanced Institute of Science and Technology, Korea
ABSTRACT: In this paper, we consider the fire scheduling problem (FSP) for field artillery, which is the problem of scheduling operations of firing at given targets with a given set of weapons. We consider a situation in which the number of available weapons is smaller than the number of targets, the targets are assigned to the weapons already, and targets may move and hence the probability that a target is destroyed by a firing attack decreases as time passes. We present a branch and bound algorithm for the FSP with the objective of minimizing total threat of the targets, which is expressed as a function of the destruction probabilities. Results of computational tests show that the suggested algorithm solves problems of a medium size in a reasonable amount of computation time.
KEY WORDS: military, scheduling, branch and bound algorithm