首页> 外文期刊>IEEE transactions on automation science and engineering >Schedulability Analysis of Time-Constrained Cluster Tools With Bounded Time Variation by an Extended Petri Net
【24h】

Schedulability Analysis of Time-Constrained Cluster Tools With Bounded Time Variation by an Extended Petri Net

机译:用扩展Petri网分析时间有界的时间约束聚类工具的可调度性

获取原文
获取原文并翻译 | 示例

摘要

Cluster tools for some wafer fabrication processes such as low-pressure chemical vapor deposition have strict wafer delay constraints. A wafer that completes processing in a processing chamber should leave the chamber within a specified time limit. Otherwise, the wafer suffers from severe quality troubles due to residual gases and heat within the chamber. An important engineering problem is to verify whether for given task times there exists a tool operation schedule that satisfies the wafer delay limit. There have been studies on the problem, which all assume deterministic task times. However, in reality, the task times are subject to random variation. In this paper, we develop a systematic method of determining schedulability of time-constrained decision-free discrete-event systems, where time variation can be confined within finite intervals. To do this, we propose an extended Petri net for modeling such systems. We then develop a necessary and sufficient condition for which there always exists a feasible schedule and one for which there never exists any feasible schedule. We develop a graph-based computational procedure for verifying the schedulability conditions and determining the worst-case task delay. We demonstrate how the procedure can be used for cluster tool engineering to control wafer delays against wafer alignment failures and time variation.
机译:用于某些晶圆制造工艺(例如低压化学气相沉积)的群集工具具有严格的晶圆延迟限制。在处理室中完成处理的晶圆应在指定的时限内离开处理室。否则,由于腔室内的残留气体和热量,晶片遭受严重的质量问题。一个重要的工程问题是验证对于给定的任务时间是否存在满足晶圆延迟限制的工具操作计划。已经对该问题进行了研究,所有这些研究都假设确定性的任务时间。但是,实际上,任务时间是随机变化的。在本文中,我们开发了一种确定时间受限的无决策离散事件系统的可调度性的系统方法,其中时间变化可以限制在有限的时间间隔内。为此,我们提出了一个扩展的Petri网来对此类系统进行建模。然后,我们建立了一个必要和充分的条件,对于该条件,始终存在可行的时间表,而对于该条件则永远不存在任何可行的时间表。我们开发了一种基于图形的计算程序,以验证可调度性条件并确定最坏情况下的任务延迟。我们演示了如何将该程序用于群集工具工程,以控制晶圆延迟以防止晶圆对准故障和时间变化。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号