{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,16]],"date-time":"2026-07-16T17:15:27Z","timestamp":1784222127555,"version":"3.55.0"},"reference-count":50,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2023,10,25]],"date-time":"2023-10-25T00:00:00Z","timestamp":1698192000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,10,25]],"date-time":"2023-10-25T00:00:00Z","timestamp":1698192000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Intell Manuf"],"published-print":{"date-parts":[[2025,1]]},"DOI":"10.1007\/s10845-023-02227-9","type":"journal-article","created":{"date-parts":[[2023,10,25]],"date-time":"2023-10-25T15:02:28Z","timestamp":1698246148000},"page":"185-208","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":34,"title":["Q-learning-based multi-objective particle swarm optimization with local search within factories for energy-efficient distributed flow-shop scheduling problem"],"prefix":"10.1007","volume":"36","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8214-0693","authenticated-orcid":false,"given":"Wenqiang","family":"Zhang","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Huili","family":"Geng","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Chen","family":"Li","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mitsuo","family":"Gen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Guohui","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Miaolei","family":"Deng","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2023,10,25]]},"reference":[{"issue":"23","key":"2227_CR1","doi-asserted-by":"publisher","first-page":"4555","DOI":"10.3390\/math10234555","volume":"10","author":"I Brajevi\u0107","year":"2022","unstructured":"Brajevi\u0107, I., Stanimirovi\u0107, P. S., Li, S., Cao, X., Khan, A. T., & Kazakovtsev, L. A. (2022). Hybrid sine cosine algorithm for solving engineering optimization problems. Mathematics, 10(23), 4555. https:\/\/doi.org\/10.3390\/math10234555","journal-title":"Mathematics"},{"issue":"2","key":"2227_CR2","doi-asserted-by":"publisher","first-page":"562","DOI":"10.1016\/j.ejor.2022.06.009","volume":"305","author":"M Chih","year":"2023","unstructured":"Chih, M. (2023). Stochastic stability analysis of particle swarm optimization with pseudo random number assignment strategy. European Journal of Operational Research, 305(2), 562\u2013593.","journal-title":"European Journal of Operational Research"},{"issue":"3","key":"2227_CR3","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1109\/TEVC.2004.826067","volume":"8","author":"CAC Coello","year":"2004","unstructured":"Coello, C. A. C., Pulido, G. T., & Lechuga, M. S. (2004). Handling multiple objectives with particle swarm optimization. IEEE Transactions on Evolutionary Computation, 8(3), 256\u2013279. https:\/\/doi.org\/10.1109\/TEVC.2004.826067","journal-title":"IEEE Transactions on Evolutionary Computation"},{"key":"2227_CR4","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2023.119805","volume":"222","author":"H Cui","year":"2023","unstructured":"Cui, H., Li, X., & Gao, L. (2023). An improved multi-population genetic algorithm with a greedy job insertion inter-factory neighborhood structure for distributed heterogeneous hybrid flow shop scheduling problem. Expert Systems with Applications, 222, 119805. https:\/\/doi.org\/10.1016\/j.eswa.2023.119805","journal-title":"Expert Systems with Applications"},{"issue":"1","key":"2227_CR5","doi-asserted-by":"publisher","first-page":"651","DOI":"10.1016\/j.jestch.2015.09.009","volume":"19","author":"P Das","year":"2016","unstructured":"Das, P., Behera, H., & Panigrahi, B. (2016). Intelligent-based multi-robot path planning inspired by improved classical Q-learning and improved particle swarm optimization with perturbed velocity. Engineering Science and Technology, an International Journal, 19(1), 651\u2013669. https:\/\/doi.org\/10.1016\/j.jestch.2015.09.009","journal-title":"Engineering Science and Technology, an International Journal"},{"issue":"2","key":"2227_CR6","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. (2002). A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Transactions on Evolutionary Computation, 6(2), 182\u2013197. https:\/\/doi.org\/10.1109\/4235.996017","journal-title":"IEEE Transactions on Evolutionary Computation"},{"issue":"1","key":"2227_CR7","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. https:\/\/doi.org\/10.1016\/j.swevo.2011.02.002","journal-title":"Swarm and Evolutionary Computation"},{"key":"2227_CR8","doi-asserted-by":"publisher","first-page":"464","DOI":"10.1016\/j.cie.2018.03.014","volume":"118","author":"V Fernandez-Viagas","year":"2018","unstructured":"Fernandez-Viagas, V., Perez-Gonzalez, P., & Framinan, J. M. (2018). The distributed permutation flow shop to minimise the total flowtime. Computers & Industrial Engineering, 118, 464\u2013477. https:\/\/doi.org\/10.1016\/j.cie.2018.03.014","journal-title":"Computers & Industrial Engineering"},{"key":"2227_CR9","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2019.100572","volume":"50","author":"X Fu","year":"2019","unstructured":"Fu, X., Chan, F. T., Niu, B., Chung, N. S., & Qu, T. (2019). A three-level particle swarm optimization with variable neighbourhood search algorithm for the production scheduling problem with mould maintenance. Swarm and Evolutionary Computation, 50, 100572. https:\/\/doi.org\/10.1016\/j.swevo.2019.100572","journal-title":"Swarm and Evolutionary Computation"},{"issue":"5","key":"2227_CR10","doi-asserted-by":"publisher","first-page":"2531","DOI":"10.1007\/s11831-021-09694-4","volume":"29","author":"AG Gad","year":"2022","unstructured":"Gad, A. G. (2022). Particle swarm optimization algorithm and its applications: A systematic review. Archives of Computational Methods in Engineering, 29(5), 2531\u20132561. https:\/\/doi.org\/10.1007\/s11831-021-09694-4","journal-title":"Archives of Computational Methods in Engineering"},{"key":"2227_CR11","doi-asserted-by":"publisher","unstructured":"Gao, J., & Chen, R. (2011). An NEH-based heuristic algorithm for distributed permutation flowshop scheduling problems. Scientific Research and Essays, 6(14), 3094\u20133100. https:\/\/doi.org\/10.5897\/SRE10.1014","DOI":"10.5897\/SRE10.1014"},{"issue":"3","key":"2227_CR12","doi-asserted-by":"publisher","first-page":"641","DOI":"10.1080\/00207543.2011.644819","volume":"51","author":"J Gao","year":"2013","unstructured":"Gao, J., Chen, R., & Deng, W. (2013). An efficient tabu search algorithm for the distributed permutation flowshop scheduling problem. International Journal of Production Research, 51(3), 641\u2013651. https:\/\/doi.org\/10.1080\/00207543.2011.644819","journal-title":"International Journal of Production Research"},{"key":"2227_CR13","unstructured":"Gen, M., Cheng, R., & Lin, L. (2008). Network models and optimization: Multiobjective genetic algorithm approach. Springer Science & Business Media."},{"issue":"3","key":"2227_CR14","doi-asserted-by":"publisher","first-page":"198","DOI":"10.23919\/CSMS.2021.0018","volume":"1","author":"X Han","year":"2021","unstructured":"Han, X., Han, Y., Chen, Q., Li, J., Sang, H., Liu, Y., Pan, Q., & Nojima, Y. (2021). Distributed flow shop scheduling with sequence-dependent setup times using an improved iterated greedy algorithm. Complex System Modeling and Simulation, 1(3), 198\u2013217. https:\/\/doi.org\/10.23919\/CSMS.2021.0018","journal-title":"Complex System Modeling and Simulation"},{"issue":"8","key":"2227_CR15","doi-asserted-by":"publisher","first-page":"2333","DOI":"10.1007\/s00521-015-2070-1","volume":"27","author":"Y-Z Hsieh","year":"2016","unstructured":"Hsieh, Y.-Z., & Su, M.-C. (2016). A Q-learning-based swarm optimization algorithm for economic dispatch problem. Neural Computing and Applications, 27(8), 2333\u20132350. https:\/\/doi.org\/10.1007\/s00521-015-2070-1","journal-title":"Neural Computing and Applications"},{"issue":"03","key":"2227_CR16","doi-asserted-by":"publisher","first-page":"1650024","DOI":"10.1142\/S1793962316500240","volume":"7","author":"S Huang","year":"2016","unstructured":"Huang, S., Tian, N., & Ji, Z. (2016). Particle swarm optimization with variable neighborhood search for multiobjective flexible job shop scheduling problem. International Journal of Modeling, Simulation, and Scientific Computing, 7(03), 1650024. https:\/\/doi.org\/10.1142\/S1793962316500240","journal-title":"International Journal of Modeling, Simulation, and Scientific Computing"},{"issue":"4","key":"2227_CR17","doi-asserted-by":"publisher","first-page":"54","DOI":"10.5815\/ijisa.2015.04.08","volume":"7","author":"S Kamble","year":"2015","unstructured":"Kamble, S., Mane, S., & Umbarkar, A. (2015). Hybrid multi-objective particle swarm optimization for flexible job shop scheduling problem. International Journal of Intelligent Systems and Applications, 7(4), 54. https:\/\/doi.org\/10.5815\/ijisa.2015.04.08","journal-title":"International Journal of Intelligent Systems and Applications"},{"issue":"8","key":"2227_CR18","doi-asserted-by":"publisher","first-page":"5318","DOI":"10.1109\/TII.2021.3128405","volume":"18","author":"J-Q Li","year":"2021","unstructured":"Li, J.-Q., Chen, X.-L., Duan, P.-Y., & Mou, J.-H. (2021). KMOEA: A knowledge-based multiobjective algorithm for distributed hybrid flow shop in a prefabricated system. IEEE Transactions on Industrial Informatics, 18(8), 5318\u20135329. https:\/\/doi.org\/10.1109\/TII.2021.3128405","journal-title":"IEEE Transactions on Industrial Informatics"},{"issue":"6","key":"2227_CR19","doi-asserted-by":"publisher","first-page":"2425","DOI":"10.1109\/TCYB.2019.2943606","volume":"50","author":"J-Q Li","year":"2019","unstructured":"Li, J.-Q., Song, M.-X., Wang, L., Duan, P.-Y., Han, Y.-Y., Sang, H.-Y., & Pan, Q.-K. (2019). Hybrid artificial bee colony algorithm for a parallel batching distributed flow-shop problem with deteriorating jobs. IEEE Transactions on Cybernetics, 50(6), 2425\u20132439. https:\/\/doi.org\/10.1109\/TCYB.2019.2943606","journal-title":"IEEE Transactions on Cybernetics"},{"issue":"3","key":"2227_CR20","doi-asserted-by":"publisher","first-page":"1173","DOI":"10.1007\/s40747-020-00205-9","volume":"7","author":"Y Li","year":"2021","unstructured":"Li, Y., Wang, C., Gao, L., Song, Y., & Li, X. (2021). An improved simulated annealing algorithm based on residual network for permutation flow shop scheduling. Complex & Intelligent Systems, 7(3), 1173\u20131183. https:\/\/doi.org\/10.1007\/s40747-020-00205-9","journal-title":"Complex & Intelligent Systems"},{"key":"2227_CR21","doi-asserted-by":"publisher","first-page":"702","DOI":"10.1016\/j.asoc.2017.11.012","volume":"62","author":"Q Lin","year":"2018","unstructured":"Lin, Q., Zhu, M., Li, G., Wang, W., Cui, L., Chen, J., & Lu, J. (2018). A novel artificial bee colony algorithm with local and global information interaction. Applied Soft Computing, 62, 702\u2013735. https:\/\/doi.org\/10.1016\/j.asoc.2017.11.012","journal-title":"Applied Soft Computing"},{"issue":"4","key":"2227_CR22","doi-asserted-by":"publisher","first-page":"4348","DOI":"10.1016\/j.eswa.2010.09.104","volume":"38","author":"H Liu","year":"2011","unstructured":"Liu, H., Gao, L., & Pan, Q. (2011). A hybrid particle swarm optimization with estimation of distribution algorithm for solving permutation flowshop scheduling problem. Expert Systems with Applications, 38(4), 4348\u20134360. https:\/\/doi.org\/10.1016\/j.eswa.2010.09.104","journal-title":"Expert Systems with Applications"},{"key":"2227_CR23","doi-asserted-by":"publisher","DOI":"10.1016\/j.jclepro.2019.119071","volume":"246","author":"Z Liu","year":"2020","unstructured":"Liu, Z., Yan, J., Cheng, Q., Yang, C., Sun, S., & Xue, D. (2020). The mixed production mode considering continuous and intermittent processing for an energy-efficient hybrid flow shop scheduling. Journal of Cleaner Production, 246, 119071. https:\/\/doi.org\/10.1016\/j.jclepro.2019.119071","journal-title":"Journal of Cleaner Production"},{"issue":"4","key":"2227_CR24","doi-asserted-by":"publisher","DOI":"10.1002\/cpe.6658","volume":"34","author":"X Long","year":"2022","unstructured":"Long, X., Zhang, J., Qi, X., Xu, W., Jin, T., & Zhou, K. (2022). A self-learning artificial bee colony algorithm based on reinforcement learning for a flexible job-shop scheduling problem. Concurrency and Computation: Practice and Experience, 34(4), e6658. https:\/\/doi.org\/10.1002\/cpe.6658","journal-title":"Concurrency and Computation: Practice and Experience"},{"issue":"10","key":"2227_CR25","doi-asserted-by":"publisher","first-page":"6687","DOI":"10.1109\/TII.2020.3043734","volume":"17","author":"C Lu","year":"2020","unstructured":"Lu, C., Gao, L., Yi, J., & Li, X. (2020). Energy-efficient scheduling of distributed flow shop with heterogeneous factories: A real-world case from automobile industry in china. IEEE Transactions on Industrial Informatics, 17(10), 6687\u20136696. https:\/\/doi.org\/10.1109\/TII.2020.3043734","journal-title":"IEEE Transactions on Industrial Informatics"},{"issue":"4","key":"2227_CR26","doi-asserted-by":"publisher","first-page":"1119","DOI":"10.1080\/00207543.2018.1501166","volume":"57","author":"L Meng","year":"2019","unstructured":"Meng, L., Zhang, C., Shao, X., Ren, Y., & Ren, C. (2019). Mathematical modelling and optimisation of energy-conscious hybrid flow shop scheduling problem with unrelated parallel machines. International Journal of Production Research, 57(4), 1119\u20131145. https:\/\/doi.org\/10.1080\/00207543.2018.1501166","journal-title":"International Journal of Production Research"},{"issue":"11","key":"2227_CR27","doi-asserted-by":"publisher","first-page":"1097","DOI":"10.1016\/S0305-0548(97)00031-2","volume":"24","author":"N Mladenovi\u0107","year":"1997","unstructured":"Mladenovi\u0107, N., & Hansen, P. (1997). Variable neighborhood search. Computers & Operations Research, 24(11), 1097\u20131100. https:\/\/doi.org\/10.1016\/S0305-0548(97)00031-2","journal-title":"Computers & Operations Research"},{"issue":"4","key":"2227_CR28","doi-asserted-by":"publisher","first-page":"754","DOI":"10.1016\/j.cor.2009.06.019","volume":"37","author":"B Naderi","year":"2010","unstructured":"Naderi, B., & Ruiz, R. (2010). The distributed permutation flowshop scheduling problem. Computers & Operations Research, 37(4), 754\u2013768. https:\/\/doi.org\/10.1016\/j.cor.2009.06.019","journal-title":"Computers & Operations Research"},{"issue":"6","key":"2227_CR29","doi-asserted-by":"publisher","first-page":"3818","DOI":"10.1109\/TCYB.2022.3164165","volume":"53","author":"Y Pan","year":"2023","unstructured":"Pan, Y., Gao, K., Li, Z., & Wu, N. (2023). Solving biobjective distributed flow-shop scheduling problems with lot-streaming using an improved jaya algorithm. IEEE Transactions on Cybernetics, 53(6), 3818\u20133828. https:\/\/doi.org\/10.1109\/TCYB.2022.3164165","journal-title":"IEEE Transactions on Cybernetics"},{"key":"2227_CR30","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1016\/j.ins.2019.08.017","volume":"507","author":"J Pei","year":"2020","unstructured":"Pei, J., Mladenovi\u0107, N., Uro\u0161evi\u0107, D., Brimberg, J., & Liu, X. (2020). Solving the traveling repairman problem with profits: A novel variable neighborhood search approach. Information Sciences, 507, 108\u2013123. https:\/\/doi.org\/10.1016\/j.ins.2019.08.017","journal-title":"Information Sciences"},{"key":"2227_CR31","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1016\/j.ins.2022.06.056","volume":"608","author":"R Qi","year":"2022","unstructured":"Qi, R., Li, J.-Q., Wang, J., Jin, H., & Han, Y.-Y. (2022). QMOEA: A Q-learning-based multiobjective evolutionary algorithm for solving time-dependent green vehicle routing problems with time windows. Information Sciences, 608, 178\u2013201. https:\/\/doi.org\/10.1016\/j.ins.2022.06.056","journal-title":"Information Sciences"},{"key":"2227_CR32","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1016\/j.omega.2018.03.004","volume":"83","author":"R Ruiz","year":"2019","unstructured":"Ruiz, R., Pan, Q.-K., & Naderi, B. (2019). Iterated greedy methods for the distributed permutation flowshop scheduling problem. Omega, 83, 213\u2013222. https:\/\/doi.org\/10.1016\/j.omega.2018.03.004","journal-title":"Omega"},{"key":"2227_CR33","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2022.109138","volume":"125","author":"W Shao","year":"2022","unstructured":"Shao, W., Shao, Z., & Pi, D. (2022). Multi-local search-based general variable neighborhood search for distributed flow shop scheduling in heterogeneous multi-factories. Applied Soft Computing, 125, 109138. https:\/\/doi.org\/10.1016\/j.asoc.2022.109138","journal-title":"Applied Soft Computing"},{"key":"2227_CR34","doi-asserted-by":"crossref","unstructured":"Song, L., Liu, C., & Shi, H. (2022). Discrete particle swarm algorithm with Q-learning for solving flexible job shop scheduling problem with parallel batch processing machine. In: Journal of Physics: Conference Series, volume 2303, page 012022. IOP Publishing.","DOI":"10.1088\/1742-6596\/2303\/1\/012022"},{"key":"2227_CR35","doi-asserted-by":"crossref","unstructured":"Taillard, E. (1993). Benchmarks for basic scheduling problems. European Journal of Operational Research, 64(2), 278\u2013285. https:\/\/doi.org\/10.1016\/0377-2217(93) 90182-M","DOI":"10.1016\/0377-2217(93)90182-M"},{"issue":"18","key":"2227_CR36","doi-asserted-by":"publisher","first-page":"5235","DOI":"10.1080\/00207540903121065","volume":"48","author":"A Toptal","year":"2010","unstructured":"Toptal, A., & Sabuncuoglu, I. (2010). Distributed scheduling: A review of concepts and applications. International Journal of Production Research, 48(18), 5235\u20135262. https:\/\/doi.org\/10.1080\/00207540903121065","journal-title":"International Journal of Production Research"},{"key":"2227_CR37","doi-asserted-by":"publisher","DOI":"10.1016\/j.jclepro.2021.126093","volume":"293","author":"J Wang","year":"2021","unstructured":"Wang, J., Liu, Y., Ren, S., Wang, C., & Wang, W. (2021). Evolutionary game based real-time scheduling for energy-efficient distributed and flexible job shop. Journal of Cleaner Production, 293, 126093. https:\/\/doi.org\/10.1016\/j.jclepro.2021.126093","journal-title":"Journal of Cleaner Production"},{"key":"2227_CR38","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2021.114793","volume":"174","author":"Y Wang","year":"2021","unstructured":"Wang, Y., Wang, S., Li, D., Shen, C., & Yang, B. (2021). An improved multi-objective whale optimization algorithm for the hybrid flow shop scheduling problem considering device dynamic reconfiguration processes. Expert Systems with Applications, 174, 114793. https:\/\/doi.org\/10.1016\/j.eswa.2021.114793","journal-title":"Expert Systems with Applications"},{"key":"2227_CR39","doi-asserted-by":"publisher","DOI":"10.1016\/j.jclepro.2021.126121","volume":"293","author":"X Xin","year":"2021","unstructured":"Xin, X., Jiang, Q., Li, S., Gong, S., & Chen, K. (2021). Energy-efficient scheduling for a permutation flow shop with variable transportation time using an improved discrete whale swarm optimization. Journal of Cleaner Production, 293, 126121. https:\/\/doi.org\/10.1016\/j.jclepro.2021.126121","journal-title":"Journal of Cleaner Production"},{"issue":"13","key":"2227_CR40","doi-asserted-by":"publisher","first-page":"4053","DOI":"10.1080\/00207543.2020.1757174","volume":"59","author":"S Yang","year":"2021","unstructured":"Yang, S., & Xu, Z. (2021). The distributed assembly permutation flowshop scheduling problem with flexible assembly and batch delivery. International Journal of Production Research, 59(13), 4053\u20134071. https:\/\/doi.org\/10.1080\/00207543.2020.1757174","journal-title":"International Journal of Production Research"},{"key":"2227_CR41","doi-asserted-by":"crossref","unstructured":"Yu, X. & Gen, M. (2010). Introduction to evolutionary algorithms. Springer Science & Business Media.","DOI":"10.1007\/978-1-84996-129-5"},{"issue":"6","key":"2227_CR42","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. https:\/\/doi.org\/10.1109\/TEVC.2007.892759","journal-title":"IEEE Transactions on Evolutionary Computation"},{"issue":"5","key":"2227_CR43","doi-asserted-by":"publisher","first-page":"881","DOI":"10.1007\/s10845-013-0814-2","volume":"25","author":"W Zhang","year":"2014","unstructured":"Zhang, W., Gen, M., & Jo, J. (2014). Hybrid sampling strategy-based multiobjective evolutionary algorithm for process planning and scheduling problem. Journal of Intelligent Manufacturing, 25(5), 881\u2013897. https:\/\/doi.org\/10.1007\/s10845-013-0814-2","journal-title":"Journal of Intelligent Manufacturing"},{"issue":"3","key":"2227_CR44","doi-asserted-by":"publisher","first-page":"176","DOI":"10.23919\/CSMS.2021.0017","volume":"1","author":"W Zhang","year":"2021","unstructured":"Zhang, W., Hou, W., Li, C., Yang, W., & Gen, M. (2021). Multidirection update-based multiobjective particle swarm optimization for mixed no-idle flow-shop scheduling problem. Complex System Modeling and Simulation , 1(3), 176\u2013197. https:\/\/doi.org\/10.23919\/CSMS.2021.0017","journal-title":"Complex System Modeling and Simulation"},{"issue":"9","key":"2227_CR45","doi-asserted-by":"publisher","first-page":"8833","DOI":"10.3934\/mbe.2022410","volume":"19","author":"W Zhang","year":"2022","unstructured":"Zhang, W., Li, C., Gen, M., Yang, W., Zhang, Z., & Zhang, G. (2022). Multiobjective particle swarm optimization with direction search and differential evolution for distributed flow-shop scheduling problem. Mathematical Biosciences and Engineering, 19(9), 8833\u20138865. https:\/\/doi.org\/10.3934\/mbe.2022410","journal-title":"Mathematical Biosciences and Engineering"},{"key":"2227_CR46","doi-asserted-by":"publisher","first-page":"661","DOI":"10.1016\/j.cie.2019.03.019","volume":"130","author":"W Zhang","year":"2019","unstructured":"Zhang, W., Wang, Y., Yang, Y., & Gen, M. (2019). Hybrid multiobjective evolutionary algorithm based on differential evolution for flow shop scheduling problems. Computers & Industrial Engineering, 130, 661\u2013670. https:\/\/doi.org\/10.1016\/j.cie.2019.03.019","journal-title":"Computers & Industrial Engineering"},{"key":"2227_CR47","doi-asserted-by":"crossref","unstructured":"Zhao, F., Hu, X., Wang, L., & Li, Z. (2022). A memetic discrete differential evolution algorithm for the distributed permutation flow shop scheduling problem. Complex & Intelligent Systems, 8(1), 141\u2013161. https:\/\/doi.org\/10.1007\/s40747-021 -00354-5","DOI":"10.1007\/s40747-021-00354-5"},{"issue":"5","key":"2227_CR48","doi-asserted-by":"publisher","first-page":"6692","DOI":"10.1109\/TII.2022.3192881","volume":"19","author":"F Zhao","year":"2023","unstructured":"Zhao, F., Xu, Z., Wang, L., Zhu, N., Xu, T., & Jonrinaldi, J. (2023). A population-based iterated greedy algorithm for distributed assembly no-wait flow-shop scheduling problem. IEEE Transactions on Industrial Informatics, 19(5), 6692\u20136705. https:\/\/doi.org\/10.1109\/TII.2022.3192881","journal-title":"IEEE Transactions on Industrial Informatics"},{"key":"2227_CR49","doi-asserted-by":"publisher","first-page":"85029","DOI":"10.1109\/ACCESS.2019.2924998","volume":"7","author":"R Zhou","year":"2019","unstructured":"Zhou, R., Lei, D., & Zhou, X. (2019). Multi-objective energy-efficient interval scheduling in hybrid flow shop using imperialist competitive algorithm. IEEE Access, 7, 85029\u201385041. https:\/\/doi.org\/10.1109\/ACCESS.2019.2924998","journal-title":"IEEE Access"},{"key":"2227_CR50","doi-asserted-by":"publisher","unstructured":"Zitzler, E., Laumanns, M., & Thiele, L. (2001). SPEA2: Improving the strength Pareto evolutionary algorithm. TIK-Report, 103. https:\/\/doi.org\/10.3929\/ethz-a-004284029","DOI":"10.3929\/ethz-a-004284029"}],"container-title":["Journal of Intelligent Manufacturing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10845-023-02227-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10845-023-02227-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10845-023-02227-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,4]],"date-time":"2025-01-04T23:12:24Z","timestamp":1736032344000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10845-023-02227-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,10,25]]},"references-count":50,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2025,1]]}},"alternative-id":["2227"],"URL":"https:\/\/doi.org\/10.1007\/s10845-023-02227-9","relation":{},"ISSN":["0956-5515","1572-8145"],"issn-type":[{"value":"0956-5515","type":"print"},{"value":"1572-8145","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,10,25]]},"assertion":[{"value":"4 July 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 September 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 October 2023","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have no relevant financial or non-financial interests to disclose.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}