• 论文 •    

基于嵌套分区算法框架的清洗-炉管区批调度

苏国军,汪雄海   

  1. 浙江大学 电气工程学院,浙江杭州310027
  • 出版日期:2011-05-15 发布日期:2011-05-25

Batch scheduling of cleaning-furnace zone based on nested partitions algorithm

SU Guo-jun, WANG Xiong-hai   

  1. College of Electrical Engineering, Zhejiang University, Hangzhou 310027, China
  • Online:2011-05-15 Published:2011-05-25

摘要: 针对半导体生产线清洗-炉管区存在的Lot动态达到的并行批处理机优化调度问题,提出了嵌套分区差分进化算法,该算法充分利用嵌套分区算法的全局并行搜索的优势和差分进化算法较强的局部寻优能力。差分进化算法用来优化嵌套分区框架各可行域中抽样得到的样本群,使嵌套分区在选区阶段能更精确跟踪最有希望域,减少算法的回溯过程。通过仿真模型和实际生产线数据对该调度方案进行了比较验证,结果表明,所提算法较其他启发式算法能更有效降低总加权拖期交货损失。

关键词: 半导体生产线, 并行批处理机, 优化, 调度, 嵌套分区, 总加权拖期交货损失

Abstract: Aiming at the scheduling problem for parallel batching machines with incompatible families and dynamic Lot arrivals in the cleaning-furnace zone of semiconductor production line, the Nested Partitions based on Differential Evolution(NPDE)algorithm was proposed. This algorithm made full use of advantages of global concurrent search of NPDE algorithm and local search capability of DE. To have a greater probability to track the most promising region of nested partitions, the DE was used to optimize the sample group from feasible region of nested partitions to reduce backtracking process. The data of simulation models and the actual production line were used to testify the effectiveness of the NPDE to minimize the Total Weighted Tardiness (TWT). Simulation results show that the propose algorithm was more effective than other heuristic algorithms.

Key words: semiconductor production line, parallel batching machine, optimization, scheduling, nested partitions, total weighted tardiness

中图分类号: