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

Problems and Solution Methods of Machine Scheduling in Semiconductor Manufacturing Operations: A Survey

Author

Listed:
  • Jianxin Fang

    (International Business School, Xi’an Jiaotong-Liverpool University, Suzhou 215123, China)

  • Brenda Cheang

    (Red Jasper Holdings, Westech Building, 237 Pandan Loop, Singapore 128424, Singapore)

  • Andrew Lim

    (School of Computing and Artificial Intelligence, Southwest Jiaotong University, Chengdu 610032, China)

Abstract

Machine scheduling problems associated with semiconductor manufacturing operations (SMOs) are one of the major research topics in the scheduling literature. Lots of papers have dealt with different variants of SMOs’ scheduling problems, which are generally difficult to tackle theoretically and computationally. In this paper, the single machine, parallel machines, flow shops, and job shops scheduling problems from SMOs have been reviewed, based on different processing constraints, e.g., batch processing, auxiliary resources, incompatible job families, and reentrant flow, etc., with the cycle time, flow time, and throughput-related performance measures. Given the vast and diverse nature of the current literature, it is urgently needed to make a systematic survey in order to identify the important research problems, research trends, and the progress of the related solution methods, as well as clarify future research perspectives. We hope the findings and observations could provide some insights to the researchers and practitioners in this domain.

Suggested Citation

  • 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.
    • Handle: RePEc:gam:jsusta:v:15:y:2023:i:17:p:13012-:d:1228106
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2071-1050/15/17/13012/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2071-1050/15/17/13012/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Allahverdi, Ali, 2015. "The third comprehensive survey on scheduling problems with setup times/costs," European Journal of Operational Research, Elsevier, vol. 246(2), pages 345-378.
    2. Shih-Wei Lin & Zne-Jung Lee & Kuo-Ching Ying & Rong-Ho Lin, 2011. "Meta-heuristic algorithms for wafer sorting scheduling problems," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 62(1), pages 165-174, January.
    3. Chung, Tsui-Ping & Liao, Ching-Jong & Su, Ling-Huey, 2010. "Scheduling on identical machines with batch arrivals," International Journal of Production Economics, Elsevier, vol. 123(1), pages 179-186, January.
    4. Jolai Ghazvini, Fariborz & Dupont, Lionel, 1998. "Minimizing mean flow times criteria on a single batch processing machine with non-identical jobs sizes," International Journal of Production Economics, Elsevier, vol. 55(3), pages 273-280, August.
    5. Marco Schulze & Julia Rieck & Cinna Seifi & Jürgen Zimmermann, 2016. "Machine scheduling in underground mining: an application in the potash industry," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 38(2), pages 365-403, March.
    6. K-C Ying & S-W Lin, 2014. "Efficient wafer sorting scheduling using a hybrid artificial immune system," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 65(2), pages 169-179, February.
    7. Michael C. Fu, 2002. "Feature Article: Optimization for simulation: Theory vs. Practice," INFORMS Journal on Computing, INFORMS, vol. 14(3), pages 192-215, August.
    8. Ali Obeid & Stéphane Dauzère-Pérès & Claude Yugma, 2014. "Scheduling job families on non-identical parallel machines with time constraints," Annals of Operations Research, Springer, vol. 213(1), pages 221-234, February.
    9. Wenyou Jia & Zhibin Jiang & You Li, 2015. "Combined scheduling algorithm for re-entrant batch-processing machines in semiconductor wafer manufacturing," International Journal of Production Research, Taylor & Francis Journals, vol. 53(6), pages 1866-1879, March.
    10. Maximilian Moser & Nysret Musliu & Andrea Schaerf & Felix Winter, 2022. "Exact and metaheuristic approaches for unrelated parallel machine scheduling," Journal of Scheduling, Springer, vol. 25(5), pages 507-534, October.
    11. Fowler, John W. & Mönch, Lars, 2022. "A survey of scheduling with parallel batch (p-batch) processing," European Journal of Operational Research, Elsevier, vol. 298(1), pages 1-24.
    12. C Almeder & L Mönch, 2011. "Metaheuristics for scheduling jobs with incompatible families on parallel batching machines," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 62(12), pages 2083-2096, December.
    13. Nowicki, Eugeniusz, 1999. "The permutation flow shop with buffers: A tabu search approach," European Journal of Operational Research, Elsevier, vol. 116(1), pages 205-219, July.
    14. Dugardin, Frédéric & Yalaoui, Farouk & Amodeo, Lionel, 2010. "New multi-objective method to solve reentrant hybrid flow shop scheduling problem," European Journal of Operational Research, Elsevier, vol. 203(1), pages 22-31, May.
    15. Wu, Kan & Huang, Edward & Wang, Mengchang & Zheng, Meimei, 2022. "Job scheduling of diffusion furnaces in semiconductor fabrication facilities," European Journal of Operational Research, Elsevier, vol. 301(1), pages 141-152.
    16. Zhang, Zhicong & Zheng, Li & Hou, Forest & Li, Na, 2011. "Semiconductor final test scheduling with Sarsa([lambda], k) algorithm," European Journal of Operational Research, Elsevier, vol. 215(2), pages 446-458, December.
    17. Payman Jula & Robert C. Leachman, 2010. "Coordinated Multistage Scheduling of Parallel Batch-Processing Machines Under Multiresource Constraints," Operations Research, INFORMS, vol. 58(4-part-1), pages 933-947, August.
    18. Yi Tan & Lars Mönch & John W. Fowler, 2018. "A hybrid scheduling approach for a two-stage flexible flow shop with batch processing machines," Journal of Scheduling, Springer, vol. 21(2), pages 209-226, April.
    19. Fei Qiao & Juan Liu & Yumin Ma, 2021. "Industrial big-data-driven and CPS-based adaptive production scheduling for smart manufacturing," International Journal of Production Research, Taylor & Francis Journals, vol. 59(23), pages 7139-7159, December.
    20. 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.
    21. Jens Rocholl & Lars Mönch & John Fowler, 2020. "Bi-criteria parallel batch machine scheduling to minimize total weighted tardiness and electricity cost," Journal of Business Economics, Springer, vol. 90(9), pages 1345-1381, November.
    22. Lars Mönch & Reha Uzsoy & John W. Fowler, 2018. "A survey of semiconductor supply chain models part III: master planning, production planning, and demand fulfilment," International Journal of Production Research, Taylor & Francis Journals, vol. 56(13), pages 4565-4584, July.
    23. Lin, Yang-Kuei & Fowler, John W. & Pfund, Michele E., 2013. "Multiple-objective heuristics for scheduling unrelated parallel machines," European Journal of Operational Research, Elsevier, vol. 227(2), pages 239-253.
    24. Reha Uzsoy & John W. Fowler & Lars Mönch, 2018. "A survey of semiconductor supply chain models Part II: demand planning, inventory management, and capacity planning," International Journal of Production Research, Taylor & Francis Journals, vol. 56(13), pages 4546-4564, July.
    25. Yi-Feng Hung & Chi-Chung Wang & Gen-Han Wu, 2013. "Scheduling Semiconductor Multihead Testers Using Metaheuristic Techniques Embedded with Lot-Specific and Configuration-Specific Information," Mathematical Problems in Engineering, Hindawi, vol. 2013, pages 1-14, December.
    26. Mason, Scott J. & Chen, Jen-Shiang, 2010. "Scheduling multiple orders per job in a single machine to minimize total completion time," European Journal of Operational Research, Elsevier, vol. 207(1), pages 70-77, November.
    27. Oleh Sobeyko & Lars Mönch, 2015. "Grouping genetic algorithms for solving single machine multiple orders per job scheduling problems," Annals of Operations Research, Springer, vol. 235(1), pages 709-739, December.
    28. Chung-Yee Lee & Reha Uzsoy & Louis A. Martin-Vega, 1992. "Efficient Algorithms for Scheduling Semiconductor Burn-In Operations," Operations Research, INFORMS, vol. 40(4), pages 764-775, August.
    29. C Almeder & L Mönch, 2011. "Metaheuristics for scheduling jobs with incompatible families on parallel batching machines," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 62(12), pages 2083-2096, December.
    30. 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.
    31. Li, Xueping & Zhang, Kaike, 2018. "Single batch processing machine scheduling with two-dimensional bin packing constraints," International Journal of Production Economics, Elsevier, vol. 196(C), pages 113-121.
    32. Lars Mönch & Reha Uzsoy & John W. Fowler, 2018. "A survey of semiconductor supply chain models part I: semiconductor supply chains, strategic network design, and supply chain simulation," International Journal of Production Research, Taylor & Francis Journals, vol. 56(13), pages 4524-4545, July.
    33. 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.
    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. Fowler, John W. & Mönch, Lars, 2022. "A survey of scheduling with parallel batch (p-batch) processing," European Journal of Operational Research, Elsevier, vol. 298(1), pages 1-24.
    2. Bin Ji & Xin Xiao & Samson S. Yu & Guohua Wu, 2023. "A Hybrid Large Neighborhood Search Method for Minimizing Makespan on Unrelated Parallel Batch Processing Machines with Incompatible Job Families," Sustainability, MDPI, vol. 15(5), pages 1-25, February.
    3. Eduardo Queiroga & Rian G. S. Pinheiro & Quentin Christ & Anand Subramanian & Artur A. Pessoa, 2021. "Iterated local search for single machine total weighted tardiness batch scheduling," Journal of Heuristics, Springer, vol. 27(3), pages 353-438, June.
    4. Hu, Man & Liu, Xue-Xin & Jia, Fu, 2024. "Optimal Emergency Order Policy for Supply Disruptions in the Semiconductor Industry," International Journal of Production Economics, Elsevier, vol. 272(C).
    5. Vasvári, Tamás & Hauck, Zsuzsanna & Longauer, Dóra, 2024. "Kiszervezési stratégiák és tanulási hatás a félvezetőiparban [Outsourcing strategies and the learning effect in the semiconductor industry]," Közgazdasági Szemle (Economic Review - monthly of the Hungarian Academy of Sciences), Közgazdasági Szemle Alapítvány (Economic Review Foundation), vol. 0(2), pages 176-200.
    6. Melouk, Sharif & Damodaran, Purushothaman & Chang, Ping-Yu, 2004. "Minimizing makespan for single machine batch processing with non-identical job sizes using simulated annealing," International Journal of Production Economics, Elsevier, vol. 87(2), pages 141-147, January.
    7. Guochuan Zhang & Xiaoqiang Cai & C.‐Y Lee & C.K Wong, 2001. "Minimizing makespan on a single batch processing machine with nonidentical job sizes," Naval Research Logistics (NRL), John Wiley & Sons, vol. 48(3), pages 226-240, April.
    8. Shahvari, Omid & Logendran, Rasaratnam, 2016. "Hybrid flow shop batching and scheduling with a bi-criteria objective," International Journal of Production Economics, Elsevier, vol. 179(C), pages 239-258.
    9. Vinicius M. Ton & Nathália C. O. da Silva & Angel Ruiz & José E. Pécora & Cassius T. Scarpin & Valérie Bélenger, 2024. "Real-time management of intra-hospital patient transport requests," Health Care Management Science, Springer, vol. 27(2), pages 208-222, June.
    10. Smirnov, Dina & van Jaarsveld, Willem & Atan, Zümbül & de Kok, Ton, 2021. "Long-term resource planning in the high-tech industry: Capacity or inventory?," European Journal of Operational Research, Elsevier, vol. 293(3), pages 926-940.
    11. Jia, Shuai & Li, Chung-Lun & Meng, Qiang, 2024. "The dry dock scheduling problem," Transportation Research Part B: Methodological, Elsevier, vol. 181(C).
    12. Lin, Ran & Wang, Jun-Qiang & Liu, Zhixin & Xu, Jun, 2023. "Best possible algorithms for online scheduling on identical batch machines with periodic pulse interruptions," European Journal of Operational Research, Elsevier, vol. 309(1), pages 53-64.
    13. Lin, Ran & Wang, Jun-Qiang & Oulamara, Ammar, 2023. "Online scheduling on parallel-batch machines with periodic availability constraints and job delivery," Omega, Elsevier, vol. 116(C).
    14. Zhou, Shengchao & Xie, Jianhui & Du, Ni & Pang, Yan, 2018. "A random-keys genetic algorithm for scheduling unrelated parallel batch processing machines with different capacities and arbitrary job sizes," Applied Mathematics and Computation, Elsevier, vol. 334(C), pages 254-268.
    15. Christoph Hertrich & Christian Weiß & Heiner Ackermann & Sandy Heydrich & Sven O. Krumke, 2020. "Scheduling a proportionate flow shop of batching machines," Journal of Scheduling, Springer, vol. 23(5), pages 575-593, October.
    16. 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.
    17. Yang-Kuei Lin & Tzu-Yueh Yin, 2022. "Generating bicriteria schedules for correlated parallel machines involving tardy jobs and weighted completion time," Annals of Operations Research, Springer, vol. 319(2), pages 1655-1688, December.
    18. Zhang, Zhe & Song, Xiaoling & Huang, Huijung & Zhou, Xiaoyang & Yin, Yong, 2022. "Logic-based Benders decomposition method for the seru scheduling problem with sequence-dependent setup time and DeJong’s learning effect," European Journal of Operational Research, Elsevier, vol. 297(3), pages 866-877.
    19. 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.
    20. Zhang, Hongbin & Yang, Yu & Wu, Feng, 2024. "Scheduling a set of jobs with convex piecewise linear cost functions on a single-batch-processing machine," Omega, Elsevier, vol. 122(C).

    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:15:y:2023:i:17:p:13012-:d:1228106. 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.