A knowledge-based multi-agent evolutionary algorithm for semiconductor final testing scheduling problem

doi:10.1016/j.knosys.2015.03.024

Return

A knowledge-based multi-agent evolutionary algorithm for semiconductor final testing scheduling problem

2015-08-01

PRE

Shengyao Wang

王玲 (Ling Wang) *

DOI：10.1016/j.knosys.2015.03.024

Original

Original request for help

Save

Abstract

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.

Keywords:

Semiconductor final testing scheduling problem

Multi-agent

Evolutionary algorithm

Mutual-learning

Competition

Knowledge base

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.