Targeting and scheduling problem for field artillery

Abstract

We consider the targeting and the fire sequencing problem for field artillery. We shaw that the targeting problem, which can be modeled as a problem with nonlinear constraints, can be transformed into a set of independent bounded variable knapsack problems. We also propose a mathematical model far the fire sequencing problem which is NP-hard and developed a heuristic to solve the problem. Computational results using randomly generated data are presented. (C) 1997 Elsevier Science Ltd.