Scheduling method of maintenance support resource with task timing constraint

Maintenance support resource scheduling (MSRS) problem has attracted increasing attention in modern battle. It aims to allocate resources from multi-supply points to multi-tasks with the shortest time. However, there exists various constraints which are difficult to satisfy at the same time, such as limited resource reserves, different resource requirements, complex route conditions and strict task timing. As a result, we first obtain the shortest routes and task sequence with route planning and topological sorting algorithms separately. Then, with these information, an integrated meta-heuristic algorithm (IMHA) is designed to solve all the constraints. Furthermore, two improved algorithms, CMHA and GMHA are generated with classical and greedy scheduling strategies respectively. Experiment results show the feasibility of IMHA in solving the MSRS problem with timing constraint. Besides, compared with the IMHA, the GMHA and CMHA can generate scheduling schemes with lower cost and time in the whole 24 instances. In addition, as the increase of proportion of timing tasks, the advantages of GMHA in cost and time are more evident.