IDEAS home Printed from https://ideas.repec.org/a/taf/tprsxx/v63y2025i4p1450-1472.html
   My bibliography  Save this article

A dual-critic DQN architecture for lifter assignment in multi-floor semiconductor FAB

Author

Listed:
  • Jiwon Kim
  • Jeonghoon Mo

Abstract

This paper proposes a deep reinforcement learning-based lifter assignment algorithm utilising Deep Q-network (DQN) to minimise the total inter-floor delivery time in semiconductor manufacturing. Given the complexities and randomness inherent in manufacturing environments, predicting delivery times poses a significant challenge for companies operating in such domains. To address this challenge and improve the accuracy of delay prediction, we partition the end-to-end delivery process of individual lot systematically, focusing on predicting segment delays rather than the overall end-to-end delay. We introduce a unique dual critic architecture designed to handle these segmented steps. This innovative approach enhances accuracy by capturing nuanced information at each step, which is stored as trajectories. Simulation results substantiate the effectiveness of the proposed architecture, comparing favorably against existing algorithms. We conduct comparative analyses with benchmark algorithms, revealing that the proposed algorithm outperforms other algorithms.

Suggested Citation

  • Jiwon Kim & Jeonghoon Mo, 2025. "A dual-critic DQN architecture for lifter assignment in multi-floor semiconductor FAB," International Journal of Production Research, Taylor & Francis Journals, vol. 63(4), pages 1450-1472, February.
  • Handle: RePEc:taf:tprsxx:v:63:y:2025:i:4:p:1450-1472
    DOI: 10.1080/00207543.2024.2378907
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/00207543.2024.2378907
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1080/00207543.2024.2378907?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
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    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:taf:tprsxx:v:63:y:2025:i:4:p:1450-1472. 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: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/TPRS20 .

    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.