표적 할당과 사격 순서의 동시 결정 문제를 위한 발견적 기법

다국어 초록 (Multilingual Abstract)

In this study the artillery fire system is investigated in consideration of the characteristics of the troop and the target. Two kinds of decision are to be made on the target allocation with fire ammunition and the fire sequencing for the target with duties in charge. The objective is to minimize the completion time for all troops. Each target has the specified amount of load of fire, which can be accomplished by a single troop or the combination of the troops having different capabilities. Mathematical model is suggested, and the heuristic algorithm which yields a solution within a reasonable computation time is developed. The algorithm consists of iterative three steps : the initial solution generation, the division improvement, and the exchange improvement. The performance of the heuristic is evaluated through the computational experiment.

목차 (Table of Contents)

• Abstract
• 1. 서론
• 2. 관련 연구
• 3. 최적화 수리모델
• 4. 발견적 기법
• 5. 실험결과
• 6. 결론
• 참고문헌
• 〈Appendix〉

참고문헌 (Reference)

1 육군본부, "화력운용"

2 육군본부, "화력실무운용"

3 육군본부, "포병운용"

4 김기호, "포병부대 계획표적 사격 순서 결정에 관한 연구" 고려대학교 논문 2002

5 황원식, "스케줄링을 이용한 계획표적 사격순서의 최적화 방안" 한국국방경영분석학회 33 (33): 105-116, 2007

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

7 Kwon, O.J., "Targeting and Scheduling Problem for Field Artillery" 33 : 693-696, 1997

8 Sundararaghavan, P., "Single machine scheduling with start time dependent processing times" 78 (78): 394-403, 1994

9 Fowler, J.W., "Scheduling of unrelated parallel machines an application to PWB manufacturing" 34 : 921-931, 2002

10 Hariri, A.M.A., "Heuristic for scheduling unrelated parallel machines" 18 (18): 323-331, 1991

11 Martello, S., "Exact and approximation algorithms for makespan minimization on unrelated parallel machines" 75 (75): 169-188, 1977

12 Plekar, U.S., "Duality based relaxations for makespan minimization for unrelated parallel machines" 31 (31): 1991