IDEAS home Printed from https://ideas.repec.org/a/spr/joinma/v32y2021i3d10.1007_s10845-020-01678-8.html
   My bibliography  Save this article

A self-organized approach for scheduling semiconductor manufacturing systems

Author

Listed:
  • Qingyun Yu

    (Tongji University)

  • Haolin Yang

    (Tongji University)

  • Kuo-Yi Lin

    (Tongji University
    Tongji University)

  • Li Li

    (Tongji University
    Tongji University)

Abstract

In semiconductor manufacturing industry, traditional scheduling rules are not conducive to improving production capacity to autonomously adjust based on real-time status. To fill this gap, this study proposes a dynamic dispatching rule based on self-organization (DDRSO) to autogenerate optimal scheduling scheme through mechanisms of interaction, coordination and competition. Besides, an extended DDRSO is proposed to further consider hot lots and transient dynamic bottlenecks. Both DDRSO and E-DDRSO are designed from three aspects: role definition of self-organization units, negotiation mechanism among self-organization units, and decision methods. This research adopts a benchmark industrial manufacturing system to illustrate the availability of the proposed approach. Compared with heuristic dispatching strategies, DDRSO achieves improvement on MOV, TH and ODR by 4.9%, 9.06% and 20.23%, respectively. Meanwhile, E-DDRSO performs better than DDRSO under all workload levels. In addition, compared with a flexible dispatching method BPSO-SVM, E-DDRSO also obtain better performances, especially improvement on CT by 16.51%.

Suggested Citation

  • Qingyun Yu & Haolin Yang & Kuo-Yi Lin & Li Li, 2021. "A self-organized approach for scheduling semiconductor manufacturing systems," Journal of Intelligent Manufacturing, Springer, vol. 32(3), pages 689-706, March.
    • Handle: RePEc:spr:joinma:v:32:y:2021:i:3:d:10.1007_s10845-020-01678-8
    DOI: 10.1007/s10845-020-01678-8
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10845-020-01678-8
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10845-020-01678-8?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.

    References listed on IDEAS

    as
    1. Dae-Kyu Kim & Hyun-Jung Kim & Tae-Eog Lee, 2017. "Optimal scheduling for sequentially connected cluster tools with dual-armed robots and a single input and output module," International Journal of Production Research, Taylor & Francis Journals, vol. 55(11), pages 3092-3109, June.
    2. Onur Ozturk & Mehmet A. Begen & Gregory S. Zaric, 2017. "A branch and bound algorithm for scheduling unit size jobs on parallel batching machines to minimize makespan," International Journal of Production Research, Taylor & Francis Journals, vol. 55(6), pages 1815-1831, March.
    3. Fei Shi & Shikui Zhao & Yue Meng, 2020. "Hybrid algorithm based on improved extended shifting bottleneck procedure and GA for assembly job shop scheduling problem," International Journal of Production Research, Taylor & Francis Journals, vol. 58(9), pages 2604-2625, May.
    4. Tsui-Ping Chung & Zhen Xue & Tong Wu & Stephen C. Shih, 2019. "Minimising total completion time on single-machine scheduling with new integrated maintenance activities," International Journal of Production Research, Taylor & Francis Journals, vol. 57(3), pages 918-930, February.
    5. Peng Zhang & Youlong Lv & Jie Zhang, 2018. "An improved imperialist competitive algorithm based photolithography machines scheduling," International Journal of Production Research, Taylor & Francis Journals, vol. 56(3), pages 1017-1029, February.
    Full references (including those not matched with items on IDEAS)

    Citations

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


    Cited by:

    1. Jianxin Fang & Brenda Cheang & Andrew Lim, 2023. "Problems and Solution Methods of Machine Scheduling in Semiconductor Manufacturing Operations: A Survey," Sustainability, MDPI, vol. 15(17), pages 1-44, August.
    2. Yongjian Jiang & Dongyun Wang & Wenjun Xia & Wencai Li, 2022. "Optimisation of the Logistics System in an Electric Motor Assembly Flowshop by Integrating the Taguchi Approach and Discrete Event Simulation," Sustainability, MDPI, vol. 14(24), pages 1-15, December.

    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. Jianxin Fang & Brenda Cheang & Andrew Lim, 2023. "Problems and Solution Methods of Machine Scheduling in Semiconductor Manufacturing Operations: A Survey," Sustainability, MDPI, vol. 15(17), pages 1-44, August.
    2. Biber Nurit & Mor Baruch & Schlissel Yitzhak & Shapira Dana, 2023. "Lot scheduling involving completion time problems on identical parallel machines," Operational Research, Springer, vol. 23(1), pages 1-29, March.
    3. Omid Shahvari & Rasaratnam Logendran & Madjid Tavana, 2022. "An efficient model-based branch-and-price algorithm for unrelated-parallel machine batching and scheduling problems," Journal of Scheduling, Springer, vol. 25(5), pages 589-621, October.
    4. M. Hajibabaei & J. Behnamian, 2023. "Fuzzy cleaner production in assembly flexible job-shop scheduling with machine breakdown and batch transportation: Lagrangian relaxation," Journal of Combinatorial Optimization, Springer, vol. 45(5), pages 1-26, July.
    5. Artur Alves Pessoa & Teobaldo Bulhões & Vitor Nesello & Anand Subramanian, 2022. "Exact Approaches for Single Machine Total Weighted Tardiness Batch Scheduling," INFORMS Journal on Computing, INFORMS, vol. 34(3), pages 1512-1530, May.
    6. Donghun Lee & Hyeongwon Kang & Dongjin Lee & Jeonwoo Lee & Kwanho Kim, 2023. "Deep Reinforcement Learning-Based Scheduler on Parallel Dedicated Machine Scheduling Problem towards Minimizing Total Tardiness," Sustainability, MDPI, vol. 15(4), pages 1-14, February.
    7. Gur Mosheiov & Daniel Oron, 2023. "A note on batch scheduling on a two-machine flowshop with machine-dependent processing times," 4OR, Springer, vol. 21(3), pages 457-469, September.
    8. Chung-Ho Su & Jen-Ya Wang, 2022. "A Branch-and-Bound Algorithm for Minimizing the Total Tardiness of Multiple Developers," Mathematics, MDPI, vol. 10(7), pages 1-24, April.
    9. Jun Pei & Jinling Wei & Baoyu Liao & Xinbao Liu & Panos M. Pardalos, 2020. "Two-agent scheduling on bounded parallel-batching machines with an aging effect of job-position-dependent," Annals of Operations Research, Springer, vol. 294(1), pages 191-223, November.
    10. Ozturk, Onur, 2020. "A truncated column generation algorithm for the parallel batch scheduling problem to minimize total flow time," European Journal of Operational Research, Elsevier, vol. 286(2), pages 432-443.
    11. Fatemi-Anaraki, Soroush & Tavakkoli-Moghaddam, Reza & Foumani, Mehdi & Vahedi-Nouri, Behdin, 2023. "Scheduling of Multi-Robot Job Shop Systems in Dynamic Environments: Mixed-Integer Linear Programming and Constraint Programming Approaches," Omega, Elsevier, vol. 115(C).
    12. Zhou, Shenghan & Zhou, Yuliang & Zuo, Xiaorong & Xiao, Yiyong & Cheng, Yang, 2018. "Modeling and solving the constrained multi-items lot-sizing problem with time-varying setup cost," Chaos, Solitons & Fractals, Elsevier, vol. 116(C), pages 202-207.
    13. Yantong Li & Jean-François Côté & Leandro Callegari-Coelho & Peng Wu, 2022. "Novel Formulations and Logic-Based Benders Decomposition for the Integrated Parallel Machine Scheduling and Location Problem," INFORMS Journal on Computing, INFORMS, vol. 34(2), pages 1048-1069, March.
    14. A. Alfieri & A. Druetto & A. Grosso & F. Salassa, 2021. "Column generation for minimizing total completion time in a parallel-batching environment," Journal of Scheduling, Springer, vol. 24(6), pages 569-588, December.
    15. Jae Won Jang & Yong Jae Kim & Byung Soo Kim, 2022. "A Three-Stage ACO-Based Algorithm for Parallel Batch Loading and Scheduling Problem with Batch Deterioration and Rate-Modifying Activities," Mathematics, MDPI, vol. 10(4), pages 1-26, February.
    16. Hyun-Jung Kim & Jun-Ho Lee, 2021. "Cyclic robot scheduling for 3D printer-based flexible assembly systems," Annals of Operations Research, Springer, vol. 298(1), pages 339-359, March.

    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:spr:joinma:v:32:y:2021:i:3:d:10.1007_s10845-020-01678-8. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.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.