Fire Sequencing Problem with Shared Targets

Fire Sequencing Problem (FSP) is to find a sequence of targets, where there exist a number of targets with different time units required to fire. Because of the weapon's specifications and the size of the targets, several weapons may fire on the same targets, and the time units required on firing for each weapon may be different from each other. The objective is to minimize the completion time of firing for given number of targets. Mathematical formulation is given, and the heuristic algorithm based on the paring of targets in advance is suggested. Performance of the heuristic is evaluated by comparison of heuristic appeared in the literature through the computational experiments.

공유표적을 포함한 사격순서 결정에 관한 연구