.png){kind=icon}
返回
A knowledge-based multi-agent evolutionary algorithm for semiconductor final testing scheduling problem
.png){kind=icon}
PRE
AI
DOI：10.1016/j.knosys.2015.03.024.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The final testing process ensures the quality of the products in the semiconductor manufacturing factory. Scheduling for the final testing process is crucial to the economic efficiency of production. In this paper, an effective knowledge-based multi-agent evolutionary algorithm (KMEA) is proposed for solving the semiconductor final testing scheduling problem (SFTSP). In the KMEA, each agent is represented by a solution, which is a combination of the operation sequence vector and the machine assignment vector. A hybrid initialization mechanism is proposed to balance the diversity and the quality of the initial agents. In each iteration of evolution, the agents evolve by mutual-learning and competition based on the model of agent lattice. Moreover, a knowledge base is employed to store the useful information during the search process. The knowledge base is used to generate new agents in the competition phase. The computational complexity of the KMEA is analyzed, and the influence of parameter setting is also investigated. Finally, numerical simulation and comparisons are provided to demonstrate the effectiveness and efficiency of the KMEA in solving the test instances. (C) 2015 Elsevier B.V. All rights reserved.
Keyword:
Semiconductor final testing scheduling problem
Multi-agent
Evolutionary algorithm
Mutual-learning
Competition
Knowledge base
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
K
IF:
7.6
论文数:
1.2W
被引数:
4.5W
机构
引用论文
.png){kind=icon}
分享收藏
查看更多内容