IDEAS home Printed from https://ideas.repec.org/a/gam/jsusta/v10y2018i11p4123-d181797.html
   My bibliography  Save this article

Learning to Dispatch Operations with Intentional Delay for Re-Entrant Multiple-Chip Product Assembly Lines

Author

Listed:
  • Jaeseok Huh

    (Department of Industrial Engineering and Institute for Industrial Systems Innovation, Seoul National University, 1 Gwanak-ro, Gwanak-gu, Seoul 151-744, Korea)

  • Inbeom Park

    (Department of Industrial Engineering and Institute for Industrial Systems Innovation, Seoul National University, 1 Gwanak-ro, Gwanak-gu, Seoul 151-744, Korea)

  • Seongmin Lim

    (Department of Industrial Engineering and Institute for Industrial Systems Innovation, Seoul National University, 1 Gwanak-ro, Gwanak-gu, Seoul 151-744, Korea)

  • Bohyung Paeng

    (Department of Industrial Engineering and Institute for Industrial Systems Innovation, Seoul National University, 1 Gwanak-ro, Gwanak-gu, Seoul 151-744, Korea)

  • Jonghun Park

    (Department of Industrial Engineering and Institute for Industrial Systems Innovation, Seoul National University, 1 Gwanak-ro, Gwanak-gu, Seoul 151-744, Korea)

  • Kwanho Kim

    (Department of Industrial and Management Engineering, Incheon National University, 119 Academy-ro, Yeonsu-gu, Incheon 407-772, Korea)

Abstract

As the demand for small devices with embedded flash memory increases, semiconductor manufacturers have been recently focusing on producing high-capacity multiple-chip products (MCPs). Due to the frequently re-entrant lots between the die attach (DA) and wire bonding (WB) assembly stages in MCP production, increased flow time and decreased resource utilization are unavoidable. In this paper, we propose a dispatcher based on artificial neural networks, which minimizes the flow time while maintaining high utilization of resources at the same time through exploiting the possible intentional delays on DA stage. Specifically, the proposed dispatcher learns the assignment preferences between available lots and DA resources based on assembly line data generated by using a simulator, then the proposed dispatcher performs lot dispatching decisions by considering the intentional delays. The numerical experiments were performed under various configurations of the MCP assembly lines, and the results show that the proposed dispatcher outperformed the existing methods.

Suggested Citation

  • Jaeseok Huh & Inbeom Park & Seongmin Lim & Bohyung Paeng & Jonghun Park & Kwanho Kim, 2018. "Learning to Dispatch Operations with Intentional Delay for Re-Entrant Multiple-Chip Product Assembly Lines," Sustainability, MDPI, vol. 10(11), pages 1-21, November.
  • Handle: RePEc:gam:jsusta:v:10:y:2018:i:11:p:4123-:d:181797
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2071-1050/10/11/4123/pdf
    Download Restriction: no

    File URL: https://www.mdpi.com/2071-1050/10/11/4123/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Sungwook Yoon & Jihyun Kim & Sukjae Jeong, 2017. "RETRACTED: The Optimal Decision Combination in Semiconductor Manufacturing," Sustainability, MDPI, vol. 9(10), pages 1, October.
    2. Kanet, John J., 1986. "Tactically delayed versus non-delay scheduling: An experimental investigation," European Journal of Operational Research, Elsevier, vol. 24(1), pages 99-105, January.
    3. John J. Kanet & V. Sridharan, 2000. "Scheduling with Inserted Idle Time: Problem Taxonomy and Literature Review," Operations Research, INFORMS, vol. 48(1), pages 99-110, February.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Zhang, Xiandong & van de Velde, Steef, 2010. "On-line two-machine open shop scheduling with time lags," European Journal of Operational Research, Elsevier, vol. 204(1), pages 14-19, July.
    2. Waldherr, Stefan & Knust, Sigrid & Briskorn, Dirk, 2017. "Synchronous flow shop problems: How much can we gain by leaving machines idle?," Omega, Elsevier, vol. 72(C), pages 15-24.
    3. Jorge M. S. Valente, 2007. "Beam search heuristics for the single machine scheduling problem with linear earliness and quadratic tardiness costs," FEP Working Papers 250, Universidade do Porto, Faculdade de Economia do Porto.
    4. Kerem Bülbül & Safia Kedad-Sidhoum & Halil Şen, 2019. "Single-machine common due date total earliness/tardiness scheduling with machine unavailability," Journal of Scheduling, Springer, vol. 22(5), pages 543-565, October.
    5. Jorge M. S. Valente, 2008. "Beam search heuristics for quadratic earliness and tardiness scheduling," FEP Working Papers 279, Universidade do Porto, Faculdade de Economia do Porto.
    6. Akturk, M. Selim & Ozdemir, Deniz, 2001. "A new dominance rule to minimize total weighted tardiness with unequal release dates," European Journal of Operational Research, Elsevier, vol. 135(2), pages 394-412, December.
    7. Black, Gary W. & McKay, Kenneth N. & Morton, Thomas E., 2006. "Aversion scheduling in the presence of risky jobs," European Journal of Operational Research, Elsevier, vol. 175(1), pages 338-361, November.
    8. F. Hwang & M. Kovalyov & B. Lin, 2014. "Scheduling for fabrication and assembly in a two-machine flowshop with a fixed job sequence," Annals of Operations Research, Springer, vol. 217(1), pages 263-279, June.
    9. Guang Feng & Hoong Lau, 2008. "Efficient algorithms for machine scheduling problems with earliness and tardiness penalties," Annals of Operations Research, Springer, vol. 159(1), pages 83-95, March.
    10. N Nekoiemehr & G Moslehi, 2011. "Minimizing the sum of maximum earliness and maximum tardiness in the single-machine scheduling problem with sequence-dependent setup time," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 62(7), pages 1403-1412, July.
    11. Mina Aliakbari & Joseph Geunes, 2022. "Multiple Train Repositioning Operations in a Railyard Network," SN Operations Research Forum, Springer, vol. 3(4), pages 1-31, December.
    12. Karen A. Brown & Thomas G. Schmitt & Richard J. Schonberger & Stephen Dennis, 2004. "Quadrant Homes Applies Lean Concepts in a Project Environment," Interfaces, INFORMS, vol. 34(6), pages 442-450, December.
    13. Shen, Liji & Dauzère-Pérès, Stéphane & Maecker, Söhnke, 2023. "Energy cost efficient scheduling in flexible job-shop manufacturing systems," European Journal of Operational Research, Elsevier, vol. 310(3), pages 992-1016.
    14. Jorge M. S. Valente & Maria R. A. Moreira & Alok Singh & Rui A. F. S. Alves, 2009. "Genetic algorithms for single machine scheduling with quadratic earliness and tardiness costs," FEP Working Papers 312, Universidade do Porto, Faculdade de Economia do Porto.
    15. Alidaee, Bahram & Li, Haitao & Wang, Haibo & Womer, Keith, 2021. "Integer programming formulations in sequencing with total earliness and tardiness penalties, arbitrary due dates, and no idle time: A concise review and extension," Omega, Elsevier, vol. 103(C).
    16. Detienne, Boris & Pinson, Éric & Rivreau, David, 2010. "Lagrangian domain reductions for the single machine earliness-tardiness problem with release dates," European Journal of Operational Research, Elsevier, vol. 201(1), pages 45-54, February.
    17. Jorge M. S. Valente, 2006. "Heuristics for the single machine scheduling problem with early and quadratic tardy penalties," FEP Working Papers 234, Universidade do Porto, Faculdade de Economia do Porto.
    18. Jorge M. S. Valente & Maria R. A. Moreira, 2008. "Greedy randomized dispatching heuristics for the single machine scheduling problem with quadratic earliness and tardiness penalties," FEP Working Papers 286, Universidade do Porto, Faculdade de Economia do Porto.
    19. Szmerekovsky, Joseph G., 2007. "Single machine scheduling under market uncertainty," European Journal of Operational Research, Elsevier, vol. 177(1), pages 163-175, February.
    20. J M S Valente, 2010. "Beam search heuristics for quadratic earliness and tardiness scheduling," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 61(4), pages 620-631, April.

    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:gam:jsusta:v:10:y:2018:i:11:p:4123-:d:181797. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.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.