异构系统中改进的遗传调度算法

摘要

Because of the deficiencies of conventional genetic algorithm applied in task scheduling problem, this paper presents an improved scheduling algorithm based on genetic algorithm. It uses the rank up attribute values of tasks in the construction of the chromosome, in order to schedule the more important tasks preferentially, the task sequence of chromosome sorts in descending order according to rank up. Thus it can get the initial population of high quality, and the Genetic Algorithm(GA) has a good starting point for iteration. Experimental results show the algorithm can improve the quality of the population effectively, and the better scheduling performance is obtained than other conventional algorithms.%针对以往调度算法无法准确反映任务的优先级的问题,提出一种改进的遗传调度算法.将任务的ranku属性值应用于染色体的构造方法中,即根据ranku属性值降序排列得到染色体的任务序列,使重要任务优先获得调度,从而得到优质的初始种群,为遗传算法提供合适的迭代起点.实验结果表明,该算法能有效提高初始种群的质量,获得更好的调度性能.