摘要
针对一类具有路径柔性的车间调度问题,在考虑遗传算法早熟收敛问题和禁忌搜索法自适应优点的基础上,将遗传算法和禁忌搜索法结合起来,提出了基于遗传和禁忌搜索的优化调度算法,并用实例证实了该算法的有效性。
Aiming at a class of job shop scheduling problem with routing flexibility, an optimal scheduling algorithm that combines Genetic Algorithm (GA) with Tabu Search (TS) is put forward. The algorithm considers the premature convergenceof GA and self-adaptive merit of TS, and the effectiveness of the algorithm is proven by examples.
基金
科技部科技型中小企业创新基金资助项目(00C26213711258)。~~
关键词
作业车间
路径柔性
禁忌搜索
遗传算法
job shop
routing flexibility
tabu search
genetic algorithm
