This dissertation 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 of the targets, which is expressed as a function of the fire power potential, after artillery attack operations are finished. We develop a algorithm considering the fire power potential and the time required to destroy the targets. The algorithms suggested in this dissertation can be used in real artillery attack operations if they are modified slightly to cope with the practical situations.

1. 서 론
 2. 기존연구 고찰
 3. 비계획 사격 순서 결정 문제
  3.1 문제 개요
  3.2 이론적 배경
 4. 사격방향 전환이 불필요한 비계획 사격 순서 결정 모델
  4.1 문제 모형
  4.2 비계획 사격 순서 결정 모델
  4.3 비계획 사격 순서 결정 모델 검증
 5. 사격방향 전환이 필요한 비계획사격 순서 결정 모델
  5.1 문제 모형
  5.2 비계획 사격 순서 결정 모델
 6. 결 론
 참고문헌

• 최용백(연세대학교 산업공학과) | Yong-Baek Choi
• 김경섭(연세대학교 산업공학과) | Kyung-Sup Kim