摘要
本文研究了总的流程时间最小的多机调度问题,建立了该问题的数学模型,并用一种改进遗传算法有效解决了该问题.这种改进遗传算法的关键是产生一组较优的初始群体,仿真实验结果表明这种改进遗传算法可以快速。
In this psper, the model of the multi - machine scheduing problem for minimizing total flow time was propssed and established. It is solved using a improved genetic Algorithrm. The key of the improved Genetic Algorithm lies in generation an initial populatoon of chromosomes of optimaler. The results of the simulatedexperiment show the improved Genetic Algorithnn can find out global optimal solutions fast and efficiently
