首页> 外国专利> Optimal Buffer Space Configuration and Scheduling for Single-Arm Multi-cluster Tools

Optimal Buffer Space Configuration and Scheduling for Single-Arm Multi-cluster Tools

机译:单臂多集群工具的最佳缓冲区空间配置和调度

摘要

#$%^&*AU2015100136A420150312.pdf#####ABSTRACT A method for scheduling single-arm multi-cluster tools is provided. The present invention studies the scheduling problem of a single-arm multi-cluster tool with a linear topology and process-bound bottleneck individual tool. Its objective is to find a one-wafer cyclic schedule such that the lower bound of cycle time is reached by optimally configuring spaces in buffering modules that link individual cluster tools. A Petri net model is developed to describe the dynamic behavior of the system by extending resource-oriented Petri nets such that a schedule can be parameterized by robots' waiting time. Based on this model, conditions are presented under which a one-wafer cyclic schedule with lower bound of cycle time can be found. With the derived conditions, an algorithm is presented to find such a schedule and optimally configure the buffer spaces. Abstract figure: FIG. 3 Docket No.: UM1190AUOO 30out Boo--
机译:#$%^&* AU2015100136A420150312.pdf #####抽象提供了一种用于调度单臂多集群工具的方法。现在发明研究具有线性的单臂多集群工具的调度问题拓扑和流程约束瓶颈单个工具。其目的是找到一个晶圆循环计划,以便通过最佳配置达到循环时间的下限链接单个集群工具的缓冲模块中的空格。开发了Petri网模型通过扩展面向资源的Petri网描述系统的动态行为这样就可以通过机器人的等待时间来设置时间表。基于此模型,提出了一个条件,在该条件下,单晶片的循环调度具有较低的循环边界时间可以找到。利用导出的条件,提出了一种算法来找到这样的条件计划并优化配置缓冲区空间。抽象图: 3案号:UM1190AUOO 30出嘘

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号