摘要
针对混合Flowshop调度问题,在NEH算法基础上提出了改进的基于两步法的NEH算法——TNEH算法。针对半导体封装生产实际调度问题,提出了最优匹配设备规则与求解Makespan最小的调度目标的下界算法。最后利用仿真评估软件在多种混合流水线配置下,对Palmer、Gupta、NEH、MNEH与TNEH算法进行对比验证。
It presents a new approach of improved NEH algorithm for hybrid flowshop scheduling. It uses the most match machine rule to allocate parallel machines, introduces a lower bound for the maximum completion time （makespan） criterion. It builds several simulation models of HFS scheduling to compare the effect of different heuristics algorithm.
