{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,31]],"date-time":"2026-01-31T07:34:20Z","timestamp":1769844860391,"version":"3.49.0"},"reference-count":56,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2025,12,20]],"date-time":"2025-12-20T00:00:00Z","timestamp":1766188800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,12,20]],"date-time":"2025-12-20T00:00:00Z","timestamp":1766188800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/100014718","name":"Innovative Research Group Project of the National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["18ZDA103"],"award-info":[{"award-number":["18ZDA103"]}],"id":[{"id":"10.13039\/100014718","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Soft Comput"],"published-print":{"date-parts":[[2026,1]]},"DOI":"10.1007\/s00500-025-10988-z","type":"journal-article","created":{"date-parts":[[2025,12,20]],"date-time":"2025-12-20T04:54:03Z","timestamp":1766206443000},"page":"635-652","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Improved salp swarm algorithm for multi-resource job shop scheduling problem with buffer capacity constraints"],"prefix":"10.1007","volume":"30","author":[{"given":"Bohan","family":"Zhang","sequence":"first","affiliation":[]},{"given":"Tianshuai","family":"Zuo","sequence":"additional","affiliation":[]},{"given":"Zhaohe","family":"Wang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,12,20]]},"reference":[{"issue":"1","key":"10988_CR1","doi-asserted-by":"publisher","DOI":"10.1007\/s42979-023-02517-2","volume":"5","author":"B Acharya","year":"2024","unstructured":"Acharya B, Panda S, Ray NK (2024) Multiprocessor task scheduling optimization for cyber-physical system using an improved Salp swarm optimization algorithm. SN Comput Sci 5(1):184","journal-title":"SN Comput Sci"},{"key":"10988_CR2","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1016\/j.apm.2021.01.017","volume":"94","author":"AE Ahmed","year":"2021","unstructured":"Ahmed AE, Mohammed AAA, Mohamed AE (2021) Enhanced salp swarm algorithm based on firefly algorithm for unrelated parallel machine scheduling with setup times. Appl Math Model 94:285\u2013305","journal-title":"Appl Math Model"},{"key":"10988_CR3","first-page":"1","volume":"08","author":"AJ Amir","year":"2023","unstructured":"Amir AJ, Maryam H, Pedram HT (2023) Integrated job-shop scheduling in an FMS with heterogeneous transporters: MILP formulation, constraint programming, and branch-and-bound. Int J Prod Res 08:1\u201317","journal-title":"Int J Prod Res"},{"key":"10988_CR4","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2024.125497","volume":"263","author":"MH Amiri","year":"2025","unstructured":"Amiri MH, Hashjin NM, Najafabadi MK, Beheshti A, Khodadadi N (2025) An innovative data-driven AI approach for detecting and isolating faults in gas turbines at power plants. Expert Syst Appl 263:125497","journal-title":"Expert Syst Appl"},{"issue":"20","key":"10988_CR5","doi-asserted-by":"publisher","first-page":"12141","DOI":"10.1007\/s00500-024-09913-7","volume":"28","author":"MH Amiri","year":"2024","unstructured":"Amiri MH, Pourgholi M, Hashjin NM, Ardakani MK (2024) Monitoring UAV status and detecting insulator faults in transmission lines with a new classifier based on aggregation votes between neural networks by interval type-2 TSK fuzzy system. Soft Comput 28(20):12141\u201312174","journal-title":"Soft Comput"},{"issue":"3","key":"10988_CR6","doi-asserted-by":"publisher","first-page":"813","DOI":"10.1080\/00207543.2019.1709671","volume":"59","author":"H Andy","year":"2021","unstructured":"Andy H (2021) Transfer-robot task scheduling in job shop. Int J Prod Res 59(3):813\u2013823","journal-title":"Int J Prod Res"},{"key":"10988_CR7","doi-asserted-by":"publisher","first-page":"2317","DOI":"10.1007\/s12541-023-00897-2","volume":"24","author":"D Chang","year":"2023","unstructured":"Chang D, Shi H, Han C, Meng F (2023) Research on production scheduling optimization of flexible job shop production with buffer capacity limitation based on the improved gene expression programming algorithm. Int J Precis Eng Manuf 24:2317\u20132336","journal-title":"Int J Precis Eng Manuf"},{"issue":"5","key":"10988_CR8","doi-asserted-by":"publisher","first-page":"8856","DOI":"10.3934\/mbe.2023389","volume":"20","author":"P Chen","year":"2023","unstructured":"Chen P, Liu M, Zhou S (2023) Discrete salp swarm algorithm for symmetric traveling salesman problem. Math Biosci Eng 20(5):8856\u20138874","journal-title":"Math Biosci Eng"},{"issue":"3","key":"10988_CR9","doi-asserted-by":"publisher","first-page":"1140","DOI":"10.1016\/j.ejor.2022.09.006","volume":"306","author":"DB Fontes","year":"2023","unstructured":"Fontes DB, Homayouni SM, Gon\u00e7alves JF (2023) A hybrid particle swarm optimization and simulated annealing algorithm for the job shop scheduling problem with transport resources. Eur J Oper Res 306(3):1140\u20131157","journal-title":"Eur J Oper Res"},{"issue":"2","key":"10988_CR10","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1016\/j.ejor.2021.01.019","volume":"294","author":"F Giuseppe","year":"2021","unstructured":"Giuseppe F, Ren\u00e9 dK, Fabio S, Jan OS (2021) Planning and control of autonomous mobile robots for intralogistics: literature review and research agenda. Eur J Oper Res 294(2):405\u2013426","journal-title":"Eur J Oper Res"},{"key":"10988_CR11","doi-asserted-by":"crossref","unstructured":"Golshan M, Robert PJ (2021). Accelerating the calculation of makespan used in scheduling improvement heuristics. Computers & Operations Research, 130","DOI":"10.1016\/j.cor.2021.105233"},{"key":"10988_CR12","doi-asserted-by":"publisher","DOI":"10.1007\/s10489-023-04479-7","author":"Y Gu","year":"2023","unstructured":"Gu Y, Chen M, Wang L (2023) A self-learning discrete salp swarm algorithm based on deep reinforcement learning for dynamic job shop scheduling problem. Appl Intell. https:\/\/doi.org\/10.1007\/s10489-023-04479-7","journal-title":"Appl Intell"},{"key":"10988_CR13","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2023.101421","volume":"84","author":"G Gong","year":"2024","unstructured":"Gong G, Tang J, Huang D, Luo Q, Zhu K, Peng N (2024) Energy-efficient flexible job shop scheduling problem considering discrete operation sequence flexibility. Swarm Evol Comput 84:101421","journal-title":"Swarm Evol Comput"},{"key":"10988_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.cie.2023.109255","volume":"180","author":"Y Gui","year":"2023","unstructured":"Gui Y, Tang D, Zhu H, Zhang Y, Zhang Z (2023) Dynamic scheduling for flexible job shop using a deep reinforcement learning approach. Comput Ind Eng 180:1\u201313","journal-title":"Comput Ind Eng"},{"issue":"2","key":"10988_CR15","doi-asserted-by":"publisher","first-page":"688","DOI":"10.1111\/itor.12878","volume":"30","author":"SM Homayouni","year":"2023","unstructured":"Homayouni SM, Fontes DB, Gon\u00e7alves JF (2023) A multistart biased random key genetic algorithm for the flexible job shop scheduling problem with transportation. Int Trans Oper Res 30(2):688\u2013716","journal-title":"Int Trans Oper Res"},{"issue":"2","key":"10988_CR16","doi-asserted-by":"publisher","first-page":"953","DOI":"10.1016\/j.ifacol.2023.10.1688","volume":"56","author":"P Javier","year":"2023","unstructured":"Javier P, Vicen\u00e7 P (2023) Job shop scheduling with limited-capacity buffers using constraint programming and genetic algorithms. IFAC-Papers OnLine 56(2):953\u2013958","journal-title":"IFAC-Papers OnLine"},{"issue":"Suppl 3","key":"10988_CR17","doi-asserted-by":"publisher","first-page":"3877","DOI":"10.1007\/s10462-023-10618-w","volume":"56","author":"S Kassaymeh","year":"2023","unstructured":"Kassaymeh S, Abdullah S, Al-Betar MA, Alweshah M, Salem AA, Makhadmeh SN, Al-Ma\u2019aitah MA (2023) An enhanced salp swarm optimizer boosted by local search algorithm for modelling prediction problems in software engineering. Artif Intell Rev 56(Suppl 3):3877\u20133925","journal-title":"Artif Intell Rev"},{"key":"10988_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, Fu L, Wang C (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":"10988_CR19","doi-asserted-by":"publisher","DOI":"10.1016\/j.rcim.2021.102283","volume":"74","author":"Y Li","year":"2022","unstructured":"Li Y, Gu W, Yuan M, Tang Y (2022) Real-time data-driven dynamic scheduling for flexible job shop with insufficient transportation resources using hybrid deep Q-network. Robot Comput Integr Manuf 74:102283","journal-title":"Robot Comput Integr Manuf"},{"key":"10988_CR20","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2023.110658","volume":"146","author":"Y Li","year":"2023","unstructured":"Li Y, Liao C, Wang L, Xiao Y, Cao Y, Guo S (2023) A reinforcement learning-artificial bee colony algorithm for flexible job-shop scheduling problem with lot streaming. Appl Soft Comput 146:110658","journal-title":"Appl Soft Comput"},{"key":"10988_CR21","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1016\/j.jmsy.2023.07.004","volume":"70","author":"Q Liu","year":"2023","unstructured":"Liu Q, Wang C, Li X, Gao L (2023) An improved genetic algorithm with modified critical path-based searching for integrated process planning and scheduling problem considering automated guided vehicle transportation task. J Manuf Syst 70:127\u2013136","journal-title":"J Manuf Syst"},{"issue":"3","key":"10988_CR22","doi-asserted-by":"publisher","first-page":"890","DOI":"10.1016\/j.ejor.2023.07.036","volume":"312","author":"B Lucas","year":"2024","unstructured":"Lucas B, St\u00e9phane D, Claude Y (2024) Flexible job-shop scheduling with transportation resources. Eur J Oper Res 312(3):890\u2013909","journal-title":"Eur J Oper Res"},{"key":"10988_CR23","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2022.108603","volume":"172","author":"V Masoumeh","year":"2022","unstructured":"Masoumeh V, Khodakaram S, Amir HG, Thierry JC (2022) Application of job shop scheduling approach in green patient flow optimization using a hybrid swarm intelligence. Comput Ind Eng 172:108603","journal-title":"Comput Ind Eng"},{"issue":"8","key":"10988_CR24","doi-asserted-by":"publisher","first-page":"2558","DOI":"10.1080\/00207543.2020.1735667","volume":"59","author":"T Matthias","year":"2021","unstructured":"Matthias T, Ma L, Mark S (2021) Workload control order release in general and pure flow shops with limited buffer size induced blocking: an assessment by simulation. Int J Prod Res 59(8):2558\u20132569","journal-title":"Int J Prod Res"},{"issue":"7","key":"10988_CR25","doi-asserted-by":"publisher","first-page":"10197","DOI":"10.1007\/s10586-024-04475-7","volume":"27","author":"N Mehrabi Hashjin","year":"2024","unstructured":"Mehrabi Hashjin N, Amiri MH, Mohammadzadeh A, Mirjalili S, Khodadadi N (2024) Novel hybrid classifier based on fuzzy type-III decision maker and ensemble deep learning model and improved chaos game optimization. Clust Comput 27(7):10197\u201310234","journal-title":"Clust Comput"},{"key":"10988_CR26","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2020.106347","volume":"142","author":"L Meng","year":"2020","unstructured":"Meng L, Zhang C, Ren Y, Zhang B, Lv C (2020) Mixed-integer linear programming and constraint programming formulations for solving distributed flexible job shop scheduling problem. Comput Ind Eng 142:106347","journal-title":"Comput Ind Eng"},{"key":"10988_CR27","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2023.110838","volume":"147","author":"A Mohamed","year":"2023","unstructured":"Mohamed A, Sara HK, Nabil HA, Yasmine A (2023) A Gaussian random walk salp swarm algorithm for optimal dynamic charging of electric vehicles. Appl Soft Comput 147:110838","journal-title":"Appl Soft Comput"},{"issue":"1","key":"10988_CR28","first-page":"14","volume":"288","author":"MA Mohammad","year":"2020","unstructured":"Mohammad MA, Amir S, Cheng TCE (2020) A meta-heuristic to solve the just-in-time job-shop scheduling problem. Eur J Oper Res 288(1):14\u201329","journal-title":"Eur J Oper Res"},{"issue":"2","key":"10988_CR29","doi-asserted-by":"publisher","first-page":"487","DOI":"10.1080\/00207543.2019.1597291","volume":"58","author":"Z Pei","year":"2020","unstructured":"Pei Z, Zhang X, Zheng L, Wan M (2020) A column generation-based approach for proportionate flexible two-stage no-wait job shop scheduling. Int J Prod Res 58(2):487\u2013508","journal-title":"Int J Prod Res"},{"key":"10988_CR30","doi-asserted-by":"publisher","first-page":"282","DOI":"10.1109\/TCSS.2023.3238965","volume":"11","author":"S Qin","year":"2023","unstructured":"Qin S, Li J, Wang J, Guo X, Liu S, Qi L (2023) A salp swarm algorithm for parallel disassembly line balancing considering workers with government benefits. IEEE Trans Comput Soc Syst 11:282\u2013291","journal-title":"IEEE Trans Comput Soc Syst"},{"issue":"18","key":"10988_CR31","doi-asserted-by":"publisher","first-page":"5675","DOI":"10.1080\/00207543.2021.1968526","volume":"60","author":"W Ren","year":"2022","unstructured":"Ren W, Yan Y, Hu Y, Guan Y (2022) Joint optimisation for dynamic flexible job-shop scheduling problem with transportation time and resource constraints. Int J Prod Res 60(18):5675\u20135696","journal-title":"Int J Prod Res"},{"key":"10988_CR32","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2023.119141","volume":"643","author":"J Shi","year":"2023","unstructured":"Shi J, Chen M, Ma Y, Qiao F (2023) A new boredom-aware dual-resource constrained flexible job shop scheduling problem using a two-stage multi-objective particle swarm optimization algorithm. Inf Sci 643:119141","journal-title":"Inf Sci"},{"key":"10988_CR33","doi-asserted-by":"publisher","DOI":"10.1016\/j.omega.2022.102770","volume":"115","author":"F Soroush","year":"2023","unstructured":"Soroush F, Reza T, Mehdi F, Behdin V (2023) Scheduling of multi-robot job shop systems in dynamic environments: mixed-integer linear programming and constraint programming approaches. Omega 115:102770","journal-title":"Omega"},{"issue":"2","key":"10988_CR34","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1016\/j.ejor.2023.05.017","volume":"314","author":"D St\u00e9phane","year":"2024","unstructured":"St\u00e9phane D, Ding J, Shen L, Karim T (2024) The flexible job shop scheduling problem: a review. Eur J Oper Res 314(2):409\u2013432","journal-title":"Eur J Oper Res"},{"key":"10988_CR35","doi-asserted-by":"crossref","unstructured":"Tasnim M, Olfa BD, Hind BE (2024) Distributed permutation flow shop scheduling problem with worker flexibility: Review, trends and model proposition. Expert Systems with Applications 238","DOI":"10.1016\/j.eswa.2023.121947"},{"key":"10988_CR36","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, Li X, Gao L (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":"10988_CR37","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/j.jmsy.2021.08.003","volume":"61","author":"Z Wang","year":"2021","unstructured":"Wang Z, Lu C (2021) An integrated job shop scheduling and assembly sequence planning approach for discrete manufacturing. J Manuf Syst 61:27\u201344","journal-title":"J Manuf Syst"},{"key":"10988_CR38","doi-asserted-by":"crossref","unstructured":"Wang J, Han H, Wang L (2024) 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"},{"issue":"17","key":"10988_CR39","doi-asserted-by":"publisher","first-page":"5791","DOI":"10.1080\/00207543.2022.2112989","volume":"61","author":"X Wen","year":"2023","unstructured":"Wen X, Sun Y, Ma H, Chung S (2023) Green smart manufacturing: energy-efficient robotic job shop scheduling models. Int J Prod Res 61(17):5791\u20135805","journal-title":"Int J Prod Res"},{"issue":"7","key":"10988_CR40","doi-asserted-by":"publisher","first-page":"2147","DOI":"10.1080\/00207543.2022.2060772","volume":"61","author":"J Xie","year":"2023","unstructured":"Xie J, Li X, Gao L, Gui L (2023) A new neighbourhood structure for job shop scheduling problems. Int J Prod Res 61(7):2147\u20132161","journal-title":"Int J Prod Res"},{"key":"10988_CR41","doi-asserted-by":"publisher","first-page":"398","DOI":"10.1016\/j.jmsy.2025.02.002","volume":"79","author":"Z Yang","year":"2025","unstructured":"Yang Z, Hu X et al (2025) A Q-learning-based improved multi-objective genetic algorithm for solving distributed heterogeneous assembly flexible job shop scheduling problems with transfers. J Manuf Syst 79:398\u2013418","journal-title":"J Manuf Syst"},{"key":"10988_CR42","doi-asserted-by":"publisher","DOI":"10.1007\/s10845-023-02252-8","author":"M Yuan","year":"2023","unstructured":"Yuan M, Zheng L, Huang H, Zhou K, Pei F, Gu W (2023) Research on flexible job shop scheduling problem with AGV using double DQN. J Intell Manuf. https:\/\/doi.org\/10.1007\/s10845-023-02252-8","journal-title":"J Intell Manuf"},{"key":"10988_CR43","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2025.101902","volume":"94","author":"M Yuan","year":"2025","unstructured":"Yuan M, Lu S, Zheng L, Yu Q, Pei F, Gu W (2025) Distributed heterogeneous flexible job-shop scheduling problem considering automated guided vehicle transportation via improved deep Q network. Swarm Evol Comput 94:101902","journal-title":"Swarm Evol Comput"},{"issue":"1","key":"10988_CR44","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1080\/0305215X.2019.1577407","volume":"52","author":"C Zeng","year":"2020","unstructured":"Zeng C, Tang J, Fan Z, Yan C (2020) Scheduling of a job-shop problem with limited output buffers. Eng Optim 52(1):53\u201373","journal-title":"Eng Optim"},{"issue":"10","key":"10988_CR45","doi-asserted-by":"publisher","first-page":"1646","DOI":"10.1080\/0305215X.2021.1949007","volume":"54","author":"H Zhang","year":"2022","unstructured":"Zhang H, Xu G, Pan R, Ge H (2022) A novel heuristic method for the energy-efficient flexible job-shop scheduling problem with sequence-dependent set-up and transportation time. Eng Optim 54(10):1646\u20131667","journal-title":"Eng Optim"},{"key":"10988_CR46","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.cie.2023.109718","volume":"186","author":"M Zhang","year":"2023","unstructured":"Zhang M, Wang L, Qiu F, Liu X (2023) Dynamic scheduling for flexible job shop with insufficient transportation resources via graph neural network and deep reinforcement learning. Comput Ind Eng 186:1\u201317","journal-title":"Comput Ind Eng"},{"key":"10988_CR47","doi-asserted-by":"publisher","DOI":"10.1016\/j.autcon.2022.104699","volume":"146","author":"J Zhang","year":"2023","unstructured":"Zhang J, Yang X, Wang W, Guan J, Ding L, Vincent CSL (2023) Automated guided vehicles and autonomous mobile robots for recognition and tracking in civil engineering. Autom Constr 146:104699","journal-title":"Autom Constr"},{"key":"10988_CR48","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.engappai.2021.104503","volume":"106","author":"Q Zheng","year":"2021","unstructured":"Zheng Q, Zhang Y, Tian H, He L (2021) An effective hybrid meta-heuristic for flexible flow shop scheduling with limited buffers and step-deteriorating jobs. Eng Appl Artif Intell 106:1\u201314","journal-title":"Eng Appl Artif Intell"},{"key":"10988_CR49","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2022.109759","volume":"131","author":"B Zhou","year":"2022","unstructured":"Zhou B, Bian J (2022) A bi-objective salp swarm algorithm with sine cosine operator for resource constrained multi-manned disassembly line balancing problem. Appl Soft Comput 131:109759","journal-title":"Appl Soft Comput"},{"key":"10988_CR50","doi-asserted-by":"publisher","first-page":"16717","DOI":"10.1007\/s00500-023-09016-9","volume":"27","author":"B Zhou","year":"2023","unstructured":"Zhou B, Zhang J (2023) An improved bi-objective salp swarm algorithm based on decomposition for green scheduling in flexible manufacturing cellular environments with multiple automated guided vehicles. Soft Comput 27:16717\u201316740","journal-title":"Soft Comput"},{"key":"10988_CR51","doi-asserted-by":"publisher","first-page":"544","DOI":"10.1016\/j.matcom.2023.12.037","volume":"219","author":"H Zhang","year":"2024","unstructured":"Zhang H, Qin X, Gao X, Zhang S, Tian Y, Zhang W (2024) Improved salp swarm algorithm based on Newton interpolation and cosine opposition-based learning for feature selection. Math Comput Simul 219:544\u2013558","journal-title":"Math Comput Simul"},{"key":"10988_CR52","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2023.123011","volume":"245","author":"B Zhang","year":"2024","unstructured":"Zhang B, Che A, Wang Y (2024) Grid-based artificial bee colony algorithm for multi-objective job shop scheduling with manual loading and unloading tasks. Expert Syst Appl 245:123011","journal-title":"Expert Syst Appl"},{"key":"10988_CR53","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2024.110484","volume":"196","author":"Z Zhang","year":"2024","unstructured":"Zhang Z, Fu Y, Gao K, Pan Q, Huang M (2024) A learning-driven multi-objective cooperative artificial bee colony algorithm for distributed flexible job shop scheduling problems with preventive maintenance and transportation operations. Comput Ind Eng 196:110484","journal-title":"Comput Ind Eng"},{"key":"10988_CR54","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2024.101834","volume":"93","author":"B Zhang","year":"2025","unstructured":"Zhang B, Che A (2025) An enhanced decomposition-based multi-objective evolutionary algorithm with neighborhood search for multi-resource constrained job shop scheduling problem. Swarm Evol Comput 93:101834","journal-title":"Swarm Evol Comput"},{"key":"10988_CR55","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2025.101885","volume":"94","author":"X Zhou","year":"2025","unstructured":"Zhou X, Wang F, Wu B, Li Y, Shen N (2025) Deep reinforcement learning-based memetic algorithm for solving dynamic distributed green flexible job shop scheduling problem with finite transportation resources. Swarm Evol Comput 94:101885","journal-title":"Swarm Evol Comput"},{"key":"10988_CR56","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2025.101945","volume":"96","author":"S Zhao","year":"2025","unstructured":"Zhao S, Zhou H (2025) Learning-driven memetic algorithm for solving integrated distributed production and transportation scheduling problem. Swarm Evol Comput 96:101945","journal-title":"Swarm Evol Comput"}],"container-title":["Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-025-10988-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00500-025-10988-z","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-025-10988-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,30]],"date-time":"2026-01-30T17:03:47Z","timestamp":1769792627000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00500-025-10988-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,12,20]]},"references-count":56,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2026,1]]}},"alternative-id":["10988"],"URL":"https:\/\/doi.org\/10.1007\/s00500-025-10988-z","relation":{},"ISSN":["1432-7643","1433-7479"],"issn-type":[{"value":"1432-7643","type":"print"},{"value":"1433-7479","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,12,20]]},"assertion":[{"value":"29 March 2024","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":"20 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":"I do hereby declare that I do not have any conflicts of interest with other works. The authors do hereby declare that there is no conflict of interest with other works regarding the publication of this paper.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflicts of interest"}},{"value":"This article does not contain any studies with human participants or animals performed by any authors.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Human and animal rights"}}]}}