摘要： 针对复杂维修任务调度问题，用Matlab编写的程序计算出满足约束条件的几组备选分配方案，筛选出有用方案后，用遗传算法计算各备选分配方案下的总维修跨度时间，取其中时间最短的作为最终方案并绘制甘特图。根据甘特图采用Extend软件对调度过程进行仿真，结果证明，该算法理论调度方案的总维修跨度时间和Extend仿真时间一致，能有效节省维修时间。

关键词: 任务调度, 遗传算法, 甘特图, Extend技术

Abstract: This paper studies the problem of complex maintenance tasks scheduling and uses Matlab program to calculate several sets of distribution options which meet the constraints. After selecting the useful plans, the time-span of the total maintenance of the distribution options are calculated by using Genetic Algorithm(GA), so that the final plan with the shortest time is got and its Gantt chart is drew. According to the Gantt chart, it uses software Extend to simulate the scheduling process. The result proves that the time-span of the total maintenance of theoretic schedule is consistent with the time of Extend simulation, and it can save maintenance time effectively.

Key words: task schedule, Genetic Algorithm(GA), Gantt chart, Extend technology

中图分类号: 

• E 917