Journal Search Engine
Search Advanced Search Adode Reader(link)
Download PDF Export Citaion korean bibliography PMC previewer
ISSN : 2005-0461(Print)
ISSN : 2287-7975(Online)
Journal of Society of Korea Industrial and Systems Engineering Vol.35 No.2 pp.37-44
DOI :

포병부대 비계획 사격순서 결정 알고리즘

최용백*, 김경섭**†
교육사령부 전투실험실 워게임실험처*, 연세대학교 산업공학과**

Algorithms for Fire Sequencing Problem in Unplanned Artillery Attack Operation

Kyung-Sup Kim**†, Choi Yong-Baek*
Department of Information and Industrial Engineering, Yonsei University**
Republic of Korea Army Training and Doctrine Command*
교신저자 kyungkim@yonsei.ac.kr
논문접수일:2012년 03월 05일 논문수정일:2012년 04월 30일 게재확정일:2012년 05월 02일

Abstract

This paper focuses on scheduling problems arising in the military. In planned artillery attack operations, a large number of threatening enemy targets should be destroyed to minimize fatal loss to the friendly forces. We consider a situation in which the number of available weapons is smaller than the number of targets. Therefore it is required to develop a new sequencing algorithm for the unplanned artillery attack operation. The objective is to minimize the total loss to the friendly forces from the targets, which is expressed as a function of the fire power potential, after artillery attack operations are finished. We develop an algorithm considering the fire power potential and the time required to destroy the targets. The algorithms suggested in this paper can be used in real artillery attack operations if they are modified slightly to cope with the practical situations.

Reference