柔性作业车间调度问题及其算法的研究

Research on Flexible Job Shop Scheduling Problem and Its Algorithm

简要分析多品种小批量车间调度问题的特点,并根据轴承套圈磨削加工过程的实际情况,考虑相邻工序间工件的准备时间,建立以最小化最大完工时间为优化目标的柔性作业车间调度模型。针对遗传算法在求解过程中存在的缺陷,在总结前人经验的基础上设计出有效的染色体编码方式,以期提高种群的求解效率,避免早熟和局部最优的产生,最后,用MATLAB对算法进行求解,得出仿真结果及相应甘特图,对提出算法的可行性和有效性进行验证。

The scheduling problems are analyzed briefly,which is based on characteristics of multi-variety small-batch shop.Based on actual situation during grinding process of bearing rings,considering preparation time of workpiece between adjacent processes,the minimization of maximum completion time is taken as an optimization goal,a flexible job shop scheduling model is established.Aimed at shortcomings of genetic algorithm during solving process,based on previous experience,the effective chromosome coding method is designed to improve solving efficiency of population and avoid premature and local optimal generation.Finally,the algorithm is solved by MATLAB,and the simulation results and corresponding Gantt charts are obtained.The feasibility and effectiveness of proposed algorithm are verified.