Targeting and scheduling problem for field artillery

We consider the targeting and the fire sequencing problem for field artillery. We show 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 for the fire sequencing problem which is NP-hard and developed a heuristic to solve the problem. Computational results using randomly generated data are presented.