低产量步进调度问题的改进共生生物搜索算法

Sikai Gong, Ran Huang, Zhengcai Cao
{"title":"低产量步进调度问题的改进共生生物搜索算法","authors":"Sikai Gong, Ran Huang, Zhengcai Cao","doi":"10.1109/COASE.2017.8256117","DOIUrl":null,"url":null,"abstract":"A stepper in a lithography area is the bottleneck machine of a semiconductor manufacturing process. Its effective scheduling in low-yield scenes can improve throughput and profits of a semiconductor wafer fabrication facility. This paper presents an opposition-based Symbiotic Organisms Search with a catastrophe phase algorithm (OBSOS-CA) to minimize the makespan of this scheduling problem. The opposition-based learning technique is used to increase the population diversity in the initial and parasitism phases of Symbiotic Organisms Search (SOS). Moreover, we add a catastrophe phase containing three parts. When the algorithm is trapped in a local optimum, a catastrophe judgement and an extinction operation are used to jump out of the local optimal solution. Meanwhile, variable neighborhood descent is employed in the mutualism phase and commensalism phase of SOS as the explosion operation thereby strengthening the ability of local search. Simulation results demonstrate that OBSOS-CA is effective for a low-yield stepper scheduling problem.","PeriodicalId":445441,"journal":{"name":"2017 13th IEEE Conference on Automation Science and Engineering (CASE)","volume":"54 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"An improved symbiotic organisms search algorithm for low-yield stepper scheduling problem\",\"authors\":\"Sikai Gong, Ran Huang, Zhengcai Cao\",\"doi\":\"10.1109/COASE.2017.8256117\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A stepper in a lithography area is the bottleneck machine of a semiconductor manufacturing process. Its effective scheduling in low-yield scenes can improve throughput and profits of a semiconductor wafer fabrication facility. This paper presents an opposition-based Symbiotic Organisms Search with a catastrophe phase algorithm (OBSOS-CA) to minimize the makespan of this scheduling problem. The opposition-based learning technique is used to increase the population diversity in the initial and parasitism phases of Symbiotic Organisms Search (SOS). Moreover, we add a catastrophe phase containing three parts. When the algorithm is trapped in a local optimum, a catastrophe judgement and an extinction operation are used to jump out of the local optimal solution. Meanwhile, variable neighborhood descent is employed in the mutualism phase and commensalism phase of SOS as the explosion operation thereby strengthening the ability of local search. Simulation results demonstrate that OBSOS-CA is effective for a low-yield stepper scheduling problem.\",\"PeriodicalId\":445441,\"journal\":{\"name\":\"2017 13th IEEE Conference on Automation Science and Engineering (CASE)\",\"volume\":\"54 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2017-08-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2017 13th IEEE Conference on Automation Science and Engineering (CASE)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/COASE.2017.8256117\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 13th IEEE Conference on Automation Science and Engineering (CASE)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/COASE.2017.8256117","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

光刻领域的步进机是半导体制造过程中的瓶颈机器。它在低良率场景下的有效调度可以提高半导体晶圆制造工厂的吞吐量和利润。本文提出了一种基于对立的共生生物搜索方法,并结合突变阶段算法(OBSOS-CA)来最小化该调度问题的最大完工时间。在共生生物搜索(SOS)的初始阶段和寄生阶段,利用基于对立的学习技术增加种群多样性。此外,我们添加了一个包含三个部分的灾难阶段。当算法陷入局部最优时,采用突变判断和消光运算跳出局部最优解。同时,在SOS的共生阶段和共生阶段采用可变邻域下降作为爆炸操作,增强了局部搜索能力。仿真结果表明,OBSOS-CA算法对低产量步进调度问题是有效的。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
An improved symbiotic organisms search algorithm for low-yield stepper scheduling problem
A stepper in a lithography area is the bottleneck machine of a semiconductor manufacturing process. Its effective scheduling in low-yield scenes can improve throughput and profits of a semiconductor wafer fabrication facility. This paper presents an opposition-based Symbiotic Organisms Search with a catastrophe phase algorithm (OBSOS-CA) to minimize the makespan of this scheduling problem. The opposition-based learning technique is used to increase the population diversity in the initial and parasitism phases of Symbiotic Organisms Search (SOS). Moreover, we add a catastrophe phase containing three parts. When the algorithm is trapped in a local optimum, a catastrophe judgement and an extinction operation are used to jump out of the local optimal solution. Meanwhile, variable neighborhood descent is employed in the mutualism phase and commensalism phase of SOS as the explosion operation thereby strengthening the ability of local search. Simulation results demonstrate that OBSOS-CA is effective for a low-yield stepper scheduling problem.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
A study on performance evaluation and status-based decision for cyber-physical production systems Optimization of deterministic timed weighted marked graphs An optimization-simulation approach for long term care structure assignment problem for elderly people Stochastic simulation of clinical pathways from raw health databases A circuit-breaker use-case operated by a humanoid in aircraft manufacturing
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1