摘要
古典作业车间调度问题已经被研究了几十年并证明为 NP-hard问题。柔性作业车间调度是古典作业车间调度问题的扩展 ,它允许工序由一个机床集合中的任意一台加工 ,调度的目的是将工序分配给各机床 ,并对各机床上的工序进行排序以使完成所有工序的时间最小化。本文采用遗传算法进行柔性作业车间调度研究 ,针对柔性作业车间问题提出了一种新颖直观的基因编码方法 ,从而取消了运用遗传算法求解作业车间问题时为使基因合法化而进行的基因修复过程 ,仿真结果表明用该遗传算法解决柔性作业车间调度问题是有效的。
The job shop scheduli ng problem has been studied for decades and known as an NP-hard problem. The fl exible job shop scheduling problem is a generalization of the classical job sche duling problem that allows an operation to be processed on one machine out of a set of machines. The problem is to assign each operation to a machine and find a sequence for the operations on the machine in order that the maximal completion time of all operations is minimized. A genetic algorithm is used to solve the f lexible job shop scheduling problem. A novel gene coding method aiming at job sh op problem is introduced which is intuitive and does not need repairing process to validate the gene. Computer simulations are carried out and the results show the effectiveness of the proposed algorithm.
基金
国家自然科学基金(编号:59990470)资助项目
