基于IOCDGA的模糊目标柔性作业车间调度优化

具有模糊目标要求的柔性作业车间调度，是柔性作业车间调度的扩展，它能够满足生产实际中对成本、生产周期及交货期等多方面指示的要求。与多目标调度相比，它还能够处理非精确指标要求问题，并且可以满足关键零件的特殊要求。为了实现对具有模糊目标柔性作业车间调度优化，提出了一种具有个体优化群体多样性的遗传算法（IOCDGA），以加快收敛速度，避免早熟问题。该算法针对文中的编码方法，定义了群体平均差及熵，用来表示群体的多样性指标。通过多样性指标控制交叉率和变异率，该算法的进化侧重于单个或少数个体达到最优，而不是传统GA中的全部个体均为最优。计算结果表明，该算法可行，并减少了迭代次数。

FLEXIBLE JOB-SHOP SCHEDULING WITH FUZZY GOAL THROUGH IOCDGA

The fuzzy goal flexible job-shop scheduling problem (FGFJSP) is the extension of FJSP. Compared with the convention JSP, it can solve the fuzzy goal problem and meet suit requirements of the key job. The multi-object problem, such as the fuzzy cost, the fuzzy due-date, and the fuzzy makespan, etc, can be solved by FGFJSP. To optimize FGFJSP, an individual optimization and colony diversity genetic algorithm (IOCDGA) is presented to accelerate the convergence speed and to avoid the earliness. In IOCDGA, the colony average distance and the colony entropy are defined after the definition of the encoding model. The colony diversity is expressed by the colony average distance and the colony entropy. The crossover probability and the mutation probability are controlled by the colony diversity. The evolution emphasizes that sigle individual or a few individuals evolve into the best in IOCDGA, but not the all in classical GA. Computational results show that the algorithm is applicable and the number of iterations is less.