ScholarMate
English简体中文繁體中文
客服热线:400-1616-289
登录注册
期刊论文

A Reinforcement Learning Approach to Robust Scheduling of Semiconductor Manufacturing Facilities

Park, In-Beom; Huh, Jaeseok*; Kim, Joongkyun; Park, Jonghunpolytech univ
IEEE Transactions on Automation Science and Engineering2020-7DOI: 10.1109/TASE.2019.2956762
125被引8阅读
引用收藏
分享

摘要

As semiconductor manufacturers, recently, have focused on producing multichip products (MCPs), scheduling semiconductor manufacturing operations become complicated due to the constraints related to reentrant production flows, sequence-dependent setups, and alternative machines. At the same time, the scheduling problems need to be solved frequently to effectively manage the variabilities in production requirements, available machines, and initial setup status. To minimize the makespan for an MCP scheduling problem, we propose a setup change scheduling method using reinforcement learning (RL) in which each agent determines setup decisions in a decentralized manner and learns a centralized policy by sharing a neural network among the agents to deal with the changes in the number of machines. Furthermore, novel definitions of state, action, and reward are proposed to address the variabilities in production requirements and initial setup status. Numerical experiments demonstrate that the proposed approach outperforms the rule-based, metaheuristic, and other RL methods in terms of the makespan while incurring shorter computation time than the metaheuristics considered. Note to Practitioners-This article studies a scheduling problem for die attach and wire bonding stages of a semiconductor packaging line. Due to the variabilities in production requirements, the number of available machines, and initial setup status, it is challenging for a scheduler to produce high-quality schedules within a specific time limit using existing approaches. In this article, a new scheduling method using reinforcement learning is proposed to enhance the robustness against the variabilities while achieving performance improvements. To verify the robustness of the proposed method, neural networks (NNs) trained on small-scale scheduling problems are used to solve large-scale scheduling problems. Experimental results show that the proposed method outperforms the existing approaches while requiring a short computation time. Furthermore, the trained NN performs well in solving unseen real-world scale problems even under stochastic processing time, suggesting the viability of the proposed method for real-world semiconductor packaging lines.

学科与关键词

关键词
Job shop schedulingProcessor schedulingTrainingArtificial neural networksSchedulesFlexible job-shop schedulingmultichip product (MCP)neural networks (NNs)reinforcement learning (RL)semiconductor manufacturing
相关
加载中…
  • A reinforcement learning-based approach for solving multi-agent job shop scheduling problem
    Dong, Zhuoran; Ren, Tao*; Qi, Fang; Weng, Jiacheng; Bai, Danyu*; Yang, Jie; Wu, Chin-ChiaInternational Journal of Production Research, 2024.
  • A Reinforcement Learning Approach to Dynamic Scheduling in a Product-Mix Flexibility Environment
    Shiue, Yeou-Ren; Lee, Ken-Chuan; Su, Chao-Ton*IEEE Access, 2020, 8: 106542-106553.被引 10
  • A Generation and Repair Approach to Scheduling Semiconductor Packaging Facilities Using Case-Based Reasoning
    Park, In-Beom; Huh, Jaeseok*; Park, JonghunIEEE Access, 2023, 11: 50631-50641.被引 3
查看全部 →

发表信息

论文状态
公开发表
期刊
IEEE Transactions on Automation Science and Engineering
发表日期
2020-07
卷期
第 17 卷, 第 3 期
页码
1420-1431
DOI
10.1109/TASE.2019.2956762
语言
ENGLISH
期刊收录
NSL.SCIE
期刊等级
2区
成果收录
SCIE
资助标注
National Research Foundation of Korea (NRF) - Korea Government (MSIP) [NRF-2015R1D1A1A01057496]; Professional Consulting Group; National Research Foundation of Korea [21A20130012638] Funding Source: Korea Institute of Science & Technology Information (KISTI), National Science & Technology Information Service (NTIS)

作者

  • P

    Park, In-Beom (第一作者)

  • H

    Huh, Jaeseok (通讯)

    polytech univ

查看全部 4 位作者收起作者
  • K

    Kim, Joongkyun

  • P

    Park, Jonghun

登录解锁更多功能

  • 收藏这篇,随时在“我的 · 收藏”找回
  • 认领你的成果,生成推广素材
  • 关注作者获取最新成果
  • 加入项目组、协同写作
注册 / 登录

产品服务

  • 科研之友
  • 创新城
  • 科创云

服务支持

  • 帮助中心
  • 隐私政策
  • 服务条款

联系方式

在线客服:【】
客服热线:400-1616-289
电子邮箱:support@scholarmate.com

关注或下载科研之友

微信二维码
微信公众号
客户端下载二维码
下载客户端
科研成果科研人员科研机构科研动态爱瑞思软件

©2026 深圳市科研之友网络服务有限公司

公安备案图标粤公网安备 44030502000213
粤ICP备 16046710 号粤B2-20110417