Countermaneuver support mission scheduling considering the job splitting and cooperation property

Abstract

In this thesis, we propose a Mixed integer programming model for countermaneuver support mission planning through parallel machine scheduling, and conduct a study to optimally schedule the missions assigned to the army engineer troops. In addition, the concept of cooperation by platoons is proposed to shorten the mission completion time by minimizing the imbalance of mission completion time for each engineer platoon. 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.