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

Taeheon Kim, 이명훈 · 한국경영과학회 학술대회논문집 · 2003

Fire Sequencing Problem(FSP) is to find sequence of targets, where there exist number of targets with different tome units required to fire. Because of the weapon's specifications and the size of the targets, several weapons pay fire on the same targets, and the time units required on firing for each weapon pay 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.

Cited by 2 works.

Authors