首页> 中文期刊> 《上海交通大学学报:英文版》 >The Dynamic Scheduling Model of Battlefield Rush-Repair Tasks

The Dynamic Scheduling Model of Battlefield Rush-Repair Tasks

         

摘要

During the war,equipment is constantly being damaged with limited battlefield rush-repair time and power.Therefore,some military problems are presented in this paper.In order to get more fighting time for damaged equipment to participate in operation again as much as possible,three problems should be considered properly.The first problem is how to dynamically choose the most suitable damaged equipment for each repair group.The second one is how to divide tasks between different groups.The third one is how to determine execution sequence in the same group.A mathematical model is established to solve the dynamic battlefield rushrepair task scheduling problem(DBRTSP) in wartime.A variant genetic algorithm is designed to dynamically track the change of the optimal solution.A scheduling example is solved through Matlab.Results show that the proposed model is not only scientific and reasonable,but also convenient and efficient.

著录项

相似文献

  • 中文文献
  • 外文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号