摘要
柔性作业车间调度问题是经典作业车间调度问题的扩展,它允许工序在多台机器中的任意一台上加工。针对柔性作业车间调度问题的特点,提出一种扩展的基于工序的编码及其主动调度的解码机制,并设计一种初始解产生机制和两种有效的交叉和变异操作。为了克服传统遗传算法早熟和收敛慢的缺点,设计了精英解保留策略和子代产生模式结合的改进遗传算法应用于该调度问题。最后运用提出的算法求解基准测试问题验证算法的有效性。
The Flexible Job-shop Scheduling problem （FJSP） is a generalization of the classical JSP, where operations are allowed to be processed on any among a set of available machines. According to the characteristics of the FJSP, an extended operation-based coding and its decoding mechanism of active scheduling is presented. Also, a mechanism of generating the initial solutions and two effective crossover operators and mutation operators are designed for the genetic algorithm. In order to preserve the good characteristics of the previous generation and reduce the disruptive effects of genetic operators, an improved genetic algorithm which combines elitist model and generation alteration model of genetic algorithm is proposed to solve the FJSP. The proposed algorithm is tested on a set of standard instance taken from the literature and compared with other approaches. The results have shown the effectiveness of the algorithms.
出处
《工业工程与管理》
北大核心
2009年第2期59-66,共8页
Industrial Engineering and Management
基金
国家高技术研究发展计划(863)(2007AA04Z107
2007AA04Z190)
国家自然科学基金(70772056)
关键词
柔性作业车间调度
遗传算法
交叉操作
变异操作
flexible job-shop scheduling problem
genetic algorithm
crossover operator
mutation operator
