{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,23]],"date-time":"2026-10-23T19:25:03Z","timestamp":1792783503897,"version":"4.5.0"},"reference-count":57,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2026,1,10]],"date-time":"2026-01-10T00:00:00Z","timestamp":1768003200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0"},{"start":{"date-parts":[[2026,1,28]],"date-time":"2026-01-28T00:00:00Z","timestamp":1769558400000},"content-version":"vor","delay-in-days":18,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["72201115|"],"award-info":[{"award-number":["72201115|"]}],"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":["62173169"],"award-info":[{"award-number":["62173169"]}],"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":["U24A20273"],"award-info":[{"award-number":["U24A20273"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Yunnan Provincial Outstanding Youth Science Foundation","award":["202501AW070010"],"award-info":[{"award-number":["202501AW070010"]}]},{"DOI":"10.13039\/100007471","name":"Applied Basic Research Foundation of Yunnan Province","doi-asserted-by":"publisher","award":["202201BE070001-050"],"award-info":[{"award-number":["202201BE070001-050"]}],"id":[{"id":"10.13039\/100007471","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100007471","name":"Applied Basic Research Foundation of Yunnan Province","doi-asserted-by":"publisher","award":["202301AU070069"],"award-info":[{"award-number":["202301AU070069"]}],"id":[{"id":"10.13039\/100007471","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100007471","name":"Applied Basic Research Foundation of Yunnan Province","doi-asserted-by":"publisher","award":["202401AT070361"],"award-info":[{"award-number":["202401AT070361"]}],"id":[{"id":"10.13039\/100007471","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100005147","name":"Applied Basic Research Key Project of Yunnan","doi-asserted-by":"publisher","award":["202201AS070030"],"award-info":[{"award-number":["202201AS070030"]}],"id":[{"id":"10.13039\/501100005147","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Construction Proiect of Hiaherr Educational Key Laboratory for Industrial Intelligence and Systems of Yunnan Province","award":["KKPH202403003"],"award-info":[{"award-number":["KKPH202403003"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Complex Intell. Syst."],"published-print":{"date-parts":[[2026,3]]},"DOI":"10.1007\/s40747-025-02158-3","type":"journal-article","created":{"date-parts":[[2026,1,10]],"date-time":"2026-01-10T10:34:29Z","timestamp":1768041269000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A decomposition-based Q-learning enhanced evolutionary algorithm for the transportation-assembly collaborative optimization problem"],"prefix":"10.1007","volume":"12","author":[{"given":"Tong","family":"Hang","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1281-5763","authenticated-orcid":false,"given":"Zi-Qi","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Bin","family":"Qian","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Rong","family":"Hu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Wei","family":"Chen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jian-Bo","family":"Yang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,1,10]]},"reference":[{"key":"2158_CR1","doi-asserted-by":"crossref","first-page":"3545","DOI":"10.1007\/s00170-020-06097-w","volume":"111","author":"T Chen","year":"2020","unstructured":"Chen T, Lin C-W (2020) Smart and automation technologies for ensuring the long-term operation of a factory amid the COVID-19 pandemic: an evolving fuzzy assessment approach. Int J Adv Manuf Technol 111:3545\u20133558","journal-title":"Int J Adv Manuf Technol"},{"key":"2158_CR2","volume":"205","author":"K Lei","year":"2022","unstructured":"Lei K, Guo P, Zhao W, Wang Y, Qian L, Meng X, Tang L (2022) A multi-action deep reinforcement learning framework for flexible job-shop scheduling problem. Expert Syst Appl 205:117796","journal-title":"Expert Syst Appl"},{"key":"2158_CR3","doi-asserted-by":"crossref","DOI":"10.1016\/j.eswa.2020.114491","volume":"170","author":"A Biswas","year":"2021","unstructured":"Biswas A, Pal T (2021) A comparison between metaheuristics for solving a capacitated fixed charge transportation problem with multiple objectives. Expert Syst Appl 170:114491","journal-title":"Expert Syst Appl"},{"key":"2158_CR4","doi-asserted-by":"crossref","first-page":"32","DOI":"10.1016\/j.tre.2015.12.001","volume":"86","author":"DSW Lai","year":"2016","unstructured":"Lai DSW, Caliskan Demirag O, Leung JMY (2016) A tabu search heuristic for the heterogeneous vehicle routing problem on a multigraph. Transp Res Part E Logist Transp Rev 86:32\u201352","journal-title":"Transp Res Part E Logist Transp Rev"},{"key":"2158_CR5","first-page":"1","volume":"3","author":"M Li","year":"2018","unstructured":"Li M, Huang H-J, Liu HX (2018) Stochastic route choice equilibrium assignment for travelers with heterogeneous regret aversions. J Manag Sci Eng 3:1\u201315","journal-title":"J Manag Sci Eng"},{"key":"2158_CR6","doi-asserted-by":"crossref","first-page":"206","DOI":"10.1016\/j.cie.2018.04.041","volume":"120","author":"M Ji","year":"2018","unstructured":"Ji M, Fang J, Zhang W, Liao L, Cheng TCE, Tan Y (2018) Logistics scheduling to minimize the sum of total weighted inventory cost and transport cost. Computers Ind Eng 120:206\u2013215","journal-title":"Computers Ind Eng"},{"key":"2158_CR7","volume":"201","author":"C-J Lu","year":"2022","unstructured":"Lu C-J, Gu M, Lee T-S, Yang C-T (2022) Impact of carbon emission policy combinations on the optimal production-inventory decisions for deteriorating items. Expert Syst Appl 201:117234","journal-title":"Expert Syst Appl"},{"key":"2158_CR8","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2021.105235","author":"Z Li","year":"2021","unstructured":"Li Z, Kucukkoc I, Tang Q (2021) Enhanced branch-bound-remember and iterative beam search algorithms for type II assembly line balancing problem. Comput Oper Res. https:\/\/doi.org\/10.1016\/j.cor.2021.105235","journal-title":"Comput Oper Res"},{"key":"2158_CR9","doi-asserted-by":"crossref","DOI":"10.1016\/j.eswa.2022.117780","volume":"206","author":"AM Jalal","year":"2022","unstructured":"Jalal AM, Toso EAV, Tautenhain CPS, Nascimento MCV (2022) An integrated location\u2013transportation problem under value-added tax issues in pharmaceutical distribution planning. Expert Syst Appl 206:117780","journal-title":"Expert Syst Appl"},{"key":"2158_CR10","doi-asserted-by":"crossref","first-page":"200","DOI":"10.1016\/j.ejor.2017.06.017","volume":"264","author":"A Dolgui","year":"2018","unstructured":"Dolgui A, Kovalev S, Kovalyov MY, Malyutin S, Soukhal A (2018) Optimal workforce assignment to operations of a paced assembly line. Eur J Oper Res 264:200\u2013211","journal-title":"Eur J Oper Res"},{"key":"2158_CR11","doi-asserted-by":"crossref","first-page":"844","DOI":"10.1016\/j.ejor.2020.05.017","volume":"287","author":"E Suzanne","year":"2020","unstructured":"Suzanne E, Absi N, Borodin V, van den Heuvel W (2020) A single-item lot-sizing problem with a by-product and inventory capacities. Eur J Oper Res 287:844\u2013855","journal-title":"Eur J Oper Res"},{"key":"2158_CR12","doi-asserted-by":"crossref","first-page":"122","DOI":"10.1016\/j.ejor.2016.01.003","volume":"252","author":"L Taccari","year":"2016","unstructured":"Taccari L (2016) Integer programming formulations for the elementary shortest path problem. Eur J Oper Res 252:122\u2013130","journal-title":"Eur J Oper Res"},{"key":"2158_CR13","first-page":"1","volume":"54","author":"M Fathi","year":"2017","unstructured":"Fathi M, Rodriguez V, Fontes DBMM, Alvarez MJ (2017) A modified particle swarm optimisation algorithm to solve the part feeding problem at assembly lines. Int J Prod Res 54:1\u201316","journal-title":"Int J Prod Res"},{"key":"2158_CR14","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1007\/s10696-011-9116-1","volume":"24","author":"J Golz","year":"2011","unstructured":"Golz J, Gujjula R, G\u00fcnther H-O, Rinderer S, Ziegler M (2011) Part feeding at high-variant mixed-model assembly lines. Flex Serv Manuf J 24:119\u2013141","journal-title":"Flex Serv Manuf J"},{"key":"2158_CR15","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1108\/AA-03-2019-0057","volume":"40","author":"HF Rahman","year":"2020","unstructured":"Rahman HF, Janardhanan MN, Nielsen P (2020) An integrated approach for line balancing and AGV scheduling towards smart assembly systems. Assem Autom 40:219\u2013234","journal-title":"Assem Autom"},{"key":"2158_CR16","volume":"186","author":"Q Luo","year":"2023","unstructured":"Luo Q, Deng Q, Guo X, Gong G, Zhao X, Chen L (2023) Modelling and optimization of distributed assembly hybrid flowshop scheduling problem with transportation resource scheduling. Comput Ind Eng 186:109717","journal-title":"Comput Ind Eng"},{"key":"2158_CR17","doi-asserted-by":"crossref","first-page":"2133","DOI":"10.1080\/00207543.2024.2396512","volume":"63","author":"H Kazemi","year":"2025","unstructured":"Kazemi H, Nourelfath M, Fathollahi-Fard AM, Gendreau M (2025) Integrated two-stage multi-factory assembly scheduling with maintenance considerations. Int J Prod Res 63:2133\u20132149","journal-title":"Int J Prod Res"},{"key":"2158_CR18","first-page":"211","volume":"23","author":"M Sharma","year":"2020","unstructured":"Sharma M, Garg R (2020) HIGA: harmony-inspired genetic algorithm for rack-aware energy-efficient task scheduling in cloud data centers. Eng Sci Technol Int J 23:211\u2013224","journal-title":"Eng Sci Technol Int J"},{"key":"2158_CR19","doi-asserted-by":"publisher","DOI":"10.3389\/fvets.2022.830287","author":"J Campbell","year":"2022","unstructured":"Campbell J, Chapman P, Klag A (2022) The prevalence, magnitude, and reversibility of elevated liver enzyme activities in hyperthyroid cats presenting for iodine-131 treatment. Front Vet Sci. https:\/\/doi.org\/10.3389\/fvets.2022.830287","journal-title":"Front Vet Sci"},{"key":"2158_CR20","doi-asserted-by":"crossref","first-page":"1145","DOI":"10.1243\/09544054JEM1757","volume":"224","author":"K Shahanaghi","year":"2010","unstructured":"Shahanaghi K, Yolmeh AM, Bahalke U (2010) Scheduling and balancing assembly lines with the task deterioration effect. Proc Inst Mech Eng Part B J Eng Manuf 224:1145\u20131153","journal-title":"Proc Inst Mech Eng Part B J Eng Manuf"},{"key":"2158_CR21","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1007\/s10288-016-0320-4","volume":"15","author":"Y Delice","year":"2017","unstructured":"Delice Y, Aydo\u011fan EK, \u00d6zcan U, \u0130lkay MS (2017) Balancing two-sided U-type assembly lines using modified particle swarm optimization algorithm. 4OR 15:37\u201366","journal-title":"4OR"},{"key":"2158_CR22","doi-asserted-by":"crossref","DOI":"10.1016\/j.engappai.2020.103745","volume":"94","author":"JC Molina","year":"2020","unstructured":"Molina JC, Salmeron JL, Eguia I, Racero J (2020) The heterogeneous vehicle routing problem with time windows and a limited number of resources. Eng Appl Artif Intell 94:103745","journal-title":"Eng Appl Artif Intell"},{"key":"2158_CR23","volume":"300","author":"Y Wang","year":"2024","unstructured":"Wang Y, Hong X, Wang Y, Zhao J, Sun G, Qin B (2024) Token-based deep reinforcement learning for heterogeneous VRP with service time constraints. Knowl-Based Syst 300:112173","journal-title":"Knowl-Based Syst"},{"key":"2158_CR24","volume":"173","author":"JP Mesa","year":"2025","unstructured":"Mesa JP, Montoya A, Ramos-Pollan R, Toro M (2025) Machine-learning component for multi-start metaheuristics to solve the capacitated vehicle routing problem. Appl Soft Comput 173:112916","journal-title":"Appl Soft Comput"},{"key":"2158_CR25","doi-asserted-by":"crossref","first-page":"13583","DOI":"10.1007\/s10586-024-04643-9","volume":"27","author":"Y\u00c7 Kuyu","year":"2024","unstructured":"Kuyu Y\u00c7, Vatansever F (2024) A hybrid approach of ALNS with alternative initialization and acceptance mechanisms for capacitated vehicle routing problems. Cluster Comput 27:13583\u201313606","journal-title":"Cluster Comput"},{"key":"2158_CR26","doi-asserted-by":"crossref","first-page":"349","DOI":"10.1016\/j.aej.2022.09.008","volume":"64","author":"Z Hussain Ahmed","year":"2023","unstructured":"Hussain Ahmed Z, Yousefikhoshbakht M (2023) An improved tabu search algorithm for solving heterogeneous fixed fleet open vehicle routing problem with time windows. Alexandria Eng J 64:349\u2013363","journal-title":"Alexandria Eng J"},{"key":"2158_CR27","doi-asserted-by":"crossref","DOI":"10.1016\/j.eswa.2023.120807","volume":"232","author":"N Dubey","year":"2023","unstructured":"Dubey N, Tanksale A (2023) A multi-depot vehicle routing problem with time windows, split pickup and split delivery for surplus food recovery and redistribution. Expert Syst Appl 232:120807","journal-title":"Expert Syst Appl"},{"key":"2158_CR28","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1007\/s10107-017-1151-6","volume":"172","author":"T Dinh","year":"2017","unstructured":"Dinh T, Fukasawa R, Luedtke J (2017) Exact algorithms for the chance-constrained vehicle routing problem. Math Program 172:105\u2013138","journal-title":"Math Program"},{"key":"2158_CR29","doi-asserted-by":"crossref","DOI":"10.1016\/j.compchemeng.2020.106886","volume":"139","author":"R Nian","year":"2020","unstructured":"Nian R, Liu J, Huang B (2020) A review on reinforcement learning: introduction and applications in industrial process control. Comput Chem Eng 139:106886","journal-title":"Comput Chem Eng"},{"key":"2158_CR30","doi-asserted-by":"crossref","first-page":"8037","DOI":"10.1109\/TITS.2021.3075221","volume":"23","author":"N Peng","year":"2021","unstructured":"Peng N, Xi Y, Rao J, Ma X, Ren F (2021) Urban multiple route planning model using dynamic programming in reinforcement learning. IEEE Trans Intell Transp Syst 23:8037\u20138047","journal-title":"IEEE Trans Intell Transp Syst"},{"key":"2158_CR31","volume":"129","author":"J Liu","year":"2021","unstructured":"Liu J (2021) On the convergence of reinforcement learning with Monte Carlo exploring starts. Automatica 129:109693","journal-title":"Automatica"},{"key":"2158_CR32","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1016\/j.neucom.2016.10.100","volume":"263","author":"M Ruiz-Montiel","year":"2017","unstructured":"Ruiz-Montiel M, Mandow L, P\u00e9rez-de-la-Cruz J-L (2017) A temporal difference method for multi-objective reinforcement learning. Neurocomputing 263:15\u201325","journal-title":"Neurocomputing"},{"key":"2158_CR33","volume":"186","author":"Z-Q Zhang","year":"2025","unstructured":"Zhang Z-Q, Fang M-H, Qian B, Hu R, Chen W (2025) A hierarchical collaborative multi-agent deep reinforcement learning framework for distributed flexible job shop scheduling problems considering energy efficiency and dynamic disruption in IIoTs. Appl Soft Comput 186:113992","journal-title":"Appl Soft Comput"},{"key":"2158_CR34","volume":"181","author":"Z-Q Zhang","year":"2025","unstructured":"Zhang Z-Q, Li X-W, Qian B, Jin H-P, Hu R, Yang J-B (2025) Multi-agent cooperative multi-network group framework for energy-efficient distributed fuzzy flexible job shop scheduling problem. Appl Soft Comput 181:113474","journal-title":"Appl Soft Comput"},{"key":"2158_CR35","volume":"210","author":"Z-Q Zhang","year":"2025","unstructured":"Zhang Z-Q, Huang T, Qian B, Hu R (2025) MAMHSAN: a multi-agent deep reinforcement learning framework based on multi-head self-attention network with heterogeneous graph embedding for flexible job shop scheduling. Comput Ind Eng 210:111466","journal-title":"Comput Ind Eng"},{"key":"2158_CR36","volume":"297","author":"Z-Q Zhang","year":"2026","unstructured":"Zhang Z-Q, Wu Z-M, Qian B, Hu R (2026) A reward-shaping dueling distributed multi-agent deep reinforcement learning framework for dynamic flexible job shop scheduling with random job arrivals. Expert Syst Appl 297:128951","journal-title":"Expert Syst Appl"},{"key":"2158_CR37","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1109\/TIFS.2017.2737968","volume":"13","author":"L Xiao","year":"2018","unstructured":"Xiao L, Li Y, Han G, Dai H, Poor HV (2018) A secure mobile crowdsensing game with deep reinforcement learning. IEEE Trans Inf Forensics Secur 13:35\u201347","journal-title":"IEEE Trans Inf Forensics Secur"},{"key":"2158_CR38","doi-asserted-by":"crossref","first-page":"130","DOI":"10.1016\/j.artint.2017.12.001","volume":"256","author":"DL Leottau","year":"2018","unstructured":"Leottau DL, Ruiz-del-Solar J, Babu\u0161ka R (2018) Decentralized reinforcement learning of robot behaviors. Artif Intell 256:130\u2013159","journal-title":"Artif Intell"},{"key":"2158_CR39","doi-asserted-by":"crossref","DOI":"10.1016\/j.eswa.2022.118124","volume":"208","author":"A Shavandi","year":"2022","unstructured":"Shavandi A, Khedmati M (2022) A multi-agent deep reinforcement learning framework for algorithmic trading in financial markets. Expert Syst Appl 208:118124","journal-title":"Expert Syst Appl"},{"key":"2158_CR40","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1109\/TWC.2023.3277861","volume":"23","author":"J Chen","year":"2024","unstructured":"Chen J, Liu W, Quevedo DE, Khosravirad SR, Li Y, Vucetic B (2024) Structure-enhanced DRL for optimal transmission scheduling. IEEE Trans Wirel Commun 23:379\u2013393","journal-title":"IEEE Trans Wirel Commun"},{"key":"2158_CR41","doi-asserted-by":"crossref","first-page":"32454","DOI":"10.1109\/JIOT.2024.3432119","volume":"11","author":"S Dai","year":"2024","unstructured":"Dai S, Li S, Tang H, Ning X, Fang F, Fu Y, Wang Q, Cheng L (2024) MARP: a cooperative multiagent DRL system for connected autonomous vehicle platooning. IEEE Internet Things J 11:32454\u201332463","journal-title":"IEEE Internet Things J"},{"key":"2158_CR42","doi-asserted-by":"crossref","first-page":"4834","DOI":"10.1109\/JIOT.2025.3526150","volume":"12","author":"P Singh","year":"2025","unstructured":"Singh P, Hazarika B, Singh K, Huang WJ, Duong TQ (2025) GenAI-enhanced federated multiagent DRL for digital-twin-assisted IoV networks. IEEE Internet Things J 12:4834\u20134851","journal-title":"IEEE Internet Things J"},{"key":"2158_CR43","volume":"234","author":"Z-Q Zhang","year":"2023","unstructured":"Zhang Z-Q, Wu F-C, Qian B, Hu R, Wang L, Jin H-P (2023) A Q-learning-based hyper-heuristic evolutionary algorithm for the distributed flexible job-shop scheduling problem with crane transportation. Expert Syst Appl 234:121050","journal-title":"Expert Syst Appl"},{"key":"2158_CR44","volume":"146","author":"Z-Q Zhang","year":"2023","unstructured":"Zhang Z-Q, Qian B, Hu R, Yang J-B (2023) Q-learning-based hyper-heuristic evolutionary algorithm for the distributed assembly blocking flowshop scheduling problem. Appl Soft Comput 146:110695","journal-title":"Appl Soft Comput"},{"key":"2158_CR45","volume":"86","author":"R Hu","year":"2024","unstructured":"Hu R, Huang Y-F, Wu X, Qian B, Wang L, Zhang Z-Q (2024) Collaborative Q-learning hyper-heuristic evolutionary algorithm for the production and transportation integrated scheduling of silicon electrodes. Swarm Evol Comput 86:101498","journal-title":"Swarm Evol Comput"},{"key":"2158_CR46","volume":"185","author":"Z-Q Zhang","year":"2026","unstructured":"Zhang Z-Q, Wu X-Y, Qian B, Hu R, Yang J-B (2026) A Q-learning-based multi-objective hyper-heuristic algorithm for energy-efficient integrated distributed hybrid flow-shop scheduling with preventive maintenance. Comput Oper Res 185:107267","journal-title":"Comput Oper Res"},{"key":"2158_CR47","volume":"260","author":"Z-Q Zhang","year":"2025","unstructured":"Zhang Z-Q, Qiu X-H, Qian B, Hu R, Wang L, Yang J-B (2025) Knowledge-enhanced multidimensional estimation of distribution hyper-heuristic evolutionary algorithm for semiconductor final testing scheduling problem. Expert Syst Appl 260:125424","journal-title":"Expert Syst Appl"},{"key":"2158_CR48","volume":"271","author":"Z-Q Zhang","year":"2025","unstructured":"Zhang Z-Q, Zhu X-P, Xu Y-X, Qian B, Yang B, Hu R (2025) MEDHEA: Multidimensional estimation of distribution based hyper-heuristic evolutionary algorithm for energy-efficient distributed assembly no-wait flow-shop scheduling problem. Expert Syst Appl 271:126526","journal-title":"Expert Syst Appl"},{"key":"2158_CR49","volume":"135","author":"Z-Q Zhang","year":"2024","unstructured":"Zhang Z-Q, Li Y, Qian B, Hu R, Yang J-B (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":"2158_CR50","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1016\/j.robot.2019.02.013","volume":"115","author":"ES Low","year":"2019","unstructured":"Low ES, Ong P, Cheah KC (2019) Solving the optimal path planning of a mobile robot using improved Q-learning. Robot Auton Syst 115:143\u2013161","journal-title":"Robot Auton Syst"},{"key":"2158_CR51","doi-asserted-by":"crossref","first-page":"417","DOI":"10.1007\/s10845-018-1454-3","volume":"31","author":"Y-F Wang","year":"2020","unstructured":"Wang Y-F (2020) Adaptive job shop scheduling strategy based on weighted Q-learning algorithm. J Intell Manuf 31:417\u2013432","journal-title":"J Intell Manuf"},{"key":"2158_CR52","doi-asserted-by":"crossref","first-page":"148","DOI":"10.1016\/j.eswa.2019.04.056","volume":"131","author":"MA Lopes Silva","year":"2019","unstructured":"Lopes Silva MA, de Souza SR, Freitas Souza MJ, Bazzan ALC (2019) A reinforcement learning-based multi-agent framework applied for solving routing and scheduling problems. Expert Syst Appl 131:148\u2013171","journal-title":"Expert Syst Appl"},{"key":"2158_CR53","doi-asserted-by":"crossref","first-page":"2211","DOI":"10.1109\/TCYB.2021.3112675","volume":"53","author":"J-J Ji","year":"2021","unstructured":"Ji J-J, Guo Y-N, Gao X-Z, Gong D-W, Wang Y-P (2021) Q-learning-based hyperheuristic evolutionary algorithm for dynamic task allocation of crowdsensing. IEEE Trans Cybern 53:2211\u20132224","journal-title":"IEEE Trans Cybern"},{"key":"2158_CR54","volume":"80","author":"H Yu","year":"2023","unstructured":"Yu H, Gao K-Z, Ma Z-F, Pan Y-X (2023) Improved meta-heuristics with Q-learning for solving distributed assembly permutation flowshop scheduling problems. Swarm Evol Comput 80:101335","journal-title":"Swarm Evol Comput"},{"key":"2158_CR55","volume":"166","author":"H Yu","year":"2024","unstructured":"Yu H, Gao K, Li Z, Suganthan PN (2024) Energy-efficient multi-objective distributed assembly permutation flowshop scheduling by Q-learning based meta-heuristics. Appl Soft Comput 166:112247","journal-title":"Appl Soft Comput"},{"key":"2158_CR56","doi-asserted-by":"crossref","DOI":"10.1016\/j.engappai.2025.110537","volume":"149","author":"H Xuan","year":"2025","unstructured":"Xuan H, Zheng Q-Q, Lv L, Li B (2025) Q-learning based estimation of distribution algorithm for scheduling distributed heterogeneous flexible flow-shop with mixed buffering limitation. Eng Appl Artif Intell 149:110537","journal-title":"Eng Appl Artif Intell"},{"key":"2158_CR57","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1016\/j.cie.2016.05.004","volume":"97","author":"Q Tang","year":"2016","unstructured":"Tang Q, Li Z, Zhang L (2016) An effective discrete artificial bee colony algorithm with idle time reduction techniques for two-sided assembly line balancing problem of type-II. Comput Ind Eng 97:146\u2013156","journal-title":"Comput Ind Eng"}],"container-title":["Complex & Intelligent Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s40747-025-02158-3","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40747-025-02158-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40747-025-02158-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,25]],"date-time":"2026-03-25T07:55:09Z","timestamp":1774425309000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s40747-025-02158-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,1,10]]},"references-count":57,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2026,3]]}},"alternative-id":["2158"],"URL":"https:\/\/doi.org\/10.1007\/s40747-025-02158-3","relation":{},"ISSN":["2199-4536","2198-6053"],"issn-type":[{"value":"2199-4536","type":"print"},{"value":"2198-6053","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,1,10]]},"assertion":[{"value":"21 May 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 October 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 January 2026","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 declared that they have no 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":"93"}}