关键词: 遗传算法, 禁忌搜索算法, 双资源, 车间调度, 优化

Abstract: In order to avoid the premature convergence and to balance the exploration and exploitation abilities of simple GA, a hybrid algorithm is proposed to solve dynamic scheduling problem in flexible production environment. It combines the advantage of global search ability of GA with the self-adaptive merit of tabu search and improves its convergence. It is proved capable of providing optimized schedule to the job-shop where the machine tool and manpower resources are both constrained. After crossover and mutation operations, an optimal or suboptimal scheduling plan can be found. The result of the test shows that this method is feasible and efficient.