.png){kind=icon}
返回
An effective invasive weed optimization algorithm for scheduling semiconductor final testing problem
.png){kind=icon}
OA
AI
DOI：10.1016/j.swevo.2017.05.007.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this paper, we address a semiconductor final testing problem from the semiconductor manufacturing process. We aim to determine both the assignment of machines and the sequence of operations on all the machines so as to minimize makespan. We present a cooperative co-evolutionary invasive weed optimization (CCIWO) algorithm which iterates with two coupled colonies, one of which addresses the machine assignment problem and the other deals with the operation sequence problem. To well balance the search capability of the two colonies, we adopt independent size setting for each colony. We design the reproduction and spatial dispersal methods for both the colonies by taking advantage of the information collected during the search process and problem-specific knowledge. Extensive experiments and comparison show that the proposed CCIWO algorithm performs much better than the state-of-the-art algorithms in the literature for solving the semiconductor final testing scheduling problem with makespan criteria.
Keyword:
Invasive weed optimization
Cooperative co-evolutionary
Semiconductor final testing scheduling
Makespan
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
8.5
论文数:
2.2K
被引数:
1.0W
机构
引用论文
.png){kind=icon}
Iterated search methods for earliness and tardiness minimization in hybrid flowshops with due windows具有适当窗口的混合流水车间中用于最小化早期和迟到的迭代搜索方法OAAI
OAAI分享收藏
查看更多内容