IDEAS home Printed from https://ideas.repec.org/a/hin/jnlmpe/4602052.html
   My bibliography  Save this article

Interactive Q-Learning Approach for Pick-and-Place Optimization of the Die Attach Process in the Semiconductor Industry

Author

Listed:
  • Gilseung Ahn
  • Myunghwan Park
  • You-Jin Park
  • Sun Hur

Abstract

In semiconductor back-end production, the die attach process is one of the most critical steps affecting overall productivity. Optimization of this process can be modeled as a pick-and-place problem known to be NP-hard. Typical approaches are rule-based and metaheuristic methods. The two have high or low generalization ability, low or high performance, and short or long search time, respectively. The motivation of this paper is to develop a novel method involving only the strengths of these methods, i.e., high generalization ability and performance and short search time. We develop an interactive Q-learning in which two agents, a pick agent and a place agent, are trained and find a pick-and-place (PAP) path interactively. From experiments, we verified that the proposed approach finds a shorter path than the genetic algorithm given in previous research.

Suggested Citation

  • Gilseung Ahn & Myunghwan Park & You-Jin Park & Sun Hur, 2019. "Interactive Q-Learning Approach for Pick-and-Place Optimization of the Die Attach Process in the Semiconductor Industry," Mathematical Problems in Engineering, Hindawi, vol. 2019, pages 1-8, February.
  • Handle: RePEc:hin:jnlmpe:4602052
    DOI: 10.1155/2019/4602052
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/MPE/2019/4602052.pdf
    Download Restriction: no

    File URL: http://downloads.hindawi.com/journals/MPE/2019/4602052.xml
    Download Restriction: no

    File URL: https://libkey.io/10.1155/2019/4602052?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Gilseung Ahn & Sun Hur, 2020. "Clustering and Dispatching Rule Selection Framework for Batch Scheduling," Mathematics, MDPI, vol. 8(1), pages 1-14, January.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:hin:jnlmpe:4602052. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Mohamed Abdelhakeem (email available below). General contact details of provider: https://www.hindawi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.