上海交通大学学报(自然版) ›› 2013, Vol. 47 ›› Issue (08): 1227-1233.

• 自动化技术、计算机技术 • 上一篇    下一篇

基于析取图的集束型设备建模与调度方法

高忠顺,周炳海   

  1. (同济大学 机械与能源工程学院,上海 201804)
     
  • 收稿日期:2012-11-28 出版日期:2013-08-29 发布日期:2013-08-29
  • 基金资助:

    国家自然科学基金资助项目(71071115;61273035)

Disjunctive Graph-based Modeling and Scheduling for Cluster Tools

GAO Zhongshun,ZHOU Binghai
  

  1. (School of Mechanical Engineering, Tongji University, Shanghai 201804, China)
  • Received:2012-11-28 Online:2013-08-29 Published:2013-08-29

摘要:

针对处理腔带有缓冲且能处理不同种类晶圆产品的单臂集束型设备调度问题,提出了基于析取图模型的分枝搜索调度方法.首先将问题转换为单机调度问题,建立析取图模型,采用分枝的方法获得可行解空间.然后在此基础上,提出以最小完工时间的机械手最优动作序列为目标的分枝搜索算法.最后对调度算法进行了仿真实验分析.结果表明,该算法有效可行,同时说明了处理腔带输入、输出缓冲的集束型设备对于满足不同种类晶圆的生产、提高生产能力均具有较好的效果.
 
 

关键词: 集束型设备, 缓冲, 调度, 析取图, 分枝搜索

Abstract:

To solve the scheduling problem in single-arm cluster tools with chamber buffers and processing multiple part-type wafers, a branching search scheduling method was proposed based on the disjunctive graph model. First, a scheduling problem of cluster tools was transformed to a single machine scheduling problem. Next, a mathematical model of the problems was constructed based on disjunctive graphs. Then, a feasible solution space was obtained by using the branching method. After that, a branching searching algorithm was proposed for scheduling cluster tools with chamber buffers to obtain optimal robot action sequences to meet the system minimum makespan. Finally, experiments were designed to evaluate the proposed algorithm. The results indicate that the proposed algorithm is feasible and valid, and that the throughput of cluster tools with chamber buffers can be improved.
 

Key words: cluster tools, buffers, scheduling, disjunctive graph, branching search

中图分类号: