柔性作业车间调度(FJSP)中,在将任务按顺序分配到各机床前,首先要为任务选择加工机床。为求解多目标FJSP,本文在分析该问题特点的基础上,提出了一种面向甘特图的串编码(GORS)及相应的的遗传算法算子的基本操作,提出了集成算子遗传算法,并给出了其具体实现。文献算例的实验及与国际最近研究成果比较表明。该算法减小了目标参数值即生产周期、最大机床负载和总的机床负载。
In the flexible job-shop scheduling problem (FJSP), each operation has to be assigned to a machine from a set of capable machines before alocating the assigned operations on all machines. To solve the multi-objective FJSP, the Grantt graph oriented string representation (GOSR) and the basic manipulation of the genetic algorithm operator are presented. An integrated operator genetic algorithm (IOGA) and its process are described. Comparison between computational results and the latest research shows that the proposed algorithm is effective in reducing the total workload of all machines, the makespan and the critical machine workload.