.png){kind=icon}
返回
A new EDA algorithm combined with Q-learning for semiconductor final testing scheduling problem
.png){kind=icon}
PRE
AI
DOI：10.1016/j.cie.2024.110259.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In recent years, the Semiconductor Final Testing Scheduling Problem (SFTSP), recognized as a unique multiresource scheduling challenge, attracts increasingly attention of academia and industry in the semiconductor manufacturing process. In this paper, a novel estimation of distribution algorithm combined with Q-learning (QEDA) is proposed to solve the SFTSP. According to the characteristics of the used operation encoding, a new probability matrix update mechanism is proposed for enhancing the priority relationships among operations. Considering that the traditional EDA is not in favor of local exploitation compared with its global exploration, a reinforcement learning is designed to improve the performance of the proposed algorithm. Furthermore, for the challenge of the resource allocation in SFTSP, four actions are introduced based on the variance of individual objectives. Extensive numerical simulations and comparative experiments show that the proposed QEDA algorithm exhibits much better performance than the state-of-the-art algorithms in the literature for solving the SFTSP.
Keyword:
Semiconductor final testing scheduling
problem
Q-learning
EDA
Probability matrix
期刊
IF:
6.5
论文数:
1.0W
被引数:
3.8W
机构
引用论文
.png){kind=icon}
分享收藏A self-learning genetic algorithm based on reinforcement learning for flexible job-shop scheduling problem基于强化学习的自学习遗传算法求解柔性作业车间调度问题
PREAI
分享收藏Improved customer satisfaction with a hybrid dispatching rule in semiconductor back-end factories
OAAI
OAAI分享收藏
查看更多内容