基于改进的多元宇宙算法的晶圆生产调度算法

Wafer Production Scheduling Algorithm Based on Improve Multiverse Algorithm

针对以最小化最大完工时间为目标的晶圆生产制造系统的调度问题,提出了改进的多元宇宙算法。根据晶圆生产制造系统的特征,构建了一个整数规划模型。针对原始多元宇宙算法的局限性,分别从使用启发式规则生成初始种群、重新定义向最优宇宙移动策略和宇宙更新策略三个方面对算法进行改进。将原始多元宇宙算法、遗传算法、NEH启发式算法、迭代贪婪算法以及通过不同策略改进的多元宇宙算法进行对比实验,结果表明,所提方法可以高效地解决晶圆制造过程中的复杂现象。

An improved multiverse algorithm was proposed to solve the scheduling problem of wafer manufacturing systems with the aim of minimizing the maximum completion time.An integer programming model was constructed according to the characteristics of the wafer manufacturing system.In view of the limitations of the original multiverse algorithm,the algorithm was improved from three aspects:the use of heuristic rules to generate the initial population,the redefinition of the strategy of moving to the optimal universe and the strategy of updating the universe.Comparative experiments were conducted on the original multiverse algorithm,genetic algorithm,NEH heuristic algorithm,greedy iteration algorithm,and multiverse algorithms improved by different strategies.The results showed that the proposed algorithm could effectively deal with the complex characteristics of wafer manufacturing systems.