基于变领域遗传算法的生产流水线物流调度

Production pipeline logistics scheduling based on variable domain genetic algorithm

生产计划和调度是制造企业的核心问题,工件的延迟或提前会带来额外库存、价格变动、产品损耗等多种问题。文中基于准时化模式的生产理念,研究考虑机器准备时间的两阶段生产流水线物流的工件最佳排序问题。以最小化最大拖期和提前期为目标函数,提出了一种变邻域遗传搜索算法。该算法将遗传算法求得的最优解作为变邻域搜索的初始解,利用变邻域搜索较好的局部搜索能力进行精细搜索,以提高算法的求解质量。通过仿真实验和算法比较验证了变邻域遗传搜索算法的有效性。

Production planning and scheduling is the core issue of manufacturing enterprises,the delay of the workpiece or advance will bring additional inventory,price changes,product loss and other issues.Based on the production concept of the punctualized model,this paper studies on the optimal sorting of the workpiece in the two-stage production line logistics considering the machine preparation time. In order to minimize the maximum delay and lead time as the objective function,a variable neighborhood genetic search algorithm is proposed. The algorithm uses the optimal solution obtained by the genetic algorithm as the initial solution of the variable neighborhood search,and makes a fine search by using the local search ability of the neighborhood search to improve the quality of the algorithm. The validity of the variable neighborhood genetic search algorithm is verified by the simulation experiments and algorithm comparison.