期刊文献+

多批次晶圆切换工时的计算及排序

Research on Makespan Calculation and Ranking of Multiple Wafer Batches Switching
原文传递
导出
摘要 随着晶圆制造趋于多品种、小批量的特点,组合设备运行时需要频繁地切换晶圆批次加工。为了提高组合设备的工作效率,研究单臂组合设备中晶圆批次切换工时的计算及排序问题。首先,基于改进的拉式调度策略,分析了单臂组合设备中连续两批晶圆加工的切换过程,并获得相应切换工时的计算表达式。其次,针对多批次晶圆的切换问题,建立了以最小切换总工时为目标的数学模型,并应用模拟退火算法求解近似最优的排序方案。最后,通过仿真实验验证了该方法的可行性和有效性。 Due to the trends of multi-varieties and smaller batch sizes in wafer manufacturing, cluster tools need to switch from processing one wafer batch to another frequently. To improve the efficiency of cluster tools, the scheduling problem that makespan calculation and ranking of wafer batches switching were addressed. Firstly, the switching process between two consecutive batches were analyzed in single-armed cluster tools based on the modified backward scheduling strategy. Then the corresponding closed-form expressions for makespan were derived. Secondly, a mathematical model for minimizing the total processing time of multiple wafer batches switching process was developed. Based on the mathematical model, an approximate optimal ranking scheme for multiple wafer batches switching were obtained by using simulated annealing. Finally, the simulation results showed the feasibility and validity of the proposed method.
作者 潘春荣 李超东 PAN Chunrong;LI Chaodong(School of Mechanical and Electrical Engineering,Jiangxi University of Science and Technology,Ganzhou Jiangxi 341000, China)
出处 《机械设计与研究》 CSCD 北大核心 2019年第2期160-164,共5页 Machine Design And Research
基金 国家自然科学基金资助项目(51665018)
关键词 组合设备 批次切换 模拟退火算法 晶圆制造 cluster tools batches switching simulated annealing wafer manufacturing
  • 相关文献

参考文献6

二级参考文献129

  • 1王辉,向东,段广洪.基于蚁群算法的产品拆卸序列规划研究[J].计算机集成制造系统,2006,12(9):1431-1437. 被引量:16
  • 2PETTINATO J S, PILLAI D. Technology decisions to minimize 450-mm wafer size transition risk[J]. IEEE Transactions on Semiconductor Manufacturing, 2005, 18(4):501 509.
  • 3LEE H Y, LEE T E. Scheduling single-armed cluster tools with reentrant wafer flows[J]. IEEE Transactions on Semi conductor Manufacturing, 2006, 19(2):226-240.
  • 4ROSTAMI S, HAMIDZADEH B. An optimal residency-aware scheduling technique for cluster tools with buffer module [J]. IEEE Transactions on Semiconductor Manufacturing, 2004, 17(1):68-73.
  • 5PETER V Z.芯片制造[M].第4版.北京:电子工业出版社,2004.
  • 6UNBEHAUN R, ROSE O. The use of slow down factors for the analysis and development of scheduling algorithms for par allel cluster tools[C]//Proceedings of 2006 Winter Simulation Conference. Washington, D. C. , USA: IEEE, 2006:1840-1847.
  • 7LEE Y H. Supply chain model for the semiconductor industry of global market[J]. Journal of Systems Integration, 2001, 10 (3) : 189-206.
  • 8LEE T E, PARK S H. An extended event graph with negative places and tokens for timed window constraints [J]. IEEE Transactions on Automation Science and Engineering, 2005,2 (4):319-332.
  • 9KATS V, LEVNER E, MAYZIN L. Multiple part cyclic hoist scheduling using a sieve method[J]. IEEE Transactions on Robotics and Automation, 1999, 15(4):704-713.
  • 10CHEN H X, CHU C B, PROTH J M. Cyclic scheduling of a hoist with time window constraints[J]. IEEE Transactions on Robotics and Automation, 1998, 14(1):144-152.

共引文献22

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部