期刊文献+

具有并行加工模块的组合设备故障响应策略 被引量:4

Failure response policy for cluster tools with parallel processing module
下载PDF
导出
摘要 为了有效响应组合设备加工模块常出现的故障,通过分析单臂组合设备的并行模块及其加工流程模式,以及严格的逗留时间约束的晶圆加工过程,建立了Petri网模型,该模型能够描述系统的暂态特性和稳态特性。基于该模型,当并行模块中一个模块出现故障时,分析系统的可调度性,对可调度情况能够提出有效的运行控制策略,使得系统的晶圆不违反逗留时间约束。最后通过实例验证了该控制策略的可行性。 Processing modules in cluster tools were prone to failure and thus it was important to have effective failure response policy.By analyzing single-arm cluster tools with parallel processing module flow pattern and strict wafer residency time constraints,a Petri net model was constructed.This model could not only express the steady state behavior of the system but also the transient behavior.Based on it,schedulability was analyzed whenever any one of the parallel modules for an operation failed.If it was schedulable,effective control policies were presented to keep the system in operation so that no wafer residency time constraint was violated.Examples were presented to show the feasibility of the proposed control policies.
出处 《计算机集成制造系统》 EI CSCD 北大核心 2010年第4期887-895,共9页 Computer Integrated Manufacturing Systems
基金 国家自然科学基金资助项目(60974098) 广东省科技计划资助项目(2008B010400015) 高等学校博士学科点专项科研基金(20094420110002)~~
关键词 组合设备 故障响应 PETRI网 晶圆制造 cluster tools failure response Petri nets semiconductor fabrication
  • 相关文献

参考文献16

  • 1KIM J H.Stable schedule for a single-armed duster tool with time constraints[C]//Procceeddings of the 4th IEEE Conference on Automation Science and Engineering.Washington,D.C.,USA:IEEE,2008:97-102.
  • 2ROSTAMI S,HAMIDZADEH B.An optimal residency-aware scheduling technique for duster tools with buffer module[J].IEEE Transactions on Semiconductor Manufacturing,2004,17(1):68-73.
  • 3LEE 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.
  • 4WU Naiqi,CHU Chengbin,CHU Feng,et al.A Petri net method for schedulability and scheduling problems in single-arm duster tools with wafer residency time constraints[J].IEEE Transactions on Semiconductor Manufacturing,2008,21(2):224-237.
  • 5KIM J H,LEE T E.Schedule stabilization and robust timing control for time-constrained duster tools[C]//Proceedings of 2003 IEEE International Conference on Robotics & Automation.Washington,D.C.,USA:IEEE,2003:1039-1044.
  • 6郭永辉,钱省三.晶圆复杂制造系统在线优化调度系统研究[J].半导体技术,2007,32(4):284-287. 被引量:2
  • 7YAO X D,EMMANUEL F G,MARCUS S I.Optimal preventive maintenance scheduling in semiconductor manufacturing[J].IEEE Transactions on Semiconductor Manufacturing,2004,17(3):345-356.
  • 8LEE T E.A review of scheduling theory and methods for semiconductor manufacturing duster tools[C]//Preceedings of the 40th Conference on Winter Simulation.Miami,Fla.,USA;Winter Simulation Conference,2008:2127-2135.
  • 9LOPEZ M J,WOOD S C.Systems of multiple duster toolsconfiguration,reliability and performance[J].IEEE Transactions on Semiconductor Manufacturing,2003,16(2):170-178.
  • 10LEE T E,LEE H Y,PARK D B.Scheduling analysis of timedconstrained dual-armed duster tools[J].IEEE Transactions on Semiconductor Manufacturing,2003,16(3):521-534.

二级参考文献44

  • 1PETTINATO 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.
  • 2LEE 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.
  • 3ROSTAMI 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.
  • 4PETER V Z.芯片制造[M].第4版.北京:电子工业出版社,2004.
  • 5UNBEHAUN 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.
  • 6LEE Y H. Supply chain model for the semiconductor industry of global market[J]. Journal of Systems Integration, 2001, 10 (3) : 189-206.
  • 7LEE 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.
  • 8KATS 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.
  • 9CHEN 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.
  • 10SU Q, CHEN F F. Optimal sequencing of double-gripper gantry robot moves in tightly-coupled serial production systems[J]. IEEE Transactions on Robotics and Automation, 1996, 12(1):22-30.

共引文献15

同被引文献24

  • 1白丽平,伍乃骐.半导体重入加工过程自动组合装置的建模与分析[J].计算机集成制造系统,2005,11(3):320-325. 被引量:8
  • 2李素粉,朱云龙,尹朝万.具有随机加工时间和机器故障的流水车间调度[J].计算机集成制造系统,2005,11(10):1425-1429. 被引量:13
  • 3郭永辉,钱省三.晶圆复杂制造系统在线优化调度系统研究[J].半导体技术,2007,32(4):284-287. 被引量:2
  • 4周炳海,蒋舒宇,王世进,吴斌,奚立峰.集成生产与预防性维护的流水线车间调度算法[J].大连海事大学学报,2007,33(3):32-35. 被引量:15
  • 5ALI A, JOHN M Scheduling on a two-machine flowshop subject to random breakdown with a makespan objective function [J].European Journal of Operational Research, 1995, 81 (2) : 376-387.
  • 6ZANDIEH M, GHOLAMI M An immune algorithm for scheduling a hybrid flow shop with sequence dependent setup times and machines with random breakdowns [J].International Journal of Production Research, 2009, 47(24): 6999-7027.
  • 7LEE C Y. Minimizing the makespan in the two-machine flowshop scheduling problem with a availability constraint [J].Operational Research Letters, 1997, 20(3): 129-139.
  • 8KUBZIN M A, POTTS C N, et al. Approximation results for flowshop scheduling problems with a machine availability constrains [J].Computers &'Operational Research, 2009, 36(2): 379-390.
  • 9HADDA H. A polynomial-time approximation scheme for the two machine flow shop problem with several availability constrains [J].Optimization Letters, 2012,6(3): 559-569.
  • 10KHELIFATI S L, BENBOUZID S F. A multi-Agent scheduling approach for the joint scheduling of jobs and maintenance operations in the flowShop sequencing problem [J].Lecture Notes in Computer Science, 2011,6923: 60-69.

引证文献4

二级引证文献21

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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