An Improved Genetic Algorithm for Solving the Mixed⁃Flow Job⁃Shop Scheduling Problem with Combined Processing Constraints

一种基于改进遗传算法的组合加工约束混流车间调度方法

The flexible job-shop scheduling problem(FJSP)with combined processing constraints is a common scheduling problem in mixed-flow production lines.However,traditional methods for classic FJSP cannot be directly applied.Targeting this problem,the process state model of a mixed-flow production line is analyzed.On this basis,a mathematical model of a mixed-flow job-shop scheduling problem with combined processing constraints is established based on the traditional FJSP.Then,an improved genetic algorithm with multi-segment encoding,crossover,and mutation is proposed for the mixed-flow production line problem.Finally,the proposed algorithm is applied to the production workshop of missile structural components at an aerospace institute to verify its feasibility and effectiveness.

具有组合加工约束的柔性作业车间调度问题是混流生产线中常见的任务排产问题。然而,传统车间调度方法均未将组合加工约束考虑进调度模型中,无法满足混线生产模式的现实情况。针对这一问题,分析了混流生产线的工艺状态模型。在此基础上,基于传统柔性作业车间调度问题,建立了具有组合加工约束的混线车间调度问题的数学模型。然后,针对组合加工约束,提出了一种改进的多段编码、交叉、变异的遗传算法。最后,将该算法应用于某航空航天研究所导弹结构件生产车间,验证了该方法的可行性和有效性。