4.7 Article

An effective invasive weed optimization algorithm for scheduling semiconductor final testing problem

期刊

SWARM AND EVOLUTIONARY COMPUTATION
卷 38, 期 -, 页码 42-53

出版社

ELSEVIER
DOI: 10.1016/j.swevo.2017.05.007

关键词

Invasive weed optimization; Cooperative co-evolutionary; Semiconductor final testing scheduling; Makespan

资金

  1. National Science Foundation of China [61503170, 51575212, 61603169, 61374187]
  2. Shandong Province Higher Educational Science and Technology Program [J14LN28]

向作者/读者索取更多资源

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.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.7
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据