1 |
Choi, Y.-B., Jin, S.-H., and Kim, K.-S., Deterministic and robust optimization approach for single artillery unit fire scheduling problem, Applied Sciences, 2017, Vol. 7, No. 10, 1038.
DOI
|
2 |
Choi, Y.-J. and Lee, I.-S., A fire sequencing problem to minimize the total weighted firing completion time of the artillery weapons, Industrial Engineering & Management Systems, 2018, Vol. 17, No. 2, pp. 249-258.
DOI
|
3 |
Day, R.H., Allocating weapons to target complexes by means of nonlinear programming, Operations Research, 1966, Vol. 14, No. 6, pp. 992-1013.
DOI
|
4 |
Dell'Olmo, P., Speranza, M.G., and Tuza, Z., Efficiency and effectiveness of normal schedules on three dedicated processors, Discrete Mathematics, 1997, Vol. 164, No. 1-3, pp. 67-79.
DOI
|
5 |
Drozdowski, M., Scheduling multiprocessor tasks-An overview, European Journal of Operational Research, 1996, Vol. 94, No. 2, pp. 215-230.
DOI
|
6 |
Garey, M.R. and Johnson, D.S., Computers and intractability : a guide to the theory of NP-completeness, 1979 (San Francisco : Freeman).
|
7 |
Goemans, M.R., An approximation algorithm for scheduling on three dedicated machines, Discrete Applied Mathematics, 1995, Vol. 61, No. 1, pp. 49-59.
DOI
|
8 |
Hall, L.A., Approximation algorithms for scheduling, 1997(PWS Publishing Company, pp 1-45).
|
9 |
Huang, J., Chen, J., Chen, S., and Wang, J., A simple linear time approximation algorithm for multi-processor job scheduling on four processors, Journal of Combinatorial Optimization, 2007, Vol. 13, No. 1, pp. 33-45.
DOI
|
10 |
Karasakal, O., Air defense missile-target allocation models for a naval task group, Computers & Operations Research, 2008, Vol. 35, No. 6, pp. 1759-1770.
DOI
|
11 |
Kim, D.-H. and Lee, Y.-H., The heuristic algorithm for the fire target allocation and sequencing problem, Proceedings of the 2008 spring KIIE conference, 2008, Pohang, Korea.
|
12 |
Kline, A., Ahner, D., and Hill, R., The weapon-target assignment problem, Computers and Operations Research, 2018, In Press.
|
13 |
Kwon, O.-J., Kang, D.-H., Lee, K.-S., and Park, S.-S., Lagrangian relaxation approach to the targeting problem, Naval Research Logistics, 1999, Vol. 46, No. 6, pp. 640-653.
DOI
|
14 |
Kwon, O.-J., Lee, K.-S., and Park, S.-S., Targeting and scheduling problem for field artillery, Computers & Industrial Engineering, 1997, Vol. 33, No. 3-4, pp. 693-696.
DOI
|
15 |
Kwon, O.-J., Lee, K.-S., Kang, D.-H., and Park, S.-S., A branch-and-price algorithm for a targeting problem, Naval Research Logistics, 2007, Vol. 54, No. 7, pp. 732-741.
DOI
|
16 |
Lee, C.-Y., Lei, L., and Pinedo, M., Current trends in deterministic scheduling, Annals of Operations Research, 1997, Vol. 70, pp. 1-41.
DOI
|
17 |
Li, X., Zhou, D., Pan, Q., Tang, Y., and Huang, J., Weapon-target assignment problem by multiobjective evolutionary algorithm based on decomposition, Complexity, 2018, Vol. 2018, p. 19.
|
18 |
Lloyd, S.P. and Witsenhausen, H.S., Weapons allocation is NP-complete, Proceedings of the 1986 Summer Conference on Simulation : NV, USA, pp. 1054-1058.
|
19 |
Manne, A., A target assignment problem, Operations Research, 1958, Vol. 6, No. 3, pp. 346-351.
DOI
|
20 |
Taylor, J.L. and Walsh, J.E., Planning by resource allocation methods-illustrated by military applications, Operations Research, 1964, Vol. 12, No. 5, pp. 693-706.
DOI
|
21 |
Chen, J. and Lee, C.-Y., General multiprocessor tasks scheduling, Naval Research Logistics, 1999, Vol. 46, No. 1, pp. 57-74.
DOI
|
22 |
Kim, T.-H. and Lee, Y.-H., Fire sequencing problem with shared targets. Korean Operations Research and Management Society, 2003, Vol. 28, No. 3, pp. 123-134.
|
23 |
Amoura, A.K., Bampis, E., Kenyon, C., and Manoussakis, Y., Scheduling independent multiprocessor tasks, Algorithmica, 2002, Vol. 32, No. 2, pp. 247-261.
DOI
|
24 |
Blazewicz, J., Dell'Olmo, P., Drozdowski, M., and Speranza, M., Scheduling multiprocessor tasks on three dedicated processors, Information Processing Letters, 1992, Vol. 41, No. 5, pp. 275-280.
DOI
|
25 |
Bozoki, G. and Richard, J.P., A branch and bound algorithm for the continuous-process job-shop scheduling problems, AIIE Transactions, 1970, Vol. 2, No. 3, pp. 246-252.
DOI
|
26 |
Cetin, E. and Esen, S.T., A weapon-target assignment approach to media allocation, Applied Mathematics Computation, 2006, Vol. 175, No. 2, pp. 1266-1275.
DOI
|
27 |
Cha, Y.-H. and Bang, J.-Y., A branch-and-bound algorithm to minimize the makespan in a fire scheduling problem, Journal of Society of Korea Industrial and Systems Engineering, 2015, Vol. 38, No. 4, pp. 132-141.
DOI
|
28 |
Chang, T., Kong, D., Hao, N., Xu, K., and Yang, G., Solving the dynamic weapon target assignment problem by an improved artificial bee colony algorithm with heuristic factor initialization, Applied Soft Computing, 2018, Vol. 70, pp. 845-863.
DOI
|