This paper considers the simultaneously firing model for the artillery operations. The objective of this paper is to find the optimal fire sequence minimizing the final completion time of the firing missions of multiple artillery units for multiple targets. In the problem analysis, we derive several solution properties to reduce the solution space. Moreover, two lower bounds of objective are derived and tested along with the derived properties within a branch-and-bound scheme. Two efficient heuristic algorithms are also developed. The overall performances of the proposed branch-and-bound and heuristic algorithms are evaluated through various numerical experiments.

1. 서론
 2. 문제정의와 수리모형
 3. 분지한계법(Branch-and-Bound Algorithm)
  3.1. 분지규칙(branching rule)
  3.2. 노드제거규칙(fathoming rules)
  3.3. 한계규칙(bounding rule)
  3.4. 휴리스틱(heuristic algorithm)
 4. 성능 평가
 5. 결론
 참고문헌

• 윤상흠(영남대학교 경영학부, School of Business, Yeungnam University) | Sang Hum Yoon
• 황원식(육군3사관학교 운영분석학과, Operations Analysis Department, Korea Army Academy) | Won-Shik Hwang
• 전재호(충주대학교 행정학부 행정정보시스템학전공, Division of Public Management Information System, Chungju National University) | Jaeho Juhn
• 이익선(동아대학교 경영학부, School of Business, Dong-A University) | Ik Sun Lee 교신저자