비계획 사격상황에서 적 위협 최소화를 위한 실시간 사격순서 결정 연구

다국어 초록 (Multilingual Abstract)

We focus on the Real time Fire Scheduling Problem (RFSP), the problem of determining the sequence of targets to be fired at, for the objective of minimizing threatening probability to achieve tactical goals. In this paper, we assume that there are m available weapons to fire at n targets (> m) and the weapons are already allocated to targets. One weapon or multiple weapons can fire at one target and these fire operations should start simultaneously while the finish time of them may be different. We suggest mathematical modeling for RFSP and several heuristic algorithms. Computational experiments are performed on randomly generated test problems and results show that the suggested algorithms outperform the firing method which is generally adopted in the field artillery.

목차 (Table of Contents)

• Abstract
• 1. 서론
• 2. 실시간 비계획 사격 문제 정의
• 3. 휴리스틱 알고리즘
• 4. 실험 및 결과
• 5. 결론
• 참고문헌

참고문헌 (Reference)

1 이대력, "혼합정수계획법을 이용한 요격미사일의 할당 및 교전 일정계획에 관한 연구" 한국경영과학회 32 (32): 109-133, 2015

2 김동현, "표적 할당과 사격 순서의 동시 결정 문제를 위한 발견적 기법" 한국경영과학회 35 (35): 47-65, 2010

3 윤상흠, "포병부대 사격순서결정을 위한 분지한계 알고리즘 연구" 한국산업경영시스템학회 33 (33): 154-161, 2010

4 최용백, "포병부대 비계획 사격순서 결정 알고리즘" 한국산업경영시스템학회 35 (35): 37-44, 2012

5 김태헌, "공유표적을 포함한 사격순서 결정에 관한 연구" 한국경영과학회 28 (28): 123-134, 2003

6 정치영, "격추확률 최대화를 위한 미사일 최적배치 문제" 한국경영과학회 27 (27): 75-90, 2010

7 Kim, D.-H., "The heuristic algorithm for the fire target allocation and sequencing problem" 2008

8 Kubale, M., "The complexity of scheduling independent two-processor tasks on dedicated processors" 24 (24): 141-147, 1987

9 Kwon, O. -J., "Targeting and scheduling problem for field artillery" 33 (33): 693-696, 1997

10 Drozdowski, M., "Scheduling multiprocessor tasks-An overview" 94 (94): 215-230, 1996

11 Blazewicz, J., "Scheduling multiprocessor tasks on three dedicated processors" 41 (41): 275-280, 1992

12 Amoura, A. K., "Scheduling independent multiprocessor tasks" 32 (32): 247-261, 2002

13 Brucker, P., "Polynomial algorithms for resource-constrained and multiprocessor task scheduling problems" 90 (90): 214-216, 1996

14 Bianco, L., "Nonpreemptive scheduling of independent tasks with prespecified processor allocations" 41 (41): 959-971, 1994

15 Chen, J., "General multiprocessor tasks scheduling" 46 (46): 57-74, 1999

16 Jansen, K., "General multiprocessor task scheduling : approximate solutions in linear tim" 35 (35): 519-530, 2005

17 Dell’Olmo, P., "Efficiency and effectiveness of normal schedules on three dedicated processors" 164 (164): 67-79, 1997

18 Lee, C. -Y., "Current trends in deterministic scheduling" 70 : 1-41, 1997

19 Garey, M.R., "Computers and intractability : a guide to the theory of NPcompleteness" Freeman 1979

20 Hoogeveen, J. A., "Complexity of scheduling multiprocessor tasks with precified processor allocations" 55 (55): 259-272, 1994

21 Krämer, A., "Branch and bound methods for scheduling problems with multiprocessor tasks on dedicated processors" 19 (19): 219-227, 1997

22 Hall, L. A., "Approximation algorithms for scheduling" PWS Publishing Company 1-45, 1997

23 Goemans, M. X., "An approximation algorithm for scheduling on three dedicated machines" 61 (61): 49-59, 1995

24 Huang, J., "A simple linear time approximation algorithm for multi-processor job scheduling on four processors" 13 : 33-45, 2007

25 Chen, J., "A polynomial time approximation scheme for general multiprocessor job scheduling" 31 (31): 1-17, 2001

26 Nawaz, M., "A heuristic algorithm for the m-machine, n-job flowshop sequencing problem" 11 (11): 91-95, 1983

27 Bozoki, G., "A branch and bound algorithm for the continuous-process job-shop scheduling problems" 2 (2): 246-252, 1970

28 차영호, "A Branch-and-Bound Algorithm to Minimize the Makespan in a Fire Scheduling Problem" 한국산업경영시스템학회 38 (38): 132-141, 2015