Skip to main content

Abstract

Recently, the Fourth Industrial Revolution has rapidly accelerated with the development of IT technology. Demand for state-of-the-art semiconductors sharply increased due to these market changes, and improvement of production capacity is particularly important to gain a competitive advantage. The semiconductor manufacturing process can be divided into three stages such as fabrication, probe (EDS), packaging. Electrical die sort (EDS) process is an important testing process in quality control between fabrication and assembly processes and is the point where the manufacturing capacity and supply chain can be affected. For these reasons, the demand for optimal operation is continuously increasing. However, schedule changes occur due to unexpected abnormal situations, such as machine failures or repairs owing to the nature of the testing process, that require retests to accurately analyze defects in products, or problems in the testing process. Therefore, scheduling considering uncertainty is especially important for smooth production. This study investigated the problem of schedule changes that arise due to retests among abnormal situations in the EDS process of non-memory semiconductors and presents a genetic algorithm with penalty method (GAPM) for scheduling under such uncertainties. The EDS process has the characteristics of a flexible manufacturing system (FMS), and it can be scheduled using the solution to the flexible job-shop scheduling problem (FJSP). Since the FJSP is an NP-hard class problem among combinatorial problems, a meta-heuristic method that can find the optimal solution in a short time is used. GAPM uses a genetic algorithm as the exhaustive search algorithm that is widely used as FJSP solutions and uses neighborhood search techniques for local search. In addition, the penalty method was used to make effective scheduling possible even under uncertainties such as retests that occur during the manufacturing process.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 169.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Similar content being viewed by others

References

  1. Barbosa, H.J., Lemonge, A.C.: An Adaptive Penalty Method for Genetic Algorithms in Constrained Optimization Problems. In Frontiers in Evolutionary Robotics, InTech (2008)

    Book  Google Scholar 

  2. Chaari, T., Chaabane, S., Aissani, N., & Trentesaux, D.: Scheduling under uncertainty: Survey and research directions. In: Advanced Logistics and Transport (ICALT), 2014 International Conference on, pp. 229–234. IEEE (2014)

    Google Scholar 

  3. Chen, Y.Y., Lin, J.T., Chen, T.L.: A two-phase dynamic dispatching approach to semiconductor wafer testing. Robot. Comput. Integr. Manuf. 27(5), 889–901 (2011)

    Article  Google Scholar 

  4. De Giovanni, L., Pezzella, F.: An improved genetic algorithm for the distributed and flexible job-shop scheduling problem. Eur. J. Oper. Res. 200(2), 395–408 (2010)

    Article  Google Scholar 

  5. Gao, J., Sun, L., Gen, M.: A hybrid genetic and variable neighborhood descent algorithm for flexible job shop scheduling problems. Comput. Oper. Res. 35(9), 2892–2907 (2008)

    Article  MathSciNet  Google Scholar 

  6. Goldberg, D.E.: Genetic Algorithms in Search, Optimization, and Machine Learning. Reading: Addison-Wesley (1989)

    Google Scholar 

  7. Hamda, H., Schoenauer, M.: Adaptive techniques for evolutionary topological optimum design. In: Evolutionary Design and Manufacture, pp. 123–136. Springer, London (2000)

    Google Scholar 

  8. Hildebrandt, T., Goswami, D., Freitag, M.: Large-scale simulation-based optimization of semiconductor dispatching rules. In: Proceedings of the 2014 Winter Simulation Conference, pp. 2580–2590. IEEE Press (2014)

    Google Scholar 

  9. Jeong, G.: An adaptive dispatching architecture for constructing a factory operating system of semiconductor fabrication: focused on machines with setup times. IE Interfaces 22(1), 73–84 (2009)

    Google Scholar 

  10. Jeong, K.C., Kim, Y.D.: A real-time scheduling mechanism for a flexible manufacturing system: using simulation and dispatching rules. Int. J. Prod. Res. 36(9), 2609–2626 (1998)

    Article  Google Scholar 

  11. Jeong, Y., Park S.: Operation classification and dispatching rules for semiconductor FAB with dedication. In: The Korean Operations Research and Management Science Society Conference Collected Paper, pp. 3660–3664 (2016)

    Google Scholar 

  12. Jeong, Y., Ham, W., Park, S.: Dispatching-based dynamic equipment allocation to meet the urgent order delivery of system semiconductor fab. The Korean Institute of Industrial Engineers Spring Conference Collected Papers, pp. 1151–1158 (2014)

    Google Scholar 

  13. Ju, Y.: Operational optimization of an automated electrical die sorting line with single-wafer transfer. Korea Adv. Inst. Sci. Technol. (KAIST) 2009(2), 128 (2009)

    MathSciNet  Google Scholar 

  14. Karunakaran, D., Mei, Y., Chen, G., Zhang, M.: Toward evolving dispatching rules for dynamic job shop scheduling under uncertainty. In: Proceedings of the Genetic and Evolutionary Computation Conference, pp. 282–289. ACM (2017)

    Google Scholar 

  15. Kim, Y.: Samsung, which plunged into system semiconductor: Can it outperform Intel?, Smart & Company, http://www.elec4.co.kr/article/articleView.asp?idx=16417. Last accessed 05 Aug 2017 (2017)

  16. Lee, Y., Jeong, B.: Performance analysis of lot release rule and dispatching rule according to the failure type of semiconductor operations. The Korean Institute of Industrial Engineers Fall Conference Collected Papers, pp. 390–394 (1998)

    Google Scholar 

  17. Li, Z., Ierapetritou, M.: Process scheduling under uncertainty: Review and challenges. Comput. Chem. Eng. 32(4), 715–727 (2008)

    Article  Google Scholar 

  18. Moslehi, G., Mahnam, M.: A Pareto approach to multi-objective flexible job-shop scheduling problem using particle swarm optimization and local search. Int. J. Prod. Econ. 129(1), 14–22 (2011)

    Article  Google Scholar 

  19. Nanakorn, P., Meesomklin, K.: An adaptive penalty function in genetic algorithms for structural design optimization. Comput. Struct. 79(29), 2527–2539 (2001)

    Article  Google Scholar 

  20. Pezzella, F., Morganti, G., Ciaschetti, G.: A genetic algorithm for the flexible job-shop scheduling problem. Comput. Oper. Res. 35(10), 3202–3212 (2008)

    Article  Google Scholar 

  21. Rasheed, K.: An adaptive penalty approach for constrained genetic-algorithm optimization. In: Proceedings of the Third Annual Genetic Programming Conference, pp. 584–590 (1998)

    Google Scholar 

  22. Renna, P.: Job shop scheduling by pheromone approach in a dynamic environment. Int. J. Comput. Integr. Manuf. 23(5), 412–424 (2010)

    Article  Google Scholar 

  23. Seo, J., Bruce, F.: Real time integrated dispatching logic for semiconductor material flow control considering multi-load automated material handling system. J. Korean Inst. Indus. Eng. 34(3), 296–307 (2008)

    Google Scholar 

  24. Seo, J., Jeong, Y., Park, S.: Reservation based dispatching rule for on-time delivery in system LSI semiconductor FAB. Korean J. Comput. Des. Eng. 19(3), 236–244 (2014)

    Article  Google Scholar 

  25. Singh, M.R., Singh, M., Mahapatra, S.S., Jagadev, N.: Particle swarm optimization algorithm embedded with maximum deviation theory for solving multi-objective flexible job shop scheduling problem. Int. J. Adv. Manuf. Technol. 85(9–12), 2353–2366 (2016)

    Article  Google Scholar 

  26. Sivakumar, A.I., Chong, C.S.: A simulation-based analysis of cycle time distribution, and throughput in semiconductor backend manufacturing. Comput. Ind. 45(1), 59–78 (2001)

    Article  Google Scholar 

  27. Suresh, V., Chaudhuri, D.: Dynamic scheduling: a survey of research. Int. J. Prod. Econ. 32(1), 53–63 (1993)

    Article  Google Scholar 

  28. Tan, Y., Aufenanger, M.: A real-time rescheduling heuristic using decentralized knowledge-based decisions for flexible flow shops with unrelated parallel machines. In: Industrial Informatics (INDIN), 2011 9th IEEE International Conference on, pp. 431–436. IEEE (2011)

    Google Scholar 

  29. Watanabe, M., Ida, K., Gen, M.: A genetic algorithm with modified crossover operator and search area adaptation for the job-shop scheduling problem. Comput. Ind. Eng. 48(4), 743–752 (2005)

    Article  Google Scholar 

  30. Weigert, G., Klemmt, A., Horn, S.: Design and validation of heuristic algorithms for simulation-based scheduling of a semiconductor backend facility. Int. J. Prod. Res. 47(8), 2165–2184 (2009)

    Article  Google Scholar 

  31. Xing, L.N., Chen, Y.W., Wang, P., Zhao, Q.S., Xiong, J.: A knowledge-based ant colony optimization for flexible job shop scheduling problems. Appl. Soft Comput. 10(3), 888–896 (2010)

    Article  Google Scholar 

  32. Yang, T., Kuo, Y., Cho, C.: A genetic algorithms simulation approach for the multi-attribute combinatorial dispatching decision problem. Eur. J. Oper. Res. 176(3), 1859–1873 (2007)

    Article  Google Scholar 

  33. Yu, J., Do, H., Kwon, Y., Sin, J., Kim, H., Nam, S., Lee, D.: Decision tree-based scheduling for static and dynamic flexible job shops with multiple process plans. J. Korean Soc. Precision Eng. 32(1), 25–37 (2015)

    Article  Google Scholar 

  34. Zhu, Y.J., Liang, Y.M.: Optimization model for job shop scheduling based on genetic algorithm. In: Proceedings of 20th International Conference on Industrial Engineering and Engineering Management, pp. 863–872. Springer, Berlin, Heidelberg (2013)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Taeho Ahn .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2021 The Author(s), under exclusive license to Springer Nature Switzerland AG

About this chapter

Check for updates. Verify currency and authenticity via CrossMark

Cite this chapter

Ahn, J., Ahn, T. (2021). Remeasurement Dispatching Rule for Semiconductor EDS Process. In: Lee, R., Kim, J.B. (eds) Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing. SNPD 2021. Studies in Computational Intelligence, vol 951. Springer, Cham. https://doi.org/10.1007/978-3-030-67008-5_13

Download citation

Publish with us

Policies and ethics