{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,30]],"date-time":"2026-03-30T12:05:22Z","timestamp":1774872322061,"version":"3.50.1"},"reference-count":50,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2025,12,2]],"date-time":"2025-12-02T00:00:00Z","timestamp":1764633600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,12,2]],"date-time":"2025-12-02T00:00:00Z","timestamp":1764633600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"name":"Open Research Fund of the State Key Lab of Digital Manufacturing Equipment and Technology, China","award":["IMETKF2024020"],"award-info":[{"award-number":["IMETKF2024020"]}]},{"name":"Open Research Fund of the State Key Lab of Digital Manufacturing Equipment and Technology, China","award":["IMETKF2024020"],"award-info":[{"award-number":["IMETKF2024020"]}]},{"name":"Open Research Fund of the State Key Lab of Digital Manufacturing Equipment and Technology, China","award":["IMETKF2024020"],"award-info":[{"award-number":["IMETKF2024020"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Memetic Comp."],"published-print":{"date-parts":[[2026,3]]},"DOI":"10.1007\/s12293-025-00488-w","type":"journal-article","created":{"date-parts":[[2025,12,2]],"date-time":"2025-12-02T05:35:45Z","timestamp":1764653745000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A knowledge-driven memetic algorithm for energy-aware flexible job shop scheduling with limited AGV transportation"],"prefix":"10.1007","volume":"18","author":[{"given":"Yajie","family":"Huo","sequence":"first","affiliation":[]},{"given":"Fayong","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Wenyin","family":"Gong","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,12,2]]},"reference":[{"issue":"3","key":"488_CR1","doi-asserted-by":"publisher","first-page":"890","DOI":"10.1016\/j.ejor.2023.07.036","volume":"312","author":"L Berterotti\u00e8re","year":"2024","unstructured":"Berterotti\u00e8re L, Dauz\u00e8re-P\u00e9r\u00e8s S, Yugma C (2024) Flexible job-shop scheduling with transportation resources. Eur J Oper Res 312(3):890\u2013909","journal-title":"Eur J Oper Res"},{"issue":"3","key":"488_CR2","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. Ann Oper Res 41(3):157\u2013183","journal-title":"Ann Oper Res"},{"issue":"1","key":"488_CR3","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1080\/00207543.2024.2357740","volume":"63","author":"X Chang","year":"2025","unstructured":"Chang X, Jia X, Ren J (2025) A reinforcement learning enhanced memetic algorithm for multi-objective flexible job shop scheduling toward industry 5.0. Int J Production Res 63(1):119\u2013147","journal-title":"Int J Production Res"},{"key":"488_CR4","doi-asserted-by":"publisher","DOI":"10.1016\/j.sysarc.2022.102598","volume":"129","author":"J Chen","year":"2022","unstructured":"Chen J, He Y, Zhang Y et al (2022) Energy-aware scheduling for dependent tasks in heterogeneous multiprocessor systems. J Syst Architect 129:102598","journal-title":"J Syst Architect"},{"key":"488_CR5","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1016\/j.rcim.2019.04.006","volume":"59","author":"M Dai","year":"2019","unstructured":"Dai M et al (2019) Multi-objective optimization for energy-efficient flexible job shop scheduling problem with transportation constraints. Robotics Comput-Integrated Manufacturing 59:143\u2013157","journal-title":"Robotics Comput-Integrated Manufacturing"},{"issue":"2","key":"488_CR6","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1016\/j.ejor.2023.05.017","volume":"314","author":"S Dauz\u00e8re-P\u00e9r\u00e8s","year":"2024","unstructured":"Dauz\u00e8re-P\u00e9r\u00e8s S, Ding J, Shen L et al (2024) The flexible job shop scheduling problem: a review. Eur J Oper Res 314(2):409\u2013432","journal-title":"Eur J Oper Res"},{"issue":"2","key":"488_CR7","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 et al (2002) A fast and elitist multiobjective genetic algorithm: Nsga-ii. IEEE Trans Evol Comput 6(2):182\u2013197","journal-title":"IEEE Trans Evol Comput"},{"key":"488_CR8","unstructured":"Deroussi L, Norre S (2010) Simultaneous scheduling of machines and vehicles for the flexible job shop problem. In: Proceedings of the International Conference on Metaheuristics and Nature Inspired Computing, Djerba Island, Tunisia, pp 1\u20132"},{"key":"488_CR9","doi-asserted-by":"publisher","first-page":"650","DOI":"10.1016\/j.jmsy.2022.01.014","volume":"62","author":"J Fan","year":"2022","unstructured":"Fan J, Zhang C, Liu Q et al (2022) An improved genetic algorithm for flexible job shop scheduling problem considering reconfigurable machine tools with limited auxiliary modules. J Manuf Syst 62:650\u2013667","journal-title":"J Manuf Syst"},{"issue":"6","key":"488_CR10","doi-asserted-by":"publisher","first-page":"763","DOI":"10.1504\/EJIE.2020.112479","volume":"14","author":"A Fekih","year":"2020","unstructured":"Fekih A, Hadda H, Kacem I et al (2020) A hybrid genetic tabu search algorithm for minimising total completion time in a flexible job-shop scheduling problem. Eur J Industrial Eng 14(6):763\u2013781","journal-title":"Eur J Industrial Eng"},{"key":"488_CR11","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2022.101131","volume":"75","author":"G Gong","year":"2022","unstructured":"Gong G, Chiong R, Deng Q et al (2022) A two-stage memetic algorithm for energy-efficient flexible job shop scheduling by means of decreasing the total number of machine restarts. Swarm Evol Comput 75:101131","journal-title":"Swarm Evol Comput"},{"key":"488_CR12","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2024.101538","volume":"86","author":"X Han","year":"2024","unstructured":"Han X et al (2024) A dual population collaborative genetic algorithm for solving flexible job shop scheduling problem with agv. Swarm Evol Comput 86:101538","journal-title":"Swarm Evol Comput"},{"issue":"2","key":"488_CR13","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1007\/s10898-021-00992-6","volume":"79","author":"S Homayouni","year":"2021","unstructured":"Homayouni S, Fontes D (2021) Production and transport scheduling in flexible job shop manufacturing systems. J Global Optim 79(2):463\u2013502","journal-title":"J Global Optim"},{"key":"488_CR14","doi-asserted-by":"publisher","first-page":"688","DOI":"10.1111\/itor.12878","volume":"30","author":"S Homayouni","year":"2023","unstructured":"Homayouni S, Fontes D, Gonalves J (2023) A multistart biased random key genetic algorithm for the flexible job shop scheduling problem with transportation. Int Trans Oper Res 30:688\u2013716","journal-title":"Int Trans Oper Res"},{"key":"488_CR15","unstructured":"International Energy Agency (2023) Industry - energy system. https:\/\/www.iea.org\/energy-system\/industry"},{"issue":"3","key":"488_CR16","doi-asserted-by":"publisher","first-page":"610","DOI":"10.1109\/TEVC.2022.3175832","volume":"27","author":"R Li","year":"2022","unstructured":"Li R, Gong W, Lu C et al (2022) A learning-based memetic algorithm for energy-efficient flexible job-shop scheduling with type-2 fuzzy processing time. IEEE Trans Evol Comput 27(3):610\u2013620","journal-title":"IEEE Trans Evol Comput"},{"issue":"12","key":"488_CR17","doi-asserted-by":"publisher","first-page":"8013","DOI":"10.1109\/TCYB.2023.3280175","volume":"53","author":"R Li","year":"2023","unstructured":"Li R, Gong W, Wang L et al (2023) Surprisingly popular-based adaptive memetic algorithm for energy-efficient distributed flexible job shop scheduling. IEEE Trans Cybernetics 53(12):8013\u20138023","journal-title":"IEEE Trans Cybernetics"},{"key":"488_CR18","doi-asserted-by":"publisher","first-page":"344","DOI":"10.1016\/j.jmsy.2022.04.005","volume":"63","author":"Y Li","year":"2022","unstructured":"Li Y, Li X, Gao L et al (2022) An efficient critical path based method for permutation flow shop scheduling problem. J Manuf Syst 63:344\u2013353","journal-title":"J Manuf Syst"},{"key":"488_CR19","doi-asserted-by":"publisher","DOI":"10.1016\/j.engappai.2024.107917","volume":"132","author":"J Liu","year":"2024","unstructured":"Liu J et al (2024) Multi-objective adaptive large neighbourhood search algorithm for dynamic flexible job shop schedule problem with transportation resource. Eng Appl Artif Intell 132:107917","journal-title":"Eng Appl Artif Intell"},{"issue":"10","key":"488_CR20","doi-asserted-by":"publisher","first-page":"1944","DOI":"10.3390\/pr10101944","volume":"10","author":"Z Liu","year":"2022","unstructured":"Liu Z et al (2022) The low-carbon scheduling optimization of integrated multispeed flexible manufacturing and multiagv transportation. Processes 10(10):1944","journal-title":"Processes"},{"key":"488_CR21","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2024.111508","volume":"156","author":"C Lu","year":"2024","unstructured":"Lu C, Zhou J, Gao L et al (2024) Modeling and multi-objective optimization for energy-aware scheduling of distributed hybrid flow-shop. Appl Soft Comput 156:111508","journal-title":"Appl Soft Comput"},{"key":"488_CR22","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2023.121149","volume":"235","author":"C Luo","year":"2024","unstructured":"Luo C, Gong W, Lu C (2024) Knowledge-driven two-stage memetic algorithm for energy-efficient flexible job shop scheduling with machine breakdowns. Expert Syst Appl 235:121149","journal-title":"Expert Syst Appl"},{"key":"488_CR23","doi-asserted-by":"crossref","unstructured":"Luo C, Li X, Gong W et al (2025) Affinity propagation hierarchical memetic algorithm for multimodal multi-objective flexible job shop scheduling with variable speed. IEEE Transactions on Evolutionary Computation Early Access","DOI":"10.1109\/TEVC.2024.3521585"},{"key":"488_CR24","doi-asserted-by":"publisher","DOI":"10.1016\/j.engappai.2025.110447","volume":"149","author":"J Ma","year":"2025","unstructured":"Ma J, Gao W, Tong W (2025) A deep reinforcement learning assisted adaptive genetic algorithm for flexible job shop scheduling. Eng Appl Artif Intell 149:110447","journal-title":"Eng Appl Artif Intell"},{"key":"488_CR25","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2022.119474","volume":"216","author":"M Pal","year":"2023","unstructured":"Pal M, Mittal ML, Soni G et al (2023) A multi-agent system for fjsp with setup and transportation times. Expert Syst Appl 216:119474","journal-title":"Expert Syst Appl"},{"issue":"6","key":"488_CR26","doi-asserted-by":"publisher","first-page":"1590","DOI":"10.1109\/TEVC.2022.3219238","volume":"27","author":"Z Pan","year":"2023","unstructured":"Pan Z, Wang L, Zheng J et al (2023) A learning-based multi-population evolutionary optimization for flexible job shop scheduling problem with finite transportation resources. IEEE Trans Evol Comput 27(6):1590\u20131603","journal-title":"IEEE Trans Evol Comput"},{"issue":"4","key":"488_CR27","doi-asserted-by":"publisher","first-page":"2285","DOI":"10.1007\/s11831-021-09663-x","volume":"29","author":"JLJ Pereira","year":"2022","unstructured":"Pereira JLJ, Oliver GA, Francisco MB et al (2022) A review of multi-objective optimization: methods and algorithms in mechanical engineering problems. Archiv Comput Methods Eng 29(4):2285\u20132308","journal-title":"Archiv Comput Methods Eng"},{"key":"488_CR28","volume-title":"Design of Experiments Using the Taguchi Approach: 16 Steps to Product and Process Improvement","author":"RK Roy","year":"2001","unstructured":"Roy RK (2001) Design of Experiments Using the Taguchi Approach: 16 Steps to Product and Process Improvement. John Wiley & Sons"},{"issue":"3","key":"488_CR29","doi-asserted-by":"publisher","first-page":"992","DOI":"10.1016\/j.ejor.2023.03.041","volume":"310","author":"L Shen","year":"2023","unstructured":"Shen L, Dauz\u00e8re-P\u00e9r\u00e8s S, Maecker S (2023) Energy cost efficient scheduling in flexible job-shop manufacturing systems. Eur J Oper Res 310(3):992\u20131016","journal-title":"Eur J Oper Res"},{"key":"488_CR30","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2024.101485","volume":"85","author":"S Tian","year":"2024","unstructured":"Tian S, Zhang C, Fan J et al (2024) A genetic algorithm with critical path-based variable neighborhood search for distributed assembly job shop scheduling problem. Swarm Evol Comput 85:101485","journal-title":"Swarm Evol Comput"},{"key":"488_CR31","doi-asserted-by":"crossref","unstructured":"Wang J, Han H, Wang L (2024a) A feedback learning-based memetic algorithm for energy-aware distributed flexible job-shop scheduling with transportation constraints. IEEE Transactions on Evolutionary Computation","DOI":"10.1109\/TEVC.2024.3388527"},{"key":"488_CR32","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 et al (2024) A multi-disjunctive-graph model-based memetic algorithm for the distributed job shop scheduling problem. Adv Eng Inform 60:102401","journal-title":"Adv Eng Inform"},{"issue":"1","key":"488_CR33","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1109\/TEVC.2005.851275","volume":"10","author":"L While","year":"2006","unstructured":"While L, Hingston P, Barone L et al (2006) A faster algorithm for calculating hypervolume. IEEE Trans Evol Comput 10(1):29\u201338","journal-title":"IEEE Trans Evol Comput"},{"issue":"3","key":"488_CR34","doi-asserted-by":"publisher","first-page":"4753","DOI":"10.1109\/TASE.2023.3301656","volume":"21","author":"B Xin","year":"2023","unstructured":"Xin B, Lu S, Wang Q et al (2023) Simultaneous scheduling of processing machines and automated guided vehicles via a multi-view modeling-based hybrid algorithm. IEEE Trans Autom Sci Eng 21(3):4753\u20134767","journal-title":"IEEE Trans Autom Sci Eng"},{"key":"488_CR35","doi-asserted-by":"publisher","DOI":"10.1016\/j.engappai.2023.106864","volume":"126","author":"G Xu","year":"2023","unstructured":"Xu G, Bao Q, Zhang H (2023) Multi-objective green scheduling of integrated flexible job shop and automated guided vehicles. Eng Appl Artif Intell 126:106864","journal-title":"Eng Appl Artif Intell"},{"key":"488_CR36","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2024.101625","volume":"89","author":"Y Xu","year":"2024","unstructured":"Xu Y, Jiang X, Li J et al (2024) A knowledge-driven memetic algorithm for the energy-efficient distributed homogeneous flow shop scheduling problem. Swarm Evol Comput 89:101625","journal-title":"Swarm Evol Comput"},{"key":"488_CR37","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2024.101836","volume":"93","author":"Y Xu","year":"2025","unstructured":"Xu Y, Wang D, Zhang M et al (2025) Quantum particle swarm optimization with chaotic encoding schemes for flexible job-shop scheduling problem. Swarm Evol Comput 93:101836","journal-title":"Swarm Evol Comput"},{"key":"488_CR38","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2024.101544","volume":"87","author":"Y Yao","year":"2024","unstructured":"Yao Y, Li X, Gao L (2024) A dqn-based memetic algorithm for energy-efficient job shop scheduling problem with integrated limited agvs. Swarm Evol Comput 87:101544","journal-title":"Swarm Evol Comput"},{"key":"488_CR39","doi-asserted-by":"crossref","unstructured":"Yao Y, Liu Q, Fu L et al (2024b) A novel mathematical model for the flexible job-shop scheduling problem with limited automated guided vehicles. IEEE Transactions on Automation Science and Engineering","DOI":"10.1109\/TASE.2024.3356255"},{"key":"488_CR40","doi-asserted-by":"publisher","DOI":"10.1016\/j.aei.2024.102647","volume":"62","author":"Y Yao","year":"2024","unstructured":"Yao Y et al (2024) Knowledge-based multi-objective evolutionary algorithm for energy-efficient flexible job shop scheduling with mobile robot transportation. Adv Eng Inform 62:102647","journal-title":"Adv Eng Inform"},{"key":"488_CR41","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2024.109917","volume":"189","author":"F Zhang","year":"2024","unstructured":"Zhang F, Li R, Gong W (2024) Deep reinforcement learning-based memetic algorithm for energy-aware flexible job shop scheduling with multi-agv. Comput Industrial Eng 189:109917","journal-title":"Comput Industrial Eng"},{"issue":"6","key":"488_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 Trans Evol Comput 11(6):712\u2013731","journal-title":"IEEE Trans Evol Comput"},{"key":"488_CR43","doi-asserted-by":"publisher","DOI":"10.1016\/j.sysarc.2022.102524","volume":"127","author":"YW Zhang","year":"2022","unstructured":"Zhang YW, Chen RK (2022) A survey of energy-aware scheduling in mixed-criticality systems. J Syst Architect 127:102524","journal-title":"J Syst Architect"},{"key":"488_CR44","doi-asserted-by":"publisher","DOI":"10.1016\/j.engappai.2024.108841","volume":"135","author":"Z Zhang","year":"2024","unstructured":"Zhang Z, Li Y, Qian B et al (2024) A multidimensional probabilistic model based evolutionary algorithm for the energy-efficient distributed flexible job-shop scheduling problem. Eng Appl Artif Intell 135:108841","journal-title":"Eng Appl Artif Intell"},{"key":"488_CR45","doi-asserted-by":"crossref","unstructured":"Zhao F, Du Y, Zhuang C et al (2025) An iterative greedy algorithm for solving a multiobjective distributed assembly flexible job shop scheduling problem with fuzzy processing time. IEEE Transactions on Cybernetics","DOI":"10.1109\/TCYB.2025.3538007"},{"key":"488_CR46","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2024.101697","volume":"90","author":"CZ Zheng","year":"2024","unstructured":"Zheng CZ, Sang HY, Xing LN (2024) A self-adaptive memetic algorithm with q-learning for solving the multi-agvs dispatching problem. Swarm Evol Comput 90:101697","journal-title":"Swarm Evol Comput"},{"key":"488_CR47","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2025.101997","volume":"96","author":"J Zhou","year":"2025","unstructured":"Zhou J, Zhang Y, Wang J (2025) Data-driven assisted multiobjective routing optimization for multimodal transportation under fuzzy demand. Swarm Evol Comput 96:101997","journal-title":"Swarm Evol Comput"},{"key":"488_CR48","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2023.121205","volume":"237","author":"N Zhu","year":"2024","unstructured":"Zhu N, Gong G, Lu D et al (2024) An effective reformative memetic algorithm for distributed flexible job-shop scheduling problem with order cancellation. Expert Syst Appl 237:121205","journal-title":"Expert Syst Appl"},{"issue":"2","key":"488_CR49","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1162\/106365600568202","volume":"8","author":"E Zitzler","year":"2000","unstructured":"Zitzler E, Deb K, Thiele L (2000) Comparison of multiobjective evolutionary algorithms: empirical results. Evol Comput 8(2):173\u2013195","journal-title":"Evol Comput"},{"key":"488_CR50","unstructured":"Zitzler E, Laumanns M, Thiele L (2001) Spea2: Improving the strength pareto evolutionary algorithm. TIK Report 103, Computer Engineering and Networks Laboratory (TIK), ETH Zurich"}],"container-title":["Memetic Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12293-025-00488-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12293-025-00488-w","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12293-025-00488-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,30]],"date-time":"2026-03-30T11:02:14Z","timestamp":1774868534000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12293-025-00488-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,12,2]]},"references-count":50,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2026,3]]}},"alternative-id":["488"],"URL":"https:\/\/doi.org\/10.1007\/s12293-025-00488-w","relation":{"has-preprint":[{"id-type":"doi","id":"10.21203\/rs.3.rs-7242105\/v1","asserted-by":"object"}]},"ISSN":["1865-9284","1865-9292"],"issn-type":[{"value":"1865-9284","type":"print"},{"value":"1865-9292","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,12,2]]},"assertion":[{"value":"29 July 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 November 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 December 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 have no relevant financial or non-financial interests to disclose.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflicts of Interest"}},{"value":"The authors declare no competing interests.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"1"}}