一种启发式算法求解批量计划和排序集成问题

A Heuristic Algorithm to Solve the Integrated Lot-sizing and Scheduling Problem

文章针对基于JIT思想建立的一种批量计划和作业排序集成问题,建立整体模型,设计了一种启发式算法采用集成方法求求解。针对问题的特点和遗传算法的特性,各层优化时均采用遗传算法求解,借鉴递阶优化方法的思想,首先从优化作业排序层出发,将其优化结果作为约束来优化批量计划层,然后利用利用批量优化的结果再重新来协调优化作业排序层,进而进一步去求解更好的批量计划。基于这种协调传递的思想,使各层的优化形成一个闭环,直到满足循环终止条件,得到比较理想的结果。最后通过算例试验表明,这种启发式算法与采用整体求解方法相比,具有比较满意的寻优性能和收敛速度。

A monolithic model of the lot-sizing and scheduling problem based on the JIT strategy has been proposed in this paper,and a heuristic algorithm using integrated method has been designed to solve it.According to the character of the problem,the GA has been used to optimize each stage respectively.Considering the hierarchical concept,the new heuristic algorithm starts from the scheduling sub-problem,and transfers its optimal result to the lotsizing problem as constrains,then feed back the optimized result of lot-sizing to the scheduling sub-problem to find a better scheduling.Following this kind of coordinated and transfer steps,the optimization of different stages repeats until the stop criterion is satisfied.The computational example shows that,the new heuristic algorithm get better performance and has a higher convergence speed comparing with the monolithic method.