References
- 김동현, 이영훈, "표적 할당과 사격 순서의 동시 결정 문제를 위한 발견적 기법", 한국경영과학회지, 제35권, 제1호(2010), pp.47-65.
- 윤상흠, 황원식, 전재호, 이익선, "포병부대 사격 순서결정을 위한 분지한계 알고리즘 연구", 산업경영시스템학회지, 제33권, 제3호(2010), pp. 154-161.
- 이대력, 양재환, "혼합정수계획법을 이용한 요격미사일의 할당 및 교전 일정계획에 관한 연구", 경영과학, 제32권, 제4호(2015), pp.109- 133. https://doi.org/10.7737/KMSR.2015.32.4.109
- 정치영, 이재영, 이상현, "격추확률 최대화를 위한 미사일 최적배치 문제", 경영과학, 제27권, 제1호(2010), pp.75-90.
- 차영호, 방준영, "최소 종료시간 사격 스케줄을 위한 분지계획법 알고리즘 연구", 산업경영시스템학회지, 제38권, 제4호(2015), pp.132-141. https://doi.org/10.11627/jkise.2015.38.4.132
- 최용백, 김경섭, "포병부대 비계획 사격순서 결정 알고리즘", 산업경영시스템학회지, 제35권, 제2호(2012), pp.37-44.
- Amoura, A.K., E. Bampis, C. Kenyon, and Y. Manoussakis, "Scheduling independent multiprocessor tasks," Algorithmica, Vol.32, No.2 (2002), pp.247-261. https://doi.org/10.1007/s00453-001-0076-9
- Bianco, L., P. Dell'Olmo, and M.G. Speranza, "Nonpreemptive scheduling of independent tasks with prespecified processor allocations," Naval Research Logistics, Vol.41, No.7(1994), pp.959- 971. https://doi.org/10.1002/1520-6750(199412)41:7<959::AID-NAV3220410708>3.0.CO;2-K
- Blazewicz, J., P. Dell'Olmo, M. Drozdowski, and M. Speranza, "Scheduling multiprocessor tasks on three dedicated processors," Information Processing Letters, Vol.41, No.5(1992), pp.275-280. https://doi.org/10.1016/0020-0190(92)90172-R
- Bozoki, G. and J.P. Richard, "A branch and bound algorithm for the continuous-process job-shop scheduling problems," AIIE Transactions, Vol.2, No.3(1970), pp.246-252. https://doi.org/10.1080/05695557008974759
- Brucker, P. and A. Kramer, "Polynomial algorithms for resource-constrained and multiprocessor task scheduling problems," Euro-pean Journal of Operational Research, Vol.90, No.2(1996), pp.214-216. https://doi.org/10.1016/0377-2217(95)00350-9
- Chen, J. and A. Miranda, "A polynomial time approximation scheme for general multiprocessor job scheduling," SIAM Journal on Computing, Vol.31, No.1(2001), pp.1-17. https://doi.org/10.1137/S0097539798348110
- Chen, J. and C.-Y. Lee, "General multiprocessor tasks scheduling," Naval Research Logistics, Vol.46, No.1(1999), pp.57-74. https://doi.org/10.1002/(SICI)1520-6750(199902)46:1<57::AID-NAV4>3.0.CO;2-H
- Dell'Olmo, P., M.G. Speranza, and Z. Tuza, "Efficiency and effectiveness of normal schedules on three dedicated processors," Discrete Mathematics, Vol.164, No.1(1997), pp.67-79. https://doi.org/10.1016/S0012-365X(97)84781-4
- Drozdowski, M., "Scheduling multiprocessor tasks-An overview," European Journal of Operational Research, Vol.94, No.2(1996), pp.215- 230. https://doi.org/10.1016/0377-2217(96)00123-3
- Garey, M.R. and D.S. Johnson, Computers and intractability : a guide to the theory of NPcompleteness, San Francisco : Freeman, 1979.
- Goemans, M.X., "An approximation algorithm for scheduling on three dedicated machines," Discrete Applied Mathematics, Vol.61, No.1 (1995), pp.49-59. https://doi.org/10.1016/0166-218X(94)00160-F
- Hall, L.A., Approximation algorithms for scheduling, PWS Publishing Company, (1997), pp. 1-45.
- Hoogeveen, J.A., S.L. Van de Velde, and B. Veltman, "Complexity of scheduling multiprocessor tasks with precified processor allocations," Discrete Applied Mathematics Vol.55, No.3(1994), pp.259-272. https://doi.org/10.1016/0166-218X(94)90012-4
- Huang, J., J. Chen, S. Chen, and J. Wang, "A simple linear time approximation algorithm for multi-processor job scheduling on four processors," Journal of Combinatorial Optimization, Vol.13(2007), pp.33-45.
- Jansen, K. and L. Porkolab, "General multiprocessor task scheduling : approximate solutions in linear tim," SIAM Journal on Computing, Vol.35, No.5(2005), pp.519-530. https://doi.org/10.1137/S0097539799361737
- Kim, D.-H. and Y.-H. Lee, The heuristic algorithm for the fire target allocation and sequencing problem, Proceedings of the 2008 spring KIIE conference, Pohang, Korea, 2008.
- Kim, T.-H. and Y.-H. Lee, Fire sequencing problem with shared targets, Korean Operations Research and Management Society, Vol.28, No.4(2003), pp.123-134.
- Kramer, A., "Branch and bound methods for scheduling problems with multiprocessor tasks on dedicated processors," OR Spektrum, Vol.19, No.3(1997), pp.219-227. https://doi.org/10.1007/BF01545591
- Kubale, M., "The complexity of scheduling independent two-processor tasks on dedicated processors," Information Processing Letters, Vol.24, No.3(1987), pp.141-147. https://doi.org/10.1016/0020-0190(87)90176-1
- Kwon, O.-J., K.-S. Lee, and S.-S. Park, "Targeting and scheduling problem for field artillery," Computers and Industrial Engineering, Vol.33, No.3-4(1997), pp.693-696. https://doi.org/10.1016/S0360-8352(97)00224-6
- Lee, C.-Y., L. Lei, and M. Pinedo, "Current trends in deterministic scheduling," Annals of Operations Research, Vol.70(1997), pp.1-41. https://doi.org/10.1023/A:1018909801944
- Nawaz, M., E.E. Enscore, and I. Ham, "A heuristic algorithm for the m-machine, n-job flowshop sequencing problem," Omega, Vol.11, No.1 (1983), pp.91-95. https://doi.org/10.1016/0305-0483(83)90088-9