Targeting and scheduling problem for field artillery

✍ Scribed by Ojeong Kwon; Kyungsik Lee; Sungsoo Park

• Book ID: 104328959
• Publisher: Elsevier Science
• Year: 1997
• Tongue: English
• Weight: 355 KB
• Volume: 33
• Category: Article
• ISSN: 0360-8352
• DOI: 10.1016/s0360-8352(97)00224-6

✦ Synopsis

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.