협업을 고려한 대기동지원임무 일정계획 연구Study on Countermaneuver Support Mission Scheduling Considering Cooperation

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 327
  • Download : 0
In this paper, we propose a MIP model for optimal planning of Countermaneuver Support Mission (CSM) through parallel machine scheduling. CSM is carried out by battle platoons of Engineer company, and is a military operation to stop or delay the enemy’s maneuver by using rockfall or bridge-blowing up. The concept of cooperation by platoons is proposed to shorten the mission completion time. We propose experimental results that the mission completion time with consideration of cooperation is shorter than that without consideration of cooperation. Additionally, we confirm that cooperation is still effective in shortening the mission completion time even if the capability is not at its maximum and is reduced by a certain ratio. Finally, since the parallel machine scheduling problem belongs to the NP-hard problem, we propose a solution approach using genetic algorithm in order to obtain a near optimal solution of a larger scale problem within a fast computation time.
Publisher
대한산업공학회
Issue Date
2018-04
Language
Korean
Keywords

Military Mission Planning; Parallel Machine Scheduling; Cooperation; Genetic Algorithm

Citation

대한산업공학회지, v.44, no.2, pp.114 - 123

ISSN
1225-0988
DOI
10.7232/JKIIE.2018.44.2.114
URI
http://hdl.handle.net/10203/244069
Appears in Collection
IE-Journal Papers(저널논문)
Files in This Item
There are no files associated with this item.

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0