带驻留与连续重入的单臂集束型晶圆制造设备调度方法.pdfVIP

带驻留与连续重入的单臂集束型晶圆制造设备调度方法.pdf

  1. 1、有哪些信誉好的足球投注网站(book118)网站文档一经付费(服务费),不意味着购买了该文档的版权,仅供个人/单位学习、研究之用,不得用于商业用途,未经授权,严禁复制、发行、汇编、翻译或者网络传播等,侵权必究。。
  2. 2、本站所有内容均由合作方或网友上传,本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺!文档内容仅供研究参考,付费前请自行鉴别。如您付费,意味着您自己接受本站规则且自行承担风险,本站不退款、不进行额外附加服务;查看《如何避免下载的几个坑》。如果您已付费下载过本站文档,您可以点击 这里二次下载
  3. 3、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等,请点击“版权申诉”(推荐),也可以打举报电话:400-050-0827(电话支持时间:9:00-18:30)。
  4. 4、该文档为VIP文档,如果想要下载,成为VIP会员后,下载免费。
  5. 5、成为VIP后,下载本文档将扣除1次下载权益。下载后,不支持退款、换文档。如有疑问请联系我们
  6. 6、成为VIP后,您将拥有八大权益,权益包括:VIP文档下载权益、阅读免打扰、文档格式转换、高级专利检索、专属身份标志、高级客服、多端互通、版权登记。
  7. 7、VIP文档为合作方或网友上传,每下载1次, 网站将根据用户上传文档的质量评分、类型等,对文档贡献者给予高额补贴、流量扶持。如果你也想贡献VIP文档。上传文档
查看更多
带驻留与连续重入的单臂集束型晶圆制造设备调度方法.pdf

Joumal of Southeast University (English Edition) Vol. 29 , No. 2 , pp. 187 -193 June 2013 ISSN 1003一7985 Scheduling method for single-arm cluster tools of wafer fabrications with residency and continuous reentrancy Zhou Binghai Wang Zhu Chen Jia (Sch∞1 of Mechanical Engineering, Tongji University , Shanghai 2018ω, αlÍna) Abs位act: In order to enhance the utilization of single-arm the steady state and established an algorithm to search for clusterωols and 句现mize the scheduling problems of dynamic the minimum period , but the calculation is t∞ complex. reaching wafers wi也 residency time and ∞ntinuous reentrancy Rostami et al. [4-5 J studied the schedu1ab诅ty problem of ∞m住挝nts, a struct町al heuristic scheduling algorithm is cluster tools and considered residency time constraints. 伊四en伽d. A nonlin国r 严。gramming scheduling model is built τbey presented a linear progr缸nming-based method to on the basis of bounding the scheduling problem domain. A find an optimal periodic schedule wi由 a bu征er modu1e. feasible 归Ith search scheduling method of single-arm robotic However, the method only considered the scheduling O萨捆住.ons is put forward with the 0均ective of minimal problem of a single wafer product type. Yoon and Lee[6J mak臼pan. Fmally, simu1ation experiments 缸E 也signed to established a schedu1ing model with residency time con- analyze the scheduling algorithms. Resu1ts indicate 曲创出e straints and put forward a kind of online schedu1ing algo- proposed alg倒也m is feasible and valid to solve the scheduling rithm with different product types.τbe lit

您可能关注的文档

文档评论(0)

heroliuguan + 关注
实名认证
文档贡献者

该用户很懒,什么也没介绍

版权声明书
用户编号:8073070133000003

1亿VIP精品文档

相关文档