期刊文献+

基于驻留约束的半导体晶圆蚀刻系统实时调度算法 被引量:1

A Real-Time Scheduling Algorithm of Wet-Etching System with Residency Constraints in Semiconductor Wafer Fabrications
下载PDF
导出
摘要 为有效利用半导体晶圆蚀刻系统,根据蚀刻系统的特点,进行了实时调度问题域的描述,提出了基于驻留约束的实时调度算法.在此基础上,建立了以无不良品和总完工时间最小为目标的启发式实时调度算法.仿真实验结果表明,该算法是有效和实用的. A wet-etching process is a key flow in wafer fabrications. The wet-etching process involves a complex interplay operation of zero wait and no-intermediate storage, and shared robots. To improve the utilities of a semiconductor wafer wet-etching system efficiently, according to characteristics of the wet-etching system, a problem domain of the real-time scheduling was supposed and defined, and strategies of resolving the scheduling problem were proposed. A real-time scheduling algorithm with residence constraints was presented as well. On the basis of the mentioned above, a heuristic real-time algorithm were built for minimizing makespan with no defective wafer. Finally, the performances of the proposed algorithm were analyzed with simulation experiments. The results indicate that the proposed algorithm is valid and practical for generating satisfactory schedule solutions.
出处 《上海交通大学学报》 EI CAS CSCD 北大核心 2009年第11期1742-1745,1750,共5页 Journal of Shanghai Jiaotong University
基金 国家自然科学基金资助项目(60574054 70771065) 上海市浦江人才计划资助项目(07PJ14052)
关键词 蚀刻系统 半导体晶圆制造 实时调度 驻留约束 etching systems semiconductor wafer fabrications real-time scheduling residence constraints
  • 相关文献

参考文献9

  • 1Sze S M. Modern semiconductor device physics[M]. New York:John Wiley & Sons, Inc (US), 1998. 被引量:1
  • 2刘惠然..基于EOPNs的半导体晶圆制造系统建模和实时派工的研究[D].上海交通大学,2006:
  • 3Bhushan S, Karimi I A. Heuristic algorithms for scheduling an automated wet-etch station[J]. Computers and Chemical Engineering, 2004, 28(3): 363-379. 被引量:1
  • 4Bhushan S, Karimi I A. An MILP approach to automated wet-etch scheduling[J]. Industrial Engineering and Chemical Research, 2003, 42(7), 1391-1399. 被引量:1
  • 5Yin Y. An algorithm for hoist scheduling problems [J]. International Journal of Production Research,1994, 32(3): 501-516. 被引量:1
  • 6Karimi I A, Zerlinda Y L T, Bhushan S. An improved formulation for scheduling an automated wet-etch station[J]. Computers and Chemical Engineering, 2004, 29(2) :217-224. 被引量:1
  • 7Lei L, Wang T J. A proof: The cyclic hoist scheduling problem is NP-complete[Z]. Working Paper No. 89- 06. New York, State of New Jersey: Graduate School of Management, Rutgers University, 1989. 被引量:1
  • 8Geiger C D, Kempf K G, Uzsoy R. A tub search approach to scheduling an automated wet etch station [J]. Journal of Manufacturing Systems, 1997, 16(2): 102-116. 被引量:1
  • 9Chen H, Chu C, Proth J M. Cyclic scheduling of a hoist with time window constraints [J]. IEEE Trans Robot Automat,1998, 14(1): 144-152. 被引量:1

引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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