装配作业车间分批调度问题的算法对比

A Comparative Study of the Algorithm of Assembly Job Shop Lot Streaming Scheduling

建立最小化makespan的装配作业车间分批调度模型,利用遗传算法构建基于整体集成优化策略、分层迭代优化策略和双层进化策略的求解算法。它们的区别在于处理批量划分问题和子批调度问题的联合优化机制不同。最后通过仿真实验对比了几类算法的求解效果和收敛速度,并分析了它们的适应性特点。

A batch scheduling model of assembly job shop with minimum makespan is established.The genetic algorithm is used to construct a solution algorithm based on the overall optimization strategy,hierarchical iterative optimization strategy and bilevel evolution strategy.The difference between them is the optimization mechanisms to deal with the batch division problem and the sub-batch scheduling problem.Finally,through the simulation experiment,the solution effect and convergence speed of several kinds of algorithms are compared,and adaptability are also analyzed.