期刊文献+

基于分支定界算法的集束型装备调度研究

Branch and Bound Algorithm for Cluster Tool Scheduling Problem
下载PDF
导出
摘要 考虑有滞留时间约束的集束型晶圆制造装备调度问题,其调度要同时考虑晶圆加工排序和机械手搬运作业排序,给出了基于图论的分支定界算法,并采用最长路径方法确定调度目标。仿真实验结果验证了算法的有效性。 This paper addresses the cluster tools scheduling problem with residency time constraints for wafer fabrication. Thescheduling object is to determine both wafer input sequence and transfer robot task sequence. A branch and bound algorithm basedgraph theory is proposed, and the longest path method is to determine the scheduling object. Experimental example shows that theproposed method is effective.
出处 《电脑知识与技术》 2018年第3X期242-243,共2页 Computer Knowledge and Technology
基金 大连外国语大学2017年大学生创新创业训练计划项目(201710172000010)
关键词 集束型装备 分支定界算法 晶圆制造 Cluster Tools Branch and bound algorithm Wafer fabrication
  • 相关文献

参考文献2

二级参考文献47

  • 1赵燕伟,彭典军,张景玲,吴斌.有能力约束车辆路径问题的量子进化算法[J].系统工程理论与实践,2009,29(2):159-166. 被引量:41
  • 2杨淑媛,焦李成,刘芳.量子进化算法[J].工程数学学报,2006,23(2):235-246. 被引量:34
  • 3车阿大,晏鹏宇,杨乃定.复杂无等待自动化制造系统的调度算法研究[J].计算机集成制造系统,2007,13(8):1616-1623. 被引量:10
  • 4周支立,汪应洛.无重叠区的两抓钩周期性排序问题的一个搜索求解法[J].系统工程,2007,25(4):104-109. 被引量:4
  • 5DAWANDE M, GEISMAR H N, SETHI S P, et al. Sequen- cing and scheduling in robotic cells: recent developments [J].Journal of Scheduling, 2005, 8(5) : 387-426. 被引量:1
  • 6KIM J H, LEE T E. Schedulability analysis of time-constrain- ed cluster tool with bounded time variation by an extended Pe- tri net [J]. IEEE Transactions on Automation Science and En- gineering, 2008, 5(3): 490-503. 被引量:1
  • 7WU Naiqi, CHU Chengbin, CHU Feng, et al. A petri netmethod for schedulability and scheduling problems in single arm cluster tools with wafer residency time constraints [J]. IEEE Transactions on Semiconductor Manufacturing, 2008, 21(2): 224-237. 被引量:1
  • 8CHE Ada, CHU Chengbin, CHU Feng. Multicyclic hoist scheduling with constant processing times [J]. IEEE Transac- tions on Robotics and Automation, 2002, 18(1): 69-80. 被引量:1
  • 9TANG Lixin, XIE Xie, LIU Jiyin. Scheduling of single crane in batch annealing process [J]. Computers & Operations Re- search, 2009, 36(10): 2853-2865. 被引量:1
  • 10LEI L, WANG T J. A proof: the cyclic hoist scheduling prob- lem is NP-hard [M]. New Brunswick,N. J. ,USA: Rutgers U- niversity, 1989: 89-0016. 被引量:1

共引文献14

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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