{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T07:36:54Z","timestamp":1780990614752,"version":"3.54.1"},"reference-count":71,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2025,2,26]],"date-time":"2025-02-26T00:00:00Z","timestamp":1740528000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,2,26]],"date-time":"2025-02-26T00:00:00Z","timestamp":1740528000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["72104016"],"award-info":[{"award-number":["72104016"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003213","name":"Beijing Municipal Education Commission","doi-asserted-by":"publisher","award":["SM202110005011"],"award-info":[{"award-number":["SM202110005011"]}],"id":[{"id":"10.13039\/501100003213","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003213","name":"Beijing Municipal Education Commission","doi-asserted-by":"publisher","award":["SM202010005004"],"award-info":[{"award-number":["SM202010005004"]}],"id":[{"id":"10.13039\/501100003213","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Natural Science Foundation of Chongqing, China","award":["CSTB2023NSCQ-MSX0391"],"award-info":[{"award-number":["CSTB2023NSCQ-MSX0391"]}]},{"name":"Beijing Natural Science Foundation","award":["9242003"],"award-info":[{"award-number":["9242003"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2025,8]]},"DOI":"10.1007\/s10479-025-06482-2","type":"journal-article","created":{"date-parts":[[2025,2,26]],"date-time":"2025-02-26T04:06:01Z","timestamp":1740542761000},"page":"489-524","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["A fully parallel multi-objective genetic algorithm for optimization of flexible shop floor production performance and schedule stability under dynamic environments"],"prefix":"10.1007","volume":"351","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3914-8865","authenticated-orcid":false,"given":"Jia","family":"Luo","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Didier","family":"El Baz","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Rui","family":"Xue","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jinglu","family":"Hu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Lei","family":"Shi","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2025,2,26]]},"reference":[{"issue":"21","key":"6482_CR1","doi-asserted-by":"publisher","first-page":"7797","DOI":"10.1016\/j.eswa.2015.05.032","volume":"42","author":"M Agarwal","year":"2015","unstructured":"Agarwal, M., Agrawal, N., Sharma, S., Vig, L., & Kumar, N. (2015). Parallel multi-objective multi-robot coalition formation. Expert Systems with Applications, 42(21), 7797\u20137811.","journal-title":"Expert Systems with Applications"},{"key":"6482_CR2","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2019.106047","volume":"88","author":"A Aguilar-Rivera","year":"2020","unstructured":"Aguilar-Rivera, A. (2020). A GPU fully vectorized approach to accelerate performance of NSGA-2 based on stochastic non-domination sorting and grid-crowding. Applied Soft Computing, 88, 106047.","journal-title":"Applied Soft Computing"},{"key":"6482_CR3","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1016\/j.cor.2016.03.009","volume":"73","author":"E Ahmadi","year":"2016","unstructured":"Ahmadi, E., Zandieh, M., Farrokh, M., & Emami, S. M. (2016). A multi objective optimization approach for flexible job shop scheduling problem under random machine breakdown by evolutionary algorithms. Computers & Operations Research, 73, 56\u201366.","journal-title":"Computers & Operations Research"},{"key":"6482_CR4","doi-asserted-by":"publisher","first-page":"111937","DOI":"10.1016\/j.asoc.2024.111937","volume":"164","author":"K Akram","year":"2024","unstructured":"Akram, K., Bhutta, M. U., Butt, S. I., Jaffery, S. H. I., Khan, M., Khan, A. Z., & Faraz, Z. (2024). A Pareto-optimality based black widow spider algorithm for energy efficient flexible job shop scheduling problem considering new job insertion. Applied Soft Computing, 164, 111937.","journal-title":"Applied Soft Computing"},{"key":"6482_CR5","volume-title":"Cellular genetic algorithms","author":"E Alba","year":"2009","unstructured":"Alba, E., & Dorronsoro, B. (2009). Cellular genetic algorithms. New York: Springer."},{"issue":"2","key":"6482_CR6","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1016\/j.ejor.2020.11.016","volume":"292","author":"C Audet","year":"2021","unstructured":"Audet, C., Bigeon, J., Cartier, D., Le Digabel, S., & Salomon, L. (2021). Performance indicators in multiobjective optimization. European Journal of Operational Research, 292(2), 397\u2013422.","journal-title":"European Journal of Operational Research"},{"key":"6482_CR7","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1016\/j.jmsy.2020.06.005","volume":"56","author":"A Baykaso\u011flu","year":"2020","unstructured":"Baykaso\u011flu, A., Madeno\u011flu, F. S., & Hamzaday\u0131, A. (2020). Greedy randomized adaptive search for dynamic flexible job-shop scheduling. Journal of Manufacturing Systems, 56, 425\u2013451.","journal-title":"Journal of Manufacturing Systems"},{"issue":"3","key":"6482_CR8","doi-asserted-by":"publisher","first-page":"540","DOI":"10.1287\/ijoc.2016.0693","volume":"28","author":"MA Boschetti","year":"2016","unstructured":"Boschetti, M. A., Maniezzo, V., & Strappaveccia, F. (2016). Using GPU computing for solving the two-dimensional guillotine cutting problem. INFORMS Journal on Computing, 28(3), 540\u2013552.","journal-title":"INFORMS Journal on Computing"},{"issue":"3","key":"6482_CR9","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/BF02023073","volume":"41","author":"P Brandimarte","year":"1993","unstructured":"Brandimarte, P. (1993). Routing and scheduling in a flexible job shop by tabu search. Annals of Operations Research, 41(3), 157\u2013183.","journal-title":"Annals of Operations Research"},{"issue":"10","key":"6482_CR10","doi-asserted-by":"publisher","first-page":"1165","DOI":"10.1016\/S0094-114X(02)00051-4","volume":"37","author":"JA Cabrera","year":"2002","unstructured":"Cabrera, J. A., Simon, A., & Prado, M. (2002). Optimal synthesis of mechanisms with genetic algorithms. Mechanism and Machine Theory, 37(10), 1165\u20131177.","journal-title":"Mechanism and Machine Theory"},{"key":"6482_CR11","doi-asserted-by":"crossref","unstructured":"Capodieci, N., & Burgio, P. (2015). Efficient implementation of genetic algorithms on gp-gpu with scheduled persistent cuda threads. In:\u00a02015 Seventh International Symposium on Parallel Architectures, Algorithms and Programming (PAAP)\u00a0(pp. 6\u201312). IEEE.","DOI":"10.1109\/PAAP.2015.13"},{"issue":"2","key":"6482_CR12","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1109\/4235.996017","volume":"6","author":"K Deb","year":"2002","unstructured":"Deb, K., Pratap, A., Agarwal, S., & Meyarivan, T. A. M. T. (2002). A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Transactions on Evolutionary Computation, 6(2), 182\u2013197.","journal-title":"IEEE Transactions on Evolutionary Computation"},{"issue":"3","key":"6482_CR13","doi-asserted-by":"publisher","first-page":"977","DOI":"10.1016\/j.apm.2012.03.020","volume":"37","author":"Y Demir","year":"2013","unstructured":"Demir, Y., & \u0130\u015fleyen, S. K. (2013). Evaluation of mathematical models for flexible job-shop scheduling problems. Applied Mathematical Modelling, 37(3), 977\u2013988.","journal-title":"Applied Mathematical Modelling"},{"issue":"1","key":"6482_CR14","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/j.swevo.2011.02.002","volume":"1","author":"J Derrac","year":"2011","unstructured":"Derrac, J., Garc\u00eda, S., Molina, D., & Herrera, F. (2011). A practical tutorial on the use of nonparametric statistical tests as a methodology for comparing evolutionary and swarm intelligence algorithms. Swarm and Evolutionary Computation, 1(1), 3\u201318.","journal-title":"Swarm and Evolutionary Computation"},{"issue":"3","key":"6482_CR15","doi-asserted-by":"publisher","first-page":"816","DOI":"10.1007\/s11227-012-0773-y","volume":"63","author":"B Dorronsoro","year":"2013","unstructured":"Dorronsoro, B., & Bouvry, P. (2013). Cellular genetic algorithms without additional parameters. The Journal of Supercomputing, 63(3), 816\u2013835.","journal-title":"The Journal of Supercomputing"},{"issue":"2","key":"6482_CR16","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1016\/j.cirpj.2009.10.001","volume":"2","author":"P Fattahi","year":"2010","unstructured":"Fattahi, P., & Fallahi, A. (2010). Dynamic scheduling in flexible job shop systems by considering simultaneously efficiency and stability. CIRP Journal of Manufacturing Science and Technology, 2(2), 114\u2013123.","journal-title":"CIRP Journal of Manufacturing Science and Technology"},{"issue":"4","key":"6482_CR17","doi-asserted-by":"publisher","first-page":"904","DOI":"10.1109\/JAS.2019.1911540","volume":"6","author":"K Gao","year":"2019","unstructured":"Gao, K., Cao, Z., Zhang, L., Chen, Z., Han, Y., & Pan, Q. (2019). A review on swarm intelligence and evolutionary algorithms for solving flexible job shop scheduling problems. IEEE\/CAA Journal of Automatica Sinica, 6(4), 904\u2013916.","journal-title":"IEEE\/CAA Journal of Automatica Sinica"},{"key":"6482_CR18","doi-asserted-by":"crossref","unstructured":"Gupta, S., & Tan, G. (2015). A scalable parallel implementation of evolutionary algorithms for multi-objective optimization on GPUs. In: 2015 IEEE Congress on Evolutionary Computation (CEC)\u00a0(pp. 1567\u20131574). IEEE.","DOI":"10.1109\/CEC.2015.7257074"},{"issue":"4","key":"6482_CR19","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3400031","volume":"53","author":"T Harada","year":"2020","unstructured":"Harada, T., & Alba, E. (2020). Parallel genetic algorithms: A useful survey. ACM Computing Surveys (CSUR), 53(4), 1\u201339.","journal-title":"ACM Computing Surveys (CSUR)"},{"key":"6482_CR20","unstructured":"Harris, M. (2012). An easy introduction to CUDA C and C++, https:\/\/devblogs.nvidia.com\/parallelforall\/easy-introduction-cuda-c-and-c\/ ."},{"key":"6482_CR21","unstructured":"https:\/\/www.dropbox.com\/scl\/fo\/je7yu1f0uhrt60x1hd52l\/AMaEkEI2JJXvdlSP6a2LJQs?rlkey=01407hsysw67tuujd8qtzhvzt&st=t7yll789&dl=0"},{"key":"6482_CR22","unstructured":"https:\/\/www.ibm.com\/analytics\/spss-statistics-software"},{"key":"6482_CR23","doi-asserted-by":"publisher","DOI":"10.1016\/j.engappai.2024.108634","volume":"133","author":"Y Hu","year":"2024","unstructured":"Hu, Y., Zhang, L., Zhang, Z., Li, Z., & Tang, Q. (2024). Matheuristic and learning-oriented multi-objective artificial bee colony algorithm for energy-aware flexible assembly job shop scheduling problem. Engineering Applications of Artificial Intelligence, 133, 108634.","journal-title":"Engineering Applications of Artificial Intelligence"},{"issue":"3","key":"6482_CR24","doi-asserted-by":"publisher","first-page":"392","DOI":"10.1109\/5326.704576","volume":"28","author":"H Ishibuchi","year":"1998","unstructured":"Ishibuchi, H., & Murata, T. (1998). A multi-objective genetic local search algorithm and its application to flowshop scheduling. IEEE Transactions on Systems Man and Cybernetics Part C (Applications and Reviews), 28(3), 392\u2013403.","journal-title":"IEEE Transactions on Systems Man and Cybernetics Part C (Applications and Reviews)"},{"issue":"3","key":"6482_CR25","doi-asserted-by":"publisher","first-page":"694","DOI":"10.1007\/s11750-020-00588-5","volume":"29","author":"A Kacem","year":"2021","unstructured":"Kacem, A., & Dammak, A. (2021). Multi-objective scheduling on two dedicated processors. TOP, 29(3), 694\u2013721.","journal-title":"TOP"},{"issue":"1","key":"6482_CR26","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1109\/TSMCC.2002.1009117","volume":"32","author":"I Kacem","year":"2002","unstructured":"Kacem, I., Hammadi, S., & Borne, P. (2002a). Approach by localization and multiobjective evolutionary optimization for flexible job-shop scheduling problems. IEEE Transactions on Systems, Man, and Cybernetics, Part C (Applications and Reviews), 32(1), 1\u201313.","journal-title":"IEEE Transactions on Systems, Man, and Cybernetics, Part C (Applications and Reviews)"},{"issue":"3\u20135","key":"6482_CR27","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1016\/S0378-4754(02)00019-8","volume":"60","author":"I Kacem","year":"2002","unstructured":"Kacem, I., Hammadi, S., & Borne, P. (2002b). Pareto-optimality approach for flexible job-shop scheduling problems: Hybridization of evolutionary algorithms and fuzzy logic. Mathematics and Computers in Simulation, 60(3\u20135), 245\u2013276.","journal-title":"Mathematics and Computers in Simulation"},{"key":"6482_CR28","doi-asserted-by":"crossref","unstructured":"Kefalas, M., Limmer, S., Apostolidis, A., Olhofer, M., Emmerich, M., & B\u00e4ck, T. (2019). A tabu search-based memetic algorithm for the multi-objective flexible job shop scheduling problem. In:\u00a0Proceedings of the Genetic and Evolutionary Computation Conference Companion\u00a0(pp. 1254\u20131262).","DOI":"10.1145\/3319619.3326817"},{"issue":"4","key":"6482_CR29","doi-asserted-by":"publisher","first-page":"2514","DOI":"10.3934\/era.2024116","volume":"32","author":"D Kim","year":"2024","unstructured":"Kim, D., & Kim, J. (2024). GPU-accelerated non-dominated sorting genetic algorithm III for maximizing protein production. Electronic Research Archive, 32(4), 2514\u20132540.","journal-title":"Electronic Research Archive"},{"key":"6482_CR30","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1016\/S0167-5060(08)70743-X","volume":"1","author":"JK Lenstra","year":"1977","unstructured":"Lenstra, J. K., Kan, A. R., & Brucker, P. (1977). Complexity of machine scheduling problems. Annals of Discrete Mathematics, 1, 343\u2013362.","journal-title":"Annals of Discrete Mathematics"},{"key":"6482_CR31","doi-asserted-by":"crossref","unstructured":"Li, Y., & Wang, J. (2020). Multi-objective dynamic scheduling model of flexible job shop based on nsgaii algorithm and scroll window technology. In:\u00a0International Conference on Swarm Intelligence\u00a0(pp. 435\u2013444). Springer, Cham.","DOI":"10.1007\/978-3-030-53956-6_39"},{"key":"6482_CR32","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2021.107211","volume":"155","author":"K Li","year":"2021","unstructured":"Li, K., Deng, Q., Zhang, L., Fan, Q., Gong, G., & Ding, S. (2021). An effective MCTS-based algorithm for minimizing makespan in dynamic flexible job shop scheduling problem. Computers & Industrial Engineering, 155, 107211.","journal-title":"Computers & Industrial Engineering"},{"key":"6482_CR33","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2022.108099","volume":"168","author":"R Li","year":"2022","unstructured":"Li, R., Gong, W., & Lu, C. (2022). Self-adaptive multi-objective evolutionary algorithm for flexible job shop scheduling with fuzzy processing time. Computers & Industrial Engineering, 168, 108099.","journal-title":"Computers & Industrial Engineering"},{"key":"6482_CR34","doi-asserted-by":"publisher","DOI":"10.1016\/j.engappai.2024.107917","volume":"132","author":"J Liu","year":"2024","unstructured":"Liu, J., Sun, B., Li, G., & Chen, Y. (2024). Multi-objective adaptive large neighbourhood search algorithm for dynamic flexible job shop schedule problem with transportation resource. Engineering Applications of Artificial Intelligence, 132, 107917.","journal-title":"Engineering Applications of Artificial Intelligence"},{"key":"6482_CR35","volume":"39","author":"F Luan","year":"2023","unstructured":"Luan, F., Zhao, H., Liu, S. Q., He, Y., & Tang, B. (2023). Enhanced NSGA-II for multi-objective energy-saving flexible job shop scheduling. Sustainable Computing: Informatics and Systems, 39, 100901.","journal-title":"Sustainable Computing: Informatics and Systems"},{"key":"6482_CR36","doi-asserted-by":"crossref","unstructured":"Luna, F., & Alba, E. (2015). Parallel multiobjective evolutionary algorithms. In:\u00a0Springer Handbook of Computational Intelligence\u00a0(pp. 1017\u20131031). Springer, Berlin, Heidelberg.","DOI":"10.1007\/978-3-662-43505-2_50"},{"key":"6482_CR37","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1016\/j.future.2020.02.019","volume":"108","author":"J Luo","year":"2020","unstructured":"Luo, J., El Baz, D., Xue, R., & Hu, J. (2020). Solving the dynamic energy aware job shop scheduling problem with the heterogeneous parallel genetic algorithm. Future Generation Computer Systems, 108, 119\u2013134.","journal-title":"Future Generation Computer Systems"},{"key":"6482_CR38","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1016\/j.jpdc.2018.07.022","volume":"133","author":"J Luo","year":"2019","unstructured":"Luo, J., Fujimura, S., El Baz, D., & Plazolles, B. (2019). GPU based parallel genetic algorithm for solving an energy efficient dynamic flexible flow shop scheduling problem. Journal of Parallel and Distributed Computing, 133, 244\u2013257.","journal-title":"Journal of Parallel and Distributed Computing"},{"key":"6482_CR39","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2020.106208","volume":"91","author":"S Luo","year":"2020","unstructured":"Luo, S. (2020). Dynamic scheduling for flexible job shop with new job insertions by deep reinforcement learning. Applied Soft Computing, 91, 106208.","journal-title":"Applied Soft Computing"},{"key":"6482_CR40","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2022.108794","volume":"121","author":"S Mahmud","year":"2022","unstructured":"Mahmud, S., Chakrabortty, R. K., Abbasi, A., & Ryan, M. J. (2022). Swarm intelligent based metaheuristics for a bi-objective flexible job shop integrated supply chain scheduling problems. Applied Soft Computing, 121, 108794.","journal-title":"Applied Soft Computing"},{"issue":"23","key":"6482_CR41","doi-asserted-by":"publisher","first-page":"7071","DOI":"10.1080\/00207543.2015.1005248","volume":"53","author":"G May","year":"2015","unstructured":"May, G., Stahl, B., Taisch, M., & Prabhu, V. (2015). Multi-objective genetic algorithm for energy-efficient job shop scheduling. International Journal of Production Research, 53(23), 7071\u20137089.","journal-title":"International Journal of Production Research"},{"issue":"3","key":"6482_CR42","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1287\/ijoc.1070.0258","volume":"20","author":"G Minella","year":"2008","unstructured":"Minella, G., Ruiz, R., & Ciavotta, M. (2008). A review and evaluation of multiobjective algorithms for the flowshop scheduling problem. INFORMS Journal on Computing, 20(3), 451\u2013471.","journal-title":"INFORMS Journal on Computing"},{"issue":"4","key":"6482_CR43","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1109\/MCI.2018.2866731","volume":"13","author":"S Nguyen","year":"2018","unstructured":"Nguyen, S., Zhang, M., Alahakoon, D., & Tan, K. C. (2018). Visualizing the evolution of computer programs for genetic programming [research frontier]. IEEE Computational Intelligence Magazine, 13(4), 77\u201394.","journal-title":"IEEE Computational Intelligence Magazine"},{"issue":"3","key":"6482_CR44","doi-asserted-by":"publisher","first-page":"603","DOI":"10.1007\/s10845-015-1039-3","volume":"29","author":"M Nouiri","year":"2018","unstructured":"Nouiri, M., Bekrar, A., Jemai, A., Niar, S., & Ammari, A. C. (2018). An effective and distributed particle swarm optimization algorithm for flexible job-shop scheduling problem. Journal of Intelligent Manufacturing, 29(3), 603\u2013615.","journal-title":"Journal of Intelligent Manufacturing"},{"issue":"3","key":"6482_CR45","doi-asserted-by":"publisher","first-page":"607","DOI":"10.1007\/s10898-016-0468-7","volume":"69","author":"G Ortega","year":"2017","unstructured":"Ortega, G., Filatovas, E., Garzon, E. M., & Casado, L. G. (2017). Non-dominated sorting procedure for Pareto dominance ranking on multicore CPU and\/or GPU. Journal of Global Optimization, 69(3), 607\u2013627.","journal-title":"Journal of Global Optimization"},{"issue":"4","key":"6482_CR46","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1007\/s10951-008-0090-8","volume":"12","author":"D Ouelhadj","year":"2009","unstructured":"Ouelhadj, D., & Petrovic, S. (2009). A survey of dynamic scheduling in manufacturing systems. Journal of Scheduling, 12(4), 417\u2013431.","journal-title":"Journal of Scheduling"},{"key":"6482_CR47","doi-asserted-by":"crossref","unstructured":"Padurariu, F. R., & Marinescu, C. (2014). NSGA-II: Implementation and performance metrics extraction for CPU and GPU. In: 2014 16th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (pp. 494\u2013499). IEEE.","DOI":"10.1109\/SYNASC.2014.72"},{"issue":"4","key":"6482_CR48","doi-asserted-by":"publisher","first-page":"597","DOI":"10.1016\/S0360-8352(03)00077-9","volume":"45","author":"BJ Park","year":"2003","unstructured":"Park, B. J., Choi, H. R., & Kim, H. S. (2003). A hybrid genetic algorithm for the job shop scheduling problems. Computers & Industrial Engineering, 45(4), 597\u2013613.","journal-title":"Computers & Industrial Engineering"},{"key":"6482_CR49","volume-title":"Gpu gems 2: for high-performance graphics and general-purpose computation","author":"M Pharr","year":"2005","unstructured":"Pharr, M., & Fernando, R. (2005). Gpu gems 2: for high-performance graphics and general-purpose computation. Boston: Addison-Wesley Professional."},{"issue":"1","key":"6482_CR50","doi-asserted-by":"publisher","first-page":"98","DOI":"10.3390\/pr10010098","volume":"10","author":"I Rahimi","year":"2022","unstructured":"Rahimi, I., Gandomi, A. H., Deb, K., Chen, F., & Nikoo, M. R. (2022). Scheduling by NSGA-II: Review and bibliometric analysis. Processes, 10(1), 98.","journal-title":"Processes"},{"issue":"1","key":"6482_CR51","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.cie.2003.09.007","volume":"46","author":"R Rangsaritratsamee","year":"2004","unstructured":"Rangsaritratsamee, R., Ferrell, W. G., Jr., & Kurz, M. B. (2004). Dynamic rescheduling that simultaneously considers efficiency and stability. Computers & Industrial Engineering, 46(1), 1\u201315.","journal-title":"Computers & Industrial Engineering"},{"key":"6482_CR52","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1016\/j.measurement.2017.09.022","volume":"114","author":"MS Reddy","year":"2018","unstructured":"Reddy, M. S., Ratnam, C., Rajyalakshmi, G., & Manupati, V. K. (2018). An effective hybrid multi objective evolutionary algorithm for solving real time event in flexible job shop scheduling problem. Measurement, 114, 78\u201390.","journal-title":"Measurement"},{"key":"6482_CR53","volume-title":"A study of control parameters affecting online performance of genetic algorithms for function optimization","author":"JDAR Schaffer","year":"1989","unstructured":"Schaffer, J. D. A. R. (1989). A study of control parameters affecting online performance of genetic algorithms for function optimization. California: San Mateo."},{"issue":"1","key":"6482_CR54","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ejor.2019.11.033","volume":"287","author":"G Schryen","year":"2020","unstructured":"Schryen, G. (2020). Parallel computational optimization in operations research: A new integrative framework, literature review and research directions. European Journal of Operational Research, 287(1), 1\u201318.","journal-title":"European Journal of Operational Research"},{"issue":"9","key":"6482_CR55","doi-asserted-by":"publisher","first-page":"2885","DOI":"10.1007\/s00170-012-4701-3","volume":"67","author":"X Shao","year":"2013","unstructured":"Shao, X., Liu, W., Liu, Q., & Zhang, C. (2013). Hybrid discrete particle swarm optimization for multi-objective flexible job-shop scheduling problem. The International Journal of Advanced Manufacturing Technology, 67(9), 2885\u20132901.","journal-title":"The International Journal of Advanced Manufacturing Technology"},{"key":"6482_CR56","doi-asserted-by":"publisher","first-page":"198","DOI":"10.1016\/j.ins.2014.11.036","volume":"298","author":"XN Shen","year":"2015","unstructured":"Shen, X. N., & Yao, X. (2015). Mathematical modeling and multi-objective evolutionary algorithms applied to dynamic flexible job shop scheduling problems. Information Sciences, 298, 198\u2013224.","journal-title":"Information Sciences"},{"key":"6482_CR57","doi-asserted-by":"crossref","unstructured":"Tran, B. T., & Luong, N. H. (2024, July). On the investigation of multimodal evolutionary algorithms using search trajectory networks. In:\u00a0Proceedings of the Genetic and Evolutionary Computation Conference\u00a0(pp. 32\u201340).","DOI":"10.1145\/3638529.3654050"},{"issue":"8","key":"6482_CR58","doi-asserted-by":"publisher","first-page":"1949","DOI":"10.1007\/s10845-020-01547-4","volume":"31","author":"A T\u00fcrky\u0131lmaz","year":"2020","unstructured":"T\u00fcrky\u0131lmaz, A., \u015eenvar, \u00d6., \u00dcnal, \u0130, & Bulkan, S. (2020). A research survey: Heuristic approaches for solving multi objective flexible job shop problems. Journal of Intelligent Manufacturing, 31(8), 1949\u20131983.","journal-title":"Journal of Intelligent Manufacturing"},{"issue":"9","key":"6482_CR59","doi-asserted-by":"publisher","first-page":"3326","DOI":"10.1080\/00207543.2017.1420262","volume":"56","author":"J Vallikavungal Devassia","year":"2018","unstructured":"Vallikavungal Devassia, J., Salazar-Aguilar, M. A., & Boyer, V. (2018). Flexible job-shop scheduling problem with resource recovery constraints. International Journal of Production Research, 56(9), 3326\u20133343.","journal-title":"International Journal of Production Research"},{"issue":"1","key":"6482_CR60","first-page":"6062689","volume":"2021","author":"Y Wang","year":"2021","unstructured":"Wang, Y., & Han, J. (2021). A FJSSP method based on dynamic multi-objective squirrel search algorithm. International Journal of Antennas and Propagation, 2021(1), 6062689.","journal-title":"International Journal of Antennas and Propagation"},{"key":"6482_CR61","doi-asserted-by":"crossref","unstructured":"Wong, M. L., & Cui, G. (2013). Data mining using parallel multi-objective evolutionary algorithms on graphics processing units. In:\u00a0Massively Parallel Evolutionary Computation on GPGPUs\u00a0(pp. 287\u2013307). Springer, Berlin, Heidelberg.","DOI":"10.1007\/978-3-642-37959-8_14"},{"issue":"3","key":"6482_CR62","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1049\/iet-cim.2018.0009","volume":"1","author":"J Xie","year":"2019","unstructured":"Xie, J., Gao, L., Peng, K., Li, X., & Li, H. (2019). Review on flexible job shop scheduling. IET Collaborative Intelligent Manufacturing, 1(3), 67\u201377.","journal-title":"IET Collaborative Intelligent Manufacturing"},{"issue":"1","key":"6482_CR63","doi-asserted-by":"publisher","first-page":"478981","DOI":"10.1155\/2012\/478981","volume":"2012","author":"J Xiong","year":"2012","unstructured":"Xiong, J., Tan, X., Yang, K. W., Xing, L. N., & Chen, Y. W. (2012). A hybrid multiobjective evolutionary approach for flexible job-shop scheduling problems. Mathematical Problems in Engineering, 2012(1), 478981.","journal-title":"Mathematical Problems in Engineering"},{"key":"6482_CR64","doi-asserted-by":"publisher","first-page":"334","DOI":"10.1016\/j.jmsy.2024.02.007","volume":"73","author":"Y Xu","year":"2024","unstructured":"Xu, Y., Zhang, M., Yang, M., & Wang, D. (2024). Hybrid quantum particle swarm optimization and variable neighborhood search for flexible job-shop scheduling problem. Journal of Manufacturing Systems, 73, 334\u2013348.","journal-title":"Journal of Manufacturing Systems"},{"issue":"10","key":"6482_CR65","doi-asserted-by":"publisher","first-page":"3020","DOI":"10.1080\/00207543.2018.1524165","volume":"57","author":"MS Zadeh","year":"2019","unstructured":"Zadeh, M. S., Katebi, Y., & Doniavi, A. (2019). A heuristic model for dynamic flexible job shop scheduling problem considering variable processing times. International Journal of Production Research, 57(10), 3020\u20133035.","journal-title":"International Journal of Production Research"},{"issue":"6","key":"6482_CR66","doi-asserted-by":"publisher","first-page":"2829","DOI":"10.3390\/app12062829","volume":"12","author":"R Zarrouk","year":"2022","unstructured":"Zarrouk, R., Daoud, W. B., Mahfoudhi, S., & Jemai, A. (2022). Embedded PSO for solving FJSP on embedded environment (Industry 4.0 Era). Applied Sciences, 12(6), 2829.","journal-title":"Applied Sciences"},{"key":"6482_CR67","doi-asserted-by":"crossref","unstructured":"Zhang, F., Mei, Y., & Zhang, M. (2019). Evolving dispatching rules for multi-objective dynamic flexible job shop scheduling via genetic programming hyper-heuristics. In: 2019 IEEE Congress on Evolutionary Computation (CEC)\u00a0(pp. 1366\u20131373). IEEE.","DOI":"10.1109\/CEC.2019.8790112"},{"issue":"7","key":"6482_CR68","doi-asserted-by":"publisher","first-page":"4473","DOI":"10.1109\/TCYB.2022.3196887","volume":"53","author":"F Zhang","year":"2022","unstructured":"Zhang, F., Mei, Y., Nguyen, S., & Zhang, M. (2022). Multitask multiobjective genetic programming for automated scheduling heuristic learning in dynamic flexible job-shop scheduling. IEEE Transactions on Cybernetics, 53(7), 4473\u20134486.","journal-title":"IEEE Transactions on Cybernetics"},{"key":"6482_CR69","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2020.100664","volume":"54","author":"G Zhang","year":"2020","unstructured":"Zhang, G., Hu, Y., Sun, J., & Zhang, W. (2020). An improved genetic algorithm for the flexible job shop scheduling problem with multiple time constraints. Swarm and Evolutionary Computation, 54, 100664.","journal-title":"Swarm and Evolutionary Computation"},{"issue":"6","key":"6482_CR70","doi-asserted-by":"publisher","first-page":"712","DOI":"10.1109\/TEVC.2007.892759","volume":"11","author":"Q Zhang","year":"2007","unstructured":"Zhang, Q., & Li, H. (2007). MOEA\/D: A multiobjective evolutionary algorithm based on decomposition. IEEE Transactions on Evolutionary Computation, 11(6), 712\u2013731.","journal-title":"IEEE Transactions on Evolutionary Computation"},{"issue":"1","key":"6482_CR71","doi-asserted-by":"publisher","first-page":"179","DOI":"10.3390\/su11010179","volume":"11","author":"Z Zhang","year":"2018","unstructured":"Zhang, Z., Wu, L., Peng, T., & Jia, S. (2018). An improved scheduling approach for minimizing total energy consumption and makespan in a flexible job shop environment. Sustainability, 11(1), 179.","journal-title":"Sustainability"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-025-06482-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10479-025-06482-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-025-06482-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,6]],"date-time":"2025-09-06T07:47:04Z","timestamp":1757144824000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10479-025-06482-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,2,26]]},"references-count":71,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2025,8]]}},"alternative-id":["6482"],"URL":"https:\/\/doi.org\/10.1007\/s10479-025-06482-2","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,2,26]]},"assertion":[{"value":"27 April 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 January 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 February 2025","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declaration"}},{"value":"The authors declare no potential conflicts of interest concerning the research, authorship, and\/or publication of this article.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"This article does not contain any studies with human participants or animals performed by any of the authors.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical approval"}}]}}