摘要
描述了作业车间调度问题,提出一种求解作业车间调度问题的改进的遗传算法。该算法对交叉算子和变异算子进行改进,能有效避免局部最优。通过对实例的计算和分析,取得了良好的调度效果,论证了该算法的有效性和稳定性。
The job shop scheduling problem is described and an improved genetic algorithm is proposes. It improves and designs crossover operation and mutation operation for avoiding the local optimum. By testing and analysing some instances, it gets good computational results. Experiments show that the algorithm is efficient and stable.
出处
《计算机与现代化》
2007年第11期32-34,共3页
Computer and Modernization
关键词
作业车间调度
遗传算法
适应度函数
可行解
遗传算子
job shop scheduling
genetic algorithm
fitness function
feasible solution
genetic operator
