Abstract
In recent years, with the rapid development of the global semiconductor industry, the importance of monocrystalline silicon is increasingly important. This paper addresses a novel monocrystalline silicon production (MSP) scheduling problem. We analyze the characteristics of the MSP, and the MSP is molded as an unrelated parallel machine scheduling problem with maintenance cycle and machine setup time. To solve the MSP problem, a learning based memetic algorithm (LMA) is proposed. In the LMA, first, a high-quality initial population is constructed according to problem-specific knowledge, as well as an initial probability distribution model is established to accumulate valuable information about superior individuals. Second, to improve the ability of global exploration, an adaptive update mechanism based on the probability distribution model is developed, and a sampling method that keeps excellent patterns was designed to generate a new population. Third, a local search strategy based on variable neighborhood descent (VND) is designed to enhance the local exploitation ability. In the VND component, to enrich the search behavior, four self-adaptive neighborhood operators are devised. Moreover, we applied the simulated annealing (SA) as acceptance criteria of solutions to avoid the algorithm falling into a local optimum. Finally, simulation experiments based on some real-world instances from an MSP process demonstrate the effectiveness of the proposed LMA in solving the MSP scheduling problem.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Pan, Q.-K.: An effective co-evolutionary artificial bee colony algorithm for steelmaking-continuous casting scheduling. Eur. J. Oper. Res. 250 (2015)
Adan, J.: A hybrid genetic algorithm for parallel machine scheduling with setup times. J. Intell. Manuf. 33, 1–15 (2022)
Sels, V., Coelho, J., Dias, A., Vanhoucke, M.: Hybrid tabu search and a truncated branch-and-bound for the unrelated parallel machine scheduling problem. Comput. Oper. Res. 53, 107–117 (2015)
Meiyao, L., Lei, D.: An artificial bee colony with division for distributed unrelated parallel machine scheduling with preventive maintenance. Comput. Ind. Eng. 141, 106320 (2020)
Fang, W., Zhu, H., Mei, Y.: Hybrid meta-heuristics for the unrelated parallel machine scheduling problem with setup times. Knowl. Based Syst. 241, 108193 (2022)
Sheremetov, L., Muñoz, J., Chi-Chim, M.: Two-stage genetic algorithm for parallel machines scheduling problem: cyclic steam stimulation of high viscosity oil reservoirs. Appl. Soft Comput. 64 (2017)
Berthier, A., Yalaoui, A., Chehade, H., Yalaoui, F., Amodeo, L., Bouillot, C.: Unrelated parallel machines scheduling with dependent setup times in textile industry. Comput. Ind. Eng. 174, 108736 (2022)
Yalaoui, F., Chu, C.: An efficient heuristic approach for parallel machine scheduling with job splitting and sequence-dependent setup times. IIE Trans. 35, 183–190 (2003)
Zhang, Z.-Q., Hu, R., Qian, B., Jin, H.-P., Wang, L., Yang, J.-B.: A matrix cube-based estimation of distribution algorithm for the energy-efficient distributed assembly permutation flow-shop scheduling problem. Expert Syst. Appl. 194 (2022)
Wu, X., Che, A.: A memetic differential evolution algorithm for energy-efficient parallel machine scheduling. Omega 82 (2018)
Wang, J.-j., Wang, L.: A cooperative memetic algorithm with feedback for the energy-aware distributed flow-shops with flexible assembly scheduling. Comput. Ind. Eng. 168, 108126 (2022)
Li, Z., Tang, L., Liu, J.: A memetic algorithm based on probability learning for solving the multidimensional knapsack problem. IEEE Trans. Cybern. PP, 1–16 (2020)
Wang, J.-j., Wang, L.: A cooperative memetic algorithm with learning-based agent for energy-aware distributed hybrid flow-shop scheduling. IEEE Trans. Evol. Comput., 1 (2021)
Mao, J.-Y., Pan, Q.-K., Miao, Z.-H., Gao, L., Chen, S.: A hash map-based memetic algorithm for the distributed permutation flowshop scheduling problem with preventive maintenance to minimize total flowtime. Knowl. Based Syst. 242, 108413 (2022)
Joo, C., Kim, B.: Hybrid genetic algorithms with dispatching rules for unrelated parallel machine scheduling with setup time and production availability. Comput. Ind. Eng. 85 (2015)
Abdullah, S., Turky, A., Ahmad Nazri, M.Z., Sabar, N.: An evolutionary variable neighbourhood search for the unrelated parallel machine scheduling problem. IEEE Access, 1 (2021)
Acknowledgements
This research was supported by the National Natural Science Foundation of China (62173169 and 61963022), the Basic Research Key Project of Yunnan Province (202201AS070030), and Yunnan Fundamental Research Projects (grant NO. 202301AT070458).
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2023 The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.
About this paper
Cite this paper
Gong, J., Li, Z., Qian, B., Hu, R., Wang, B. (2023). Learning Based Memetic Algorithm for the Monocrystalline Silicon Production Scheduling Problem. In: Huang, DS., Premaratne, P., Jin, B., Qu, B., Jo, KH., Hussain, A. (eds) Advanced Intelligent Computing Technology and Applications. ICIC 2023. Lecture Notes in Computer Science, vol 14086. Springer, Singapore. https://doi.org/10.1007/978-981-99-4755-3_20
Download citation
DOI: https://doi.org/10.1007/978-981-99-4755-3_20
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-99-4754-6
Online ISBN: 978-981-99-4755-3
eBook Packages: Computer ScienceComputer Science (R0)