{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,14]],"date-time":"2026-07-14T17:15:43Z","timestamp":1784049343263,"version":"3.55.0"},"reference-count":59,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2025,6,1]],"date-time":"2025-06-01T00:00:00Z","timestamp":1748736000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,6,1]],"date-time":"2025-06-01T00:00:00Z","timestamp":1748736000000},"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":["62273221"],"award-info":[{"award-number":["62273221"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62273221"],"award-info":[{"award-number":["62273221"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Memetic Comp."],"published-print":{"date-parts":[[2025,6]]},"DOI":"10.1007\/s12293-025-00456-4","type":"journal-article","created":{"date-parts":[[2025,6,9]],"date-time":"2025-06-09T12:47:24Z","timestamp":1749473244000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["A multi-objective two-phase cascaded memetic algorithm for multi-shop integrated scheduling problem with AGV transportation"],"prefix":"10.1007","volume":"17","author":[{"given":"Chuang","family":"Wang","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Quan-Ke","family":"Pan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2025,6,9]]},"reference":[{"key":"456_CR1","doi-asserted-by":"publisher","first-page":"4341","DOI":"10.1080\/00207543.2022.2123057","volume":"61","author":"L Gui","year":"2023","unstructured":"Gui L, Fu L, Li X et al (2023) Optimisation framework and method for solving the serial dual-shop collaborative scheduling problem. Int J Prod Res 61:4341\u20134357. https:\/\/doi.org\/10.1080\/00207543.2022.2123057","journal-title":"Int J Prod Res"},{"key":"456_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1080\/00207543.2023.2255681","volume":"62","author":"B Han","year":"2023","unstructured":"Han B, Pan Q, Gao L (2023) A cooperative iterated greedy algorithm for the serial distributed permutation flowshop scheduling problem. Int J Prod Res 62:1\u201328. https:\/\/doi.org\/10.1080\/00207543.2023.2255681","journal-title":"Int J Prod Res"},{"key":"456_CR3","doi-asserted-by":"publisher","first-page":"1752","DOI":"10.1109\/TCYB.2021.3120875","volume":"53","author":"J Fan","year":"2023","unstructured":"Fan J, Li Y, Xie J et al (2023) A Hybrid Evolutionary Algorithm Using Two Solution Representations for Hybrid Flow-Shop Scheduling Problem. IEEE Trans Cybern 53:1752\u20131764. https:\/\/doi.org\/10.1109\/TCYB.2021.3120875","journal-title":"IEEE Trans Cybern"},{"key":"456_CR4","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2023.121856","volume":"238","author":"C Wang","year":"2023","unstructured":"Wang C, Pan Q, Jing X (2023) An effective adaptive iterated greedy algorithm for a cascaded flowshop joint scheduling problem. Expert Syst Appl 238:121856. https:\/\/doi.org\/10.1016\/j.eswa.2023.121856","journal-title":"Expert Syst Appl"},{"key":"456_CR5","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2024.101489","volume":"86","author":"C Wang","year":"2024","unstructured":"Wang C, Pan Q, Sang H, Jing X (2024) A cascaded flowshop joint scheduling problem with makespan minimization: a mathematical model and shifting iterated greedy algorithm. Swarm Evol Comput 86:101489. https:\/\/doi.org\/10.1016\/j.swevo.2024.101489","journal-title":"Swarm Evol Comput"},{"key":"456_CR6","doi-asserted-by":"publisher","DOI":"10.1016\/j.rcim.2024.102747","volume":"88","author":"C Wang","year":"2024","unstructured":"Wang C, Pan Q, Sang H (2024) The cascaded flowshop joint scheduling problem: a mathematical model and population-based iterated greedy algorithm to minimize total tardiness. Rob Comput Integr Manuf 88:102747. https:\/\/doi.org\/10.1016\/j.rcim.2024.102747","journal-title":"Rob Comput Integr Manuf"},{"key":"456_CR7","doi-asserted-by":"publisher","first-page":"526","DOI":"10.1016\/j.asoc.2018.07.011","volume":"71","author":"M Zangari","year":"2018","unstructured":"Zangari M, Constantino AA, Ceberio J (2018) A decomposition-based kernel of Mallows models algorithm for bi- and tri-objective permutation flowshop scheduling problem. Appl Soft Comput 71:526\u2013537. https:\/\/doi.org\/10.1016\/j.asoc.2018.07.011","journal-title":"Appl Soft Comput"},{"key":"456_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ejor.2022.08.009","volume":"309","author":"JS Neufeld","year":"2023","unstructured":"Neufeld JS, Schulz S, Buscher U (2023) A systematic review of multi-objective hybrid flow shop scheduling. Eur J Oper Res 309:1\u201323. https:\/\/doi.org\/10.1016\/j.ejor.2022.08.009","journal-title":"Eur J Oper Res"},{"key":"456_CR9","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2020.104965","volume":"121","author":"K Maassen","year":"2020","unstructured":"Maassen K, PerezGonzalez P, G\u00fcnther LC (2020) Relationship between common objective functions, idle time and waiting time in permutation flow shop scheduling. Comput Oper Res 121:104965. https:\/\/doi.org\/10.1016\/j.cor.2020.104965","journal-title":"Comput Oper Res"},{"key":"456_CR10","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2020.100803","volume":"60","author":"C Lu","year":"2021","unstructured":"Lu C, Gao L, Gong W et al (2021) Sustainable scheduling of distributed permutation flow-shop with non-identical factory using a knowledge-based multi-objective memetic optimization algorithm. Swarm Evol Comput 60:100803. https:\/\/doi.org\/10.1016\/j.swevo.2020.100803","journal-title":"Swarm Evol Comput"},{"key":"456_CR11","doi-asserted-by":"publisher","first-page":"6361","DOI":"10.1007\/s00521-022-08012-8","volume":"35","author":"S Chen","year":"2023","unstructured":"Chen S, Pan Q, Gao L et al (2023) Energy-efficient distributed heterogeneous blocking flowshop scheduling problem using a knowledge-based iterated Pareto greedy algorithm. Neural Comput Appl 35:6361\u20136381. https:\/\/doi.org\/10.1007\/s00521-022-08012-8","journal-title":"Neural Comput Appl"},{"key":"456_CR12","doi-asserted-by":"publisher","first-page":"1344","DOI":"10.1109\/TASE.2018.2886303","volume":"16","author":"W Shao","year":"2019","unstructured":"Shao W, Pi D, Shao Z (2019) A pareto-based estimation of distribution algorithm for solving multiobjective distributed no-wait flow-shop scheduling problem with sequence-dependent setup time. IEEE Trans Autom Sci Eng 16:1344\u20131360. https:\/\/doi.org\/10.1109\/TASE.2018.2886303","journal-title":"IEEE Trans Autom Sci Eng"},{"key":"456_CR13","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2023.110252","volume":"263","author":"D Lei","year":"2023","unstructured":"Lei D, Su B (2023) A multi-class teaching\u2013learning-based optimization for multi-objective distributed hybrid flow shop scheduling. Knowl-Based Syst 263:110252. https:\/\/doi.org\/10.1016\/j.knosys.2023.110252","journal-title":"Knowl-Based Syst"},{"key":"456_CR14","doi-asserted-by":"publisher","first-page":"57757","DOI":"10.1109\/ACCESS.2021.3070634","volume":"9","author":"S Verma","year":"2021","unstructured":"Verma S, Pant M, Snasel V (2021) A comprehensive review on NSGA-II for multi-objective combinatorial optimization problems. IEEE Access 9:57757\u201357791. https:\/\/doi.org\/10.1109\/ACCESS.2021.3070634","journal-title":"IEEE Access"},{"key":"456_CR15","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2020.106177","volume":"204","author":"E Jiang","year":"2020","unstructured":"Jiang E, Wang L (2020) Multi-objective optimization based on decomposition for flexible job shop scheduling under time-of-use electricity prices. Knowl-Based Syst 204:106177. https:\/\/doi.org\/10.1016\/j.knosys.2020.106177","journal-title":"Knowl-Based Syst"},{"key":"456_CR16","doi-asserted-by":"publisher","first-page":"4226","DOI":"10.1080\/00207543.2023.2254858","volume":"62","author":"F Zhao","year":"2023","unstructured":"Zhao F, Zhang H, Wang L et al (2023) A multi-objective discrete differential evolution algorithm for energy-efficient distributed blocking flow shop scheduling problem. Int J Prod Res 62:4226\u20134244. https:\/\/doi.org\/10.1080\/00207543.2023.2254858","journal-title":"Int J Prod Res"},{"key":"456_CR17","doi-asserted-by":"publisher","DOI":"10.1016\/j.aei.2024.102401","volume":"60","author":"S Wang","year":"2024","unstructured":"Wang S, Li X, Gao L, Li J (2024) A multi-disjunctive-graph model-based memetic algorithm for the distributed job shop scheduling problem. Adv Eng Inf 60:102401. https:\/\/doi.org\/10.1016\/j.aei.2024.102401","journal-title":"Adv Eng Inf"},{"key":"456_CR18","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1016\/j.swevo.2016.06.002","volume":"32","author":"J Deng","year":"2017","unstructured":"Deng J, Wang L (2017) A competitive memetic algorithm for multi-objective distributed permutation flow shop scheduling problem. Swarm Evol Comput 32:121\u2013131. https:\/\/doi.org\/10.1016\/j.swevo.2016.06.002","journal-title":"Swarm Evol Comput"},{"key":"456_CR19","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 et al (2022) Multiobjective particle swarm optimization with direction search and differential evolution for distributed flow-shop scheduling problem. Math Biosci Eng 19:8833\u20138865. https:\/\/doi.org\/10.3934\/mbe.2022410","journal-title":"Math Biosci Eng"},{"key":"456_CR20","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2022.101128","volume":"74","author":"Y-Y Huang","year":"2022","unstructured":"Huang Y-Y, Pan Q, Gao L et al (2022) A two-phase evolutionary algorithm for multi-objective distributed assembly permutation flowshop scheduling problem. Swarm Evol Comput 74:101128. https:\/\/doi.org\/10.1016\/j.swevo.2022.101128","journal-title":"Swarm Evol Comput"},{"key":"456_CR21","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1016\/j.asoc.2015.11.034","volume":"40","author":"AP Rifai","year":"2015","unstructured":"Rifai AP, Nguyen H, Dawal SZM (2015) Multi-objective adaptive large neighborhood search for distributed reentrant permutation flow shop scheduling. Appl Soft Comput 40:42\u201357. https:\/\/doi.org\/10.1016\/j.asoc.2015.11.034","journal-title":"Appl Soft Comput"},{"key":"456_CR22","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 Trans Evol Comput 6:182\u2013197. https:\/\/doi.org\/10.1109\/4235.996017","journal-title":"IEEE Trans Evol Comput"},{"key":"456_CR23","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1007\/s40305-017-0165-3","volume":"6","author":"S Cai","year":"2018","unstructured":"Cai S, Yang K, Liu K (2018) Multi-objective optimization of the distributed permutation flow shop scheduling problem with transportation and eligibility constraints. J Oper Res Soc China 6:391\u2013416. https:\/\/doi.org\/10.1007\/s40305-017-0165-3","journal-title":"J Oper Res Soc China"},{"key":"456_CR24","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2021.115339","volume":"183","author":"AP Rifai","year":"2021","unstructured":"Rifai AP, Mara STW, Sudiarso A (2021) Multi-objective distributed reentrant permutation flow shop scheduling with sequence-dependent setup time. Expert Syst Appl 183:115339. https:\/\/doi.org\/10.1016\/j.eswa.2021.115339","journal-title":"Expert Syst Appl"},{"key":"456_CR25","doi-asserted-by":"publisher","first-page":"439","DOI":"10.3233\/JIFS-219202","volume":"42","author":"ME Baysal","year":"2022","unstructured":"Baysal ME, Sarucan A, B\u00fcy\u00fck\u00f6zkan K, Engin O (2022) Artificial bee colony algorithm for solving multi-objective distributed fuzzy permutation flow shop problem. J Intell Fuzzy Syst 42:439\u2013449. https:\/\/doi.org\/10.3233\/JIFS-219202","journal-title":"J Intell Fuzzy Syst"},{"key":"456_CR26","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2023.110880","volume":"278","author":"X Tao","year":"2023","unstructured":"Tao X, Pan Q, Sang H et al (2023) Nondominated sorting genetic algorithm-II with Q-learning for the distributed permutation flowshop rescheduling problem. Knowl-Based Syst 278:110880. https:\/\/doi.org\/10.1016\/j.knosys.2023.110880","journal-title":"Knowl-Based Syst"},{"key":"456_CR27","doi-asserted-by":"publisher","first-page":"1805","DOI":"10.1109\/TSMC.2017.2788879","volume":"50","author":"J-J Wang","year":"2018","unstructured":"Wang J-J, Wang L (2018) A knowledge-based cooperative algorithm for energy-efficient scheduling of distributed flow-shop. IEEE Trans Syst Man Cybernet 50:1805\u20131819","journal-title":"IEEE Trans Syst Man Cybernet"},{"key":"456_CR28","doi-asserted-by":"publisher","DOI":"10.1016\/j.rcim.2021.102277","volume":"74","author":"C Lu","year":"2021","unstructured":"Lu C, Huang Y, Meng L et al (2021) A Pareto-based collaborative multi-objective optimization algorithm for energy-efficient scheduling of distributed permutation flow-shop with limited buffers. Rob Comput Integr Manuf 74:102277. https:\/\/doi.org\/10.1016\/j.rcim.2021.102277","journal-title":"Rob Comput Integr Manuf"},{"key":"456_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 Trans Cybern 53:3818\u20133828. https:\/\/doi.org\/10.1109\/TCYB.2022.3164165","journal-title":"IEEE Trans Cybern"},{"key":"456_CR30","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2020.100716","volume":"57","author":"G Wang","year":"2020","unstructured":"Wang G, Gao L, Li X et al (2020) Energy-efficient distributed permutation flow shop scheduling problem using a multi-objective whale swarm algorithm. Swarm Evol Comput 57:100716","journal-title":"Swarm Evol Comput"},{"key":"456_CR31","doi-asserted-by":"publisher","unstructured":"Chen S, Zheng J, Zhang W (2024) A cooperative grey wolf optimizer for the joint flowshop scheduling problem with sequence-dependent set-up time. Eng Optim 1\u201323. https:\/\/doi.org\/10.1080\/0305215X.2024.2333966","DOI":"10.1080\/0305215X.2024.2333966"},{"key":"456_CR32","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ejor.2023.02.001","volume":"312","author":"P PerezGonzalez","year":"2024","unstructured":"PerezGonzalez P, Framinan JM (2024) A review and classification on distributed permutation flowshop scheduling problems. Eur J Oper Res 312:1\u201321. https:\/\/doi.org\/10.1016\/j.ejor.2023.02.001","journal-title":"Eur J Oper Res"},{"key":"456_CR33","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1109\/TEVC.2013.2240304","volume":"18","author":"MK Marichelvam","year":"2013","unstructured":"Marichelvam MK, Prabaharan T, Yang XS (2013) A discrete firefly algorithm for the multi-objective hybrid flowshop scheduling problems. IEEE Trans Evol Comput 18:301\u2013305. https:\/\/doi.org\/10.1109\/TEVC.2013.2240304","journal-title":"IEEE Trans Evol Comput"},{"key":"456_CR34","doi-asserted-by":"publisher","first-page":"725","DOI":"10.1016\/j.asoc.2016.06.034","volume":"49","author":"N Karimi","year":"2016","unstructured":"Karimi N, Davoudpour H (2016) Multi-objective colonial competitive algorithm for hybrid flowshop problem. Appl Soft Comput 49:725\u2013733. https:\/\/doi.org\/10.1016\/j.asoc.2016.06.034","journal-title":"Appl Soft Comput"},{"key":"456_CR35","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1016\/j.asoc.2017.07.058","volume":"61","author":"D Lei","year":"2017","unstructured":"Lei D, Zheng Y (2017) Hybrid flow shop scheduling with assembly operations and key objectives: A novel neighborhood search. Appl Soft Comput 61:122\u2013128. https:\/\/doi.org\/10.1016\/j.asoc.2017.07.058","journal-title":"Appl Soft Comput"},{"key":"456_CR36","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/s12351-016-0257-6","volume":"18","author":"SM Mousavi","year":"2018","unstructured":"Mousavi SM, Mahdavi I, Rezaeian J, Zandieh M (2018) An efficient bi-objective algorithm to solve re-entrant hybrid flow shop scheduling with learning effect and setup times. Oper Res Int J 18:123\u2013158. https:\/\/doi.org\/10.1007\/s12351-016-0257-6","journal-title":"Oper Res Int J"},{"key":"456_CR37","doi-asserted-by":"publisher","first-page":"728","DOI":"10.1016\/j.asoc.2018.11.043","volume":"75","author":"C Lu","year":"2018","unstructured":"Lu C, Gao L, Pan Q et al (2018) A multi-objective cellular grey wolf optimizer for hybrid flowshop scheduling problem considering noise pollution. Appl Soft Comput 75:728\u2013749. https:\/\/doi.org\/10.1016\/j.asoc.2018.11.043","journal-title":"Appl Soft Comput"},{"key":"456_CR38","doi-asserted-by":"publisher","first-page":"614","DOI":"10.1111\/itor.12662","volume":"27","author":"EC de Siqueira","year":"2020","unstructured":"de Siqueira EC, Souza MJF, de Souza SR (2020) An MO-GVNS algorithm for solving a multiobjective hybrid flow shop scheduling problem. Int Trans Oper Res 27:614\u2013650. https:\/\/doi.org\/10.1111\/itor.12662","journal-title":"Int Trans Oper Res"},{"key":"456_CR39","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2019.104812","volume":"114","author":"MK Marichelvam","year":"2019","unstructured":"Marichelvam MK, Geetha M, Tosun \u00d6 (2019) An improved particle swarm optimization algorithm to solve hybrid flowshop scheduling problems with the effect of human factors\u2014a case study. Comput Oper Res 114:104812. https:\/\/doi.org\/10.1016\/j.cor.2019.104812","journal-title":"Comput Oper Res"},{"key":"456_CR40","doi-asserted-by":"publisher","first-page":"1013","DOI":"10.1080\/00207543.2022.2093680","volume":"61","author":"B Zhang","year":"2022","unstructured":"Zhang B, Pan Q, Meng L et al (2022) A decomposition-based multi-objective evolutionary algorithm for hybrid flowshop rescheduling problem with consistent sublots. Int J Prod Res 61:1013\u20131038. https:\/\/doi.org\/10.1080\/00207543.2022.2093680","journal-title":"Int J Prod Res"},{"key":"456_CR41","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2020.105536","volume":"194","author":"J Zheng","year":"2020","unstructured":"Zheng J, Wang L, Wang J (2020) A cooperative coevolution algorithm for multi-objective fuzzy distributed hybrid flow shop. Knowl-Based Syst 194:105536. https:\/\/doi.org\/10.1016\/j.knosys.2020.105536","journal-title":"Knowl-Based Syst"},{"key":"456_CR42","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2021.115453","volume":"183","author":"W Shao","year":"2021","unstructured":"Shao W, Shao Z, Pi D (2021) Multi-objective evolutionary algorithm based on multiple neighborhoods local search for multi-objective distributed hybrid flow shop scheduling problem. Expert Syst Appl 183:115453. https:\/\/doi.org\/10.1016\/j.eswa.2021.115453","journal-title":"Expert Syst Appl"},{"key":"456_CR43","doi-asserted-by":"publisher","first-page":"5404","DOI":"10.1080\/00207543.2020.1780333","volume":"59","author":"J Cai","year":"2021","unstructured":"Cai J, Lei D, Li M (2021) A shuffled frog-leaping algorithm with memeplex quality for bi-objective distributed scheduling in hybrid flow shop. Int J Prod Res 59:5404\u20135421. https:\/\/doi.org\/10.1080\/00207543.2020.1780333","journal-title":"Int J Prod Res"},{"key":"456_CR44","doi-asserted-by":"publisher","first-page":"3379","DOI":"10.1109\/TASE.2021.3119353","volume":"19","author":"W Shao","year":"2022","unstructured":"Shao W, Shao Z, Pi D (2022) An ant colony optimization behavior-based MOEA\/D for distributed heterogeneous hybrid flow shop scheduling problem under nonidentical time-of-use electricity tariffs. IEEE Trans Autom Sci Eng 19:3379\u20133394. https:\/\/doi.org\/10.1109\/TASE.2021.3119353","journal-title":"IEEE Trans Autom Sci Eng"},{"key":"456_CR45","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2023.109325","volume":"181","author":"Y Geng","year":"2023","unstructured":"Geng Y, Li J (2023) A knowledge-driven multiobjective algorithm for distributed hybrid flowshop with group and carryover setup in glass manufacturing systems. Comput Ind Eng 181:109325. https:\/\/doi.org\/10.1016\/j.cie.2023.109325","journal-title":"Comput Ind Eng"},{"key":"456_CR46","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.swevo.2011.11.003","volume":"2","author":"F Neri","year":"2012","unstructured":"Neri F, Cotta C (2012) Memetic algorithms and memetic computing optimization: A literature review. Swarm Evol Comput 2:1\u201314. https:\/\/doi.org\/10.1016\/j.swevo.2011.11.003","journal-title":"Swarm Evol Comput"},{"key":"456_CR47","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2019.100576","volume":"50","author":"Y Du","year":"2019","unstructured":"Du Y, Xing L, Zhang J et al (2019) MOEA based memetic algorithms for multi-objective satellite range scheduling problem. Swarm Evol Comput 50:100576. https:\/\/doi.org\/10.1016\/j.swevo.2019.100576","journal-title":"Swarm Evol Comput"},{"key":"456_CR48","doi-asserted-by":"publisher","first-page":"3020","DOI":"10.1109\/TNSM.2022.3224158","volume":"20","author":"S Qin","year":"2023","unstructured":"Qin S, Pi D, Shao Z, Xu Y (2023) A discrete interval-based multi-objective memetic algorithm for scheduling workflow with uncertainty in cloud environment. IEEE Trans Netw Serv Manage 20:3020\u20133037. https:\/\/doi.org\/10.1109\/TNSM.2022.3224158","journal-title":"IEEE Trans Netw Serv Manage"},{"key":"456_CR49","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2023.109987","volume":"134","author":"Y Xue","year":"2023","unstructured":"Xue Y, Zhu H, Neri F (2023) A feature selection approach based on NSGA-II with ReliefF. Appl Soft Comput 134:109987. https:\/\/doi.org\/10.1016\/j.asoc.2023.109987","journal-title":"Appl Soft Comput"},{"key":"456_CR50","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1016\/j.swevo.2016.06.002","volume":"32","author":"J Deng","year":"2017","unstructured":"Deng J, Wang L (2017) A competitive memetic algorithm for multi-objective distributed permutation flow shop scheduling problem. Swarm Evol Comput 32:121\u2013131","journal-title":"Swarm Evol Comput"},{"key":"456_CR51","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2022.101190","volume":"75","author":"W Shao","year":"2022","unstructured":"Shao W, Shao Z, Pi D (2022) A network memetic algorithm for energy and labor-aware distributed heterogeneous hybrid flow shop scheduling problem. Swarm Evol Comput 75:101190. https:\/\/doi.org\/10.1016\/j.swevo.2022.101190","journal-title":"Swarm Evol Comput"},{"key":"456_CR52","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2023.121570","volume":"237","author":"W Zhang","year":"2024","unstructured":"Zhang W, Li C, Gen M et al (2024) A multiobjective memetic algorithm with particle swarm optimization and Q-learning-based local search for energy-efficient distributed heterogeneous hybrid flow-shop scheduling problem. Expert Syst Appl 237:121570. https:\/\/doi.org\/10.1016\/j.eswa.2023.121570","journal-title":"Expert Syst Appl"},{"key":"456_CR53","doi-asserted-by":"publisher","first-page":"22303","DOI":"10.1007\/s00521-022-07714-3","volume":"34","author":"W Shao","year":"2022","unstructured":"Shao W, Shao Z, Pi D (2022) A multi-neighborhood-based multi-objective memetic algorithm for the energy-efficient distributed flexible flow shop scheduling problem. Neural Comput Appl 34:22303\u201322330. https:\/\/doi.org\/10.1007\/s00521-022-07714-3","journal-title":"Neural Comput Appl"},{"key":"456_CR54","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1016\/j.cor.2016.10.003","volume":"79","author":"X Wang","year":"2016","unstructured":"Wang X, Tang L (2016) A machine-learning based memetic algorithm for the multi-objective permutation flowshop scheduling problem. Comput Oper Res 79:60\u201377. https:\/\/doi.org\/10.1016\/j.cor.2016.10.003","journal-title":"Comput Oper Res"},{"key":"456_CR55","doi-asserted-by":"publisher","first-page":"2498","DOI":"10.1016\/j.cor.2008.10.008","volume":"36","author":"Q Pan","year":"2008","unstructured":"Pan Q, Wang L, Qian B (2008) A novel differential evolution algorithm for bi-criteria no-wait flow shop scheduling problems. Comput Oper Res 36:2498\u20132511. https:\/\/doi.org\/10.1016\/j.cor.2008.10.008","journal-title":"Comput Oper Res"},{"key":"456_CR56","doi-asserted-by":"publisher","first-page":"497","DOI":"10.1080\/18756891.2011.9727808","volume":"4","author":"J Gao","year":"2011","unstructured":"Gao J, Chen R (2011) A hybrid genetic algorithm for the distributed permutation flowshop scheduling problem. Int J Comput Int Sys 4:497\u2013508. https:\/\/doi.org\/10.1080\/18756891.2011.9727808","journal-title":"Int J Comput Int Sys"},{"key":"456_CR57","doi-asserted-by":"publisher","first-page":"577","DOI":"10.1109\/TEVC.2013.2281535","volume":"18","author":"K Deb","year":"2014","unstructured":"Deb K, Jain H (2014) An Evolutionary Many-Objective Optimization Algorithm Using Reference-Point-Based Nondominated Sorting Approach, Part I: Solving Problems With Box Constraints. IEEE Trans Evol Comput 18:577\u2013601. https:\/\/doi.org\/10.1109\/TEVC.2013.2281535","journal-title":"IEEE Trans Evol Comput"},{"key":"456_CR58","doi-asserted-by":"publisher","first-page":"440","DOI":"10.1109\/TEVC.2016.2608507","volume":"21","author":"A Trivedi","year":"2017","unstructured":"Trivedi A, Srinivasan D, Sanyal K, Ghosh A (2017) A Survey of Multiobjective Evolutionary Algorithms Based on Decomposition. IEEE Trans Evol Comput 21:440\u2013462. https:\/\/doi.org\/10.1109\/TEVC.2016.2608507","journal-title":"IEEE Trans Evol Comput"},{"key":"456_CR59","doi-asserted-by":"publisher","first-page":"336","DOI":"10.1109\/TASE.2013.2274517","volume":"12","author":"Y Yuan","year":"2015","unstructured":"Yuan Y, Xu H (2015) Multiobjective Flexible Job Shop Scheduling Using Memetic Algorithms. IEEE Trans Autom Sci Eng 12:336\u2013353. https:\/\/doi.org\/10.1109\/TASE.2013.2274517","journal-title":"IEEE Trans Autom Sci Eng"}],"container-title":["Memetic Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12293-025-00456-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12293-025-00456-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12293-025-00456-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,26]],"date-time":"2025-06-26T09:30:58Z","timestamp":1750930258000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12293-025-00456-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,6]]},"references-count":59,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2025,6]]}},"alternative-id":["456"],"URL":"https:\/\/doi.org\/10.1007\/s12293-025-00456-4","relation":{},"ISSN":["1865-9284","1865-9292"],"issn-type":[{"value":"1865-9284","type":"print"},{"value":"1865-9292","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,6]]},"assertion":[{"value":"15 August 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 April 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 June 2025","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 declare that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"29"}}