Browse > Article

An Optimization of the Planned Target Sequencing Problem Using Scheduling Method  

Hwang, Won-Shik (육군 22사단 278포병대대 3포대장)
Lee, Jae-Yeong (국방대학교 운영분석과)
Publication Information
Journal of the military operations research society of Korea / v.33, no.1, 2007 , pp. 105-115 More about this Journal
Abstract
It is essential to give a fatal damage to the enemy force by using prompt and accurate fire in order to overcome the lack of artillery force. During the artillery fire operations, minimizing the firing time will secure the adapt ability in tactical operation. In this paper, we developed a mathematical model to schedule the artillery fire on the multiple targets to decrease total fire operation time. To design a program to describe a real firing situation, we consider many possible circumstances of changes such as commander's intention, firing constraints, target priority, and contingency plan to make a fire plan in an artillery unit. In order to work out the target sequencing problem, MIP is developed and the optimum solution is obtained by using ILOG OPL. If this analytical model is applied to a field artillery unit, it will improve the efficiency of the artillery fire force operations.
Keywords
Artillery fire force; Target sequencing; MIP;
Citations & Related Records
연도 인용수 순위
  • Reference
1 육군본부, '화력운용', 야전교범 6-1. 2001
2 육군본부, '화력운용 실무', 실무참고
3 Horowitz, E. and Sahni, S. 'Exact and approximate algorithms for scheduling non-identical processors', J. ACM, Vol. 23, No2, 1976
4 Ibarra, O.H. and Kim, C.E. 'Heuristic algorithms for scheduling independent tasks on non-identical processors', J. ACM, Vol. 24, 1997
5 Garey, M., Johnson, D., and Sehtis, R.,'The complexity of flow shop and job shop scheduling,' Mathematics of Operations Reserch, 1976
6 육군본부,'포병운용', 야전교범 2-2. 2002
7 Ojeong Kwon, Kyugsik Lee and Sungsoo Park, 'Targering and Scheduling Problem for Field Artillery', Computers ind. Engng Vol.33, Nos 3-4, pp.693- 696, 1997   DOI   ScienceOn
8 Hariri, A.M.A. and Potts, C.N. 'Heuristics for scheduling unrelated parallel machines', Computers Ops. Res., Vol.8, No.3, 1991
9 김기호,'포병 부대 계획표적 사격 순서 결정에 관한 연구', 고려대학교 논문, 2002
10 윤석진, '유연생산 시스템에서의 일정계획 및 작업순서의 최적화에 관한 연구' 연세대학교 논문, 1993
11 Pascal Van Hentenryck, 'ILOG OPL Studio 3.5 Language Manual', Massachusetts Institute of Technology, 1999
12 Karp, R.M. 'Reducibility among combinatorial problems', Complexity of Computer Computations, pp. 85-103, Pleum Press, New York, 1972
13 Ignall, E. and Schrage, L., 'Application of the barnch and bound technique to some flow shop scheduling problems,' Operation Reerarch, Vol. 13, 1965