含区间参数的战场资源动态调度模型及算法.

Battlefield resource scheduling problem is a research hotspot in the operational field. This paper described the problem, analyzed the dynamic resource scheduling requirement and built a dynamic resource scheduling model that contained interval parameters. To solve this model, three greedy strategies which were called basic greedy strategy, dual greedy strategy and consistent greedy strategy were designed and an integrated greedy algorithm was put forward. Finally, the proposed method was tested with a case of joint campaign and the results show that the method is well-performed in the uncertain battlefield environment. [ABSTRACT FROM AUTHOR]