基于遗传算法的作业车间模糊调度问题的研究

Study on Job Shop Fuzzy Scheduling Problem Based on Genetic Algorithm

在研究作业车间模糊调度问题的基础上 ,建立了两种作业车间模糊调度模型。对于只考虑模糊加工时间的问题 ,以最小完工时间作为优化目标 ;对于同时考虑模糊加工时间和模糊交货期的问题 ,以平均满意度最大作为优化目标。模糊加工时间用三角模糊数和梯形模糊数来表示 ,模糊交货期用梯形模糊数和六点模糊数来表示 ,给出了两种模糊数比较方法。应用遗传算法来求解最优调度顺序 ,并对遗传算法编码、初始种群的产生办法、解码、交叉及变异方法等方面做了研究。最后 ,给出了仿真实验结果和结论。

Two kinds of model are formulated based on the studies of job shop fuzzy scheduling problem. According to the model only with fuzzy processing time, the minimum fuzzy completion time is taken as the optimized object. As to the model with both fuzzy processing time and fuzzy due date, the maximum average agreement index is taken as the optimized object. Fuzzy processing time is denoted by triangular fuzzy number and trapezoid fuzzy number. Fuzzy due date is denoted by trapezoid fuzzy number and 6-point fuzzy number. Two fuzzy number comparison methods are given. Genetic algorithm is adopted to find the optimal scheduling sequence. Researches are made in aspects such as coding, decoding, crossover and mutation, etc. Finally, the experimental results and conclusion are given.