{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,3]],"date-time":"2026-07-03T14:21:53Z","timestamp":1783088513976,"version":"3.54.6"},"reference-count":60,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100004731","name":"Zhejiang Province Natural Science Foundation","doi-asserted-by":"publisher","award":["LY22F020019"],"award-info":[{"award-number":["LY22F020019"]}],"id":[{"id":"10.13039\/501100004731","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61101111"],"award-info":[{"award-number":["61101111"]}],"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":["62132014"],"award-info":[{"award-number":["62132014"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100017599","name":"Science and Technology Program of Zhejiang Province","doi-asserted-by":"publisher","award":["2022C01045"],"award-info":[{"award-number":["2022C01045"]}],"id":[{"id":"10.13039\/501100017599","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Applied Soft Computing"],"published-print":{"date-parts":[[2026,7]]},"DOI":"10.1016\/j.asoc.2026.115296","type":"journal-article","created":{"date-parts":[[2026,4,20]],"date-time":"2026-04-20T15:05:35Z","timestamp":1776697535000},"page":"115296","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Hybrid discrete PSO with reinforcement learning for flexible job shop scheduling"],"prefix":"10.1016","volume":"198","author":[{"ORCID":"https:\/\/orcid.org\/0009-0003-8487-146X","authenticated-orcid":false,"given":"Junjun","family":"Chen","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5222-7608","authenticated-orcid":false,"given":"Ting","family":"Shu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8455-0840","authenticated-orcid":false,"given":"Xuesong","family":"Yin","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jinsong","family":"xia","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"issue":"2","key":"10.1016\/j.asoc.2026.115296_bib0005","doi-asserted-by":"crossref","first-page":"409","DOI":"10.1016\/j.ejor.2023.05.017","article-title":"The flexible job shop scheduling problem: a review","volume":"314","author":"Dauz\u00e8re-P\u00e9r\u00e8s","year":"2024","journal-title":"Eur. J. Oper. Res."},{"issue":"4","key":"10.1016\/j.asoc.2026.115296_bib0010","doi-asserted-by":"crossref","first-page":"904","DOI":"10.1109\/JAS.2019.1911540","article-title":"A review on swarm intelligence and evolutionary algorithms for solving flexible job shop scheduling problems","volume":"6","author":"Gao","year":"2019","journal-title":"IEEE\/CAA J. Autom. Sin."},{"key":"10.1016\/j.asoc.2026.115296_bib0015","doi-asserted-by":"crossref","DOI":"10.1016\/j.eswa.2023.123019","article-title":"Solving flexible job shop scheduling problems via deep reinforcement learning","volume":"245","author":"Yuan","year":"2024","journal-title":"Expert Syst. Appl."},{"key":"10.1016\/j.asoc.2026.115296_bib0020","first-page":"110","article-title":"Mixed-integer programming and constraint programming models for the flexible job shop scheduling problem","author":"Fekih","year":"2023","journal-title":"Artificial Intelligence and Industrial Applications"},{"issue":"1","key":"10.1016\/j.asoc.2026.115296_bib0025","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1016\/j.ejor.2020.04.017","article-title":"A meta-heuristic to solve the just-in-time job-shop scheduling problem","volume":"288","author":"Ahmadian","year":"2021","journal-title":"Eur. J. Oper. Res."},{"key":"10.1016\/j.asoc.2026.115296_bib0030","doi-asserted-by":"crossref","DOI":"10.1016\/j.cie.2020.106347","article-title":"Mixed-integer linear programming and constraint programming formulations for solving distributed flexible job shop scheduling problem","volume":"142","author":"Meng","year":"2020","journal-title":"Comput. Ind. Eng."},{"issue":"13","key":"10.1016\/j.asoc.2026.115296_bib0035","first-page":"2519","article-title":"An efficient two-stage genetic algorithm for flexible job shop scheduling","volume":"52","author":"Rooyani","year":"2019","journal-title":"Ifac-pap."},{"issue":"1","key":"10.1016\/j.asoc.2026.115296_bib0040","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1007\/s11063-024-11488-1","article-title":"Research on solving flexible job shop scheduling problem based on improved GWO algorithm","volume":"56","author":"Zhou","year":"2024","journal-title":"Neural Process. Lett."},{"issue":"3","key":"10.1016\/j.asoc.2026.115296_bib0045","doi-asserted-by":"crossref","first-page":"603","DOI":"10.1007\/s10845-015-1039-3","article-title":"An effective and distributed particle swarm optimization algorithm for flexible job-shop scheduling problem","volume":"29","author":"Nouiri","year":"2018","journal-title":"J. Intell. Manuf."},{"key":"10.1016\/j.asoc.2026.115296_bib0050","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1016\/j.procs.2015.12.060","article-title":"Towards an embedded distributed implementations of PSO solutions for the flexible job shop problem","volume":"73","author":"Zarrouk","year":"2015","journal-title":"Procedia Comput. Sci."},{"key":"10.1016\/j.asoc.2026.115296_bib0055","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1016\/j.neucom.2020.07.004","article-title":"Hybrid of human learning optimization algorithm and particle swarm optimization algorithm with scheduling strategies for the flexible job-shop scheduling problem","volume":"414","author":"Ding","year":"2020","journal-title":"Neurocomputing"},{"key":"10.1016\/j.asoc.2026.115296_bib0060","series-title":"Failure Analysis of Paints and Coatings","author":"Weldon","year":"2009"},{"key":"10.1016\/j.asoc.2026.115296_bib0065","doi-asserted-by":"crossref","DOI":"10.1016\/j.eswa.2024.123970","article-title":"Deep reinforcement learning for dynamic distributed job shop scheduling problem with transfers","volume":"251","author":"Lei","year":"2024","journal-title":"Expert Syst. Appl."},{"key":"10.1016\/j.asoc.2026.115296_bib0070","first-page":"1","article-title":"An effective deep actor-critic reinforcement learning method for solving the flexible job shop scheduling problem","author":"Wan","year":"2024","journal-title":"Neural Comput. Appl."},{"issue":"5","key":"10.1016\/j.asoc.2026.115296_bib0075","doi-asserted-by":"crossref","first-page":"1707","DOI":"10.1109\/TEVC.2024.3443913","article-title":"Bridging evolutionary algorithms and reinforcement learning: a comprehensive survey on hybrid algorithms","volume":"29","author":"Li","year":"2025","journal-title":"IEEE Trans. Evol. Comput."},{"key":"10.1016\/j.asoc.2026.115296_bib0080","series-title":"Advanced Intelligent Computing Technology and Applications","first-page":"288","article-title":"Improved particle swarm optimization algorithm combined with reinforcement learning for solving flexible job shop scheduling problem","author":"Gao","year":"2023"},{"key":"10.1016\/j.asoc.2026.115296_bib0085","doi-asserted-by":"crossref","DOI":"10.1016\/j.cie.2020.106778","article-title":"A self-learning genetic algorithm based on reinforcement learning for flexible job-shop scheduling problem","volume":"149","author":"Chen","year":"2020","journal-title":"Comput. Ind. Eng."},{"key":"10.1016\/j.asoc.2026.115296_bib0090","doi-asserted-by":"crossref","first-page":"362","DOI":"10.1016\/j.ins.2022.06.078","article-title":"A deep reinforcement learning based hybrid algorithm for efficient resource scheduling in edge computing environment","volume":"608","author":"Xue","year":"2022","journal-title":"Inf. Sci."},{"issue":"3","key":"10.1016\/j.asoc.2026.115296_bib0095","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1007\/BF02023073","article-title":"Routing and scheduling in a flexible job shop by Tabu Search","volume":"41","author":"Brandimarte","year":"1993","journal-title":"Ann. Oper. Res."},{"issue":"4","key":"10.1016\/j.asoc.2026.115296_bib0100","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1007\/BF01719451","article-title":"Tabu search for the job-shop scheduling problem with multi-purpose machines","volume":"15","author":"Hurink","year":"1994","journal-title":"OR Spektrum"},{"key":"10.1016\/j.asoc.2026.115296_bib0105","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1023\/A:1018930406487","article-title":"An integrated approach for modeling and solving the general multiprocessor job-shop scheduling problem using tabu search","volume":"70","author":"Dauz\u00e8re-P\u00e9r\u00e8s","year":"1997","journal-title":"Ann. Oper. Res."},{"issue":"2","key":"10.1016\/j.asoc.2026.115296_bib0110","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1080\/07408179508936739","article-title":"Solving the job shop scheduling problem with tabu search","volume":"27","author":"Barnes","year":"1995","journal-title":"IIE Trans."},{"issue":"14","key":"10.1016\/j.asoc.2026.115296_bib0115","doi-asserted-by":"crossref","first-page":"3245","DOI":"10.1080\/00207540600786715","article-title":"Using dispatching rules for job shop scheduling with due date-based objectives","volume":"45","author":"Chiang","year":"2007","journal-title":"Int. J. Prod. Res."},{"issue":"6","key":"10.1016\/j.asoc.2026.115296_bib0120","doi-asserted-by":"crossref","first-page":"1459","DOI":"10.1080\/00207548608919815","article-title":"A MILP model for the n-job, m-stage flowshop with sequence dependent set-up times","volume":"24","author":"Srikar","year":"1986","journal-title":"Int. J. Prod. Res."},{"issue":"4","key":"10.1016\/j.asoc.2026.115296_bib0125","doi-asserted-by":"crossref","first-page":"417","DOI":"10.1504\/IJCAET.2022.123989","article-title":"Development of a priority dispatching rule and novel production scheduling algorithm for a job shop","volume":"16","author":"Narassima","year":"2022","journal-title":"International Journal of Computer Aided Engineering and Technology"},{"issue":"12","key":"10.1016\/j.asoc.2026.115296_bib0130","doi-asserted-by":"crossref","first-page":"3748","DOI":"10.1080\/00207543.2013.765074","article-title":"A priority scheduling approach for flexible job shops with multiple process plans","volume":"51","author":"Doh","year":"2013","journal-title":"Int. J. Prod. Res."},{"key":"10.1016\/j.asoc.2026.115296_bib0135","doi-asserted-by":"crossref","DOI":"10.1016\/j.swevo.2024.101670","article-title":"A hybrid genetic tabu search algorithm for distributed job-shop scheduling problems","volume":"90","author":"Xie","year":"2024","journal-title":"Swarm Evol. Comput."},{"issue":"3","key":"10.1016\/j.asoc.2026.115296_bib0140","doi-asserted-by":"crossref","first-page":"888","DOI":"10.1016\/j.asoc.2009.10.006","article-title":"A knowledge-based ant colony optimization for flexible job shop scheduling problems","volume":"10","author":"Xing","year":"2010","journal-title":"Appl. Soft Comput."},{"key":"10.1016\/j.asoc.2026.115296_bib0145","doi-asserted-by":"crossref","DOI":"10.1016\/j.cie.2020.106778","article-title":"A self-learning genetic algorithm based on reinforcement learning for flexible job-shop scheduling problem","volume":"149","author":"Chen","year":"2020","journal-title":"Comput. Ind. Eng."},{"key":"10.1016\/j.asoc.2026.115296_bib0150","doi-asserted-by":"crossref","first-page":"334","DOI":"10.1016\/j.jmsy.2024.02.007","article-title":"Hybrid quantum particle swarm optimization and variable neighborhood search for flexible job-shop scheduling problem","volume":"73","author":"Xu","year":"2024","journal-title":"J. Manuf. Syst."},{"key":"10.1016\/j.asoc.2026.115296_bib0155","doi-asserted-by":"crossref","DOI":"10.1016\/j.swevo.2024.101538","article-title":"A dual population collaborative genetic algorithm for solving flexible job shop scheduling problem with AGV","volume":"86","author":"Han","year":"2024","journal-title":"Swarm Evol. Comput."},{"key":"10.1016\/j.asoc.2026.115296_bib0160","doi-asserted-by":"crossref","first-page":"178","DOI":"10.1016\/j.cie.2018.08.022","article-title":"A new approach to solve the flexible job shop problem based on a hybrid particle swarm optimization and random-restart hill climbing","volume":"125","author":"Kato","year":"2018","journal-title":"Computers and Industrial Engineering"},{"key":"10.1016\/j.asoc.2026.115296_bib0165","doi-asserted-by":"crossref","DOI":"10.1016\/j.eswa.2022.117796","article-title":"A multi-action deep reinforcement learning framework for flexible job-shop scheduling problem","volume":"205","author":"Lei","year":"2022","journal-title":"Expert Syst. Appl."},{"issue":"3","key":"10.1016\/j.asoc.2026.115296_bib0170","first-page":"1420","article-title":"A reinforcement learning approach to robust scheduling of semiconductor manufacturing facilities","volume":"17","author":"Park","year":"2020","journal-title":"IEEE Trans. Autom. Sci. Eng."},{"issue":"4","key":"10.1016\/j.asoc.2026.115296_bib0175","doi-asserted-by":"crossref","first-page":"760","DOI":"10.3390\/pr10040760","article-title":"Deep reinforcement learning for dynamic flexible job shop scheduling with random job arrival","volume":"10","author":"Chang","year":"2022","journal-title":"Processes"},{"issue":"20","key":"10.1016\/j.asoc.2026.115296_bib0180","doi-asserted-by":"crossref","first-page":"11877","DOI":"10.1007\/s00521-024-09654-6","article-title":"An effective deep actor-critic reinforcement learning method for solving the flexible job shop scheduling problem","volume":"36","author":"Wan","year":"2024","journal-title":"Neural Comput. Appl."},{"issue":"1","key":"10.1016\/j.asoc.2026.115296_bib0185","doi-asserted-by":"crossref","first-page":"1007","DOI":"10.1109\/TII.2023.3272661","article-title":"Large-Scale dynamic scheduling for flexible Job-Shop with random arrivals of new jobs by hierarchical reinforcement learning","volume":"20","author":"Lei","year":"2024","journal-title":"IEEE Trans. Ind. Inform."},{"key":"10.1016\/j.asoc.2026.115296_bib0190","doi-asserted-by":"crossref","first-page":"1211","DOI":"10.1016\/j.ins.2022.06.017","article-title":"A graph neural networks-based deep q-learning approach for job shop scheduling problems in traffic management","volume":"607","author":"Liu","year":"2022","journal-title":"Inf. Sci."},{"issue":"3","key":"10.1016\/j.asoc.2026.115296_bib0195","doi-asserted-by":"crossref","first-page":"422","DOI":"10.1109\/TSUSC.2023.3303898","article-title":"A deep reinforcement Learning-Based preemptive approach for Cost-Aware cloud job scheduling","volume":"9","author":"Cheng","year":"2024","journal-title":"IEEE Trans. Sustain. Comput."},{"key":"10.1016\/j.asoc.2026.115296_bib0200","doi-asserted-by":"crossref","DOI":"10.1016\/j.eswa.2023.121723","article-title":"A dql-nsga-iii algorithm for solving the flexible job shop dynamic scheduling problem","volume":"237","author":"Tang","year":"2024","journal-title":"Expert Syst. Appl."},{"key":"10.1016\/j.asoc.2026.115296_bib0205","doi-asserted-by":"crossref","DOI":"10.1016\/j.asoc.2023.110658","article-title":"A reinforcement learning-artificial bee colony algorithm for flexible job-shop scheduling problem with lot streaming","volume":"146","author":"Li","year":"2023","journal-title":"Appl. Soft Comput."},{"key":"10.1016\/j.asoc.2026.115296_bib0210","author":"Schulman"},{"key":"10.1016\/j.asoc.2026.115296_bib0215","doi-asserted-by":"crossref","DOI":"10.1016\/j.cie.2024.110633","article-title":"Probing an LSTM-PPO-based reinforcement learning algorithm to solve dynamic job shop scheduling problem","volume":"197","author":"Chen","year":"2024","journal-title":"Comput. Ind. Eng."},{"issue":"1","key":"10.1016\/j.asoc.2026.115296_bib0220","doi-asserted-by":"crossref","first-page":"252","DOI":"10.1016\/j.compeleceng.2013.11.023","article-title":"Distributed job scheduling based on swarm intelligence: a survey","volume":"40","author":"Pacini","year":"2014","journal-title":"Computers & Electrical Engineering"},{"issue":"1","key":"10.1016\/j.asoc.2026.115296_bib0225","article-title":"A study of deep learning neural network algorithms and genetic algorithms for fjsp","volume":"2023","author":"Shang","year":"2023","journal-title":"J. Appl. Math."},{"issue":"1","key":"10.1016\/j.asoc.2026.115296_bib0230","doi-asserted-by":"crossref","first-page":"931","DOI":"10.1007\/s10586-023-03994-z","article-title":"Dual interactive Wasserstein generative adversarial network optimized with arithmetic optimization algorithm-based job scheduling in cloud-based IOT","volume":"27","author":"Sravanthi","year":"2024","journal-title":"Clust. Comput."},{"key":"10.1016\/j.asoc.2026.115296_bib0235","series-title":"The Weighted Tardiness as Objective Function of a RNN Model for the Job Scheduling Problem","first-page":"15","author":"Tselios","year":"2012"},{"issue":"3","key":"10.1016\/j.asoc.2026.115296_bib0240","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1049\/iet-cim.2018.0009","article-title":"Review on flexible job shop scheduling","volume":"1","author":"Xie","year":"2019","journal-title":"IET collaborative intelligent manufacturing"},{"issue":"3","key":"10.1016\/j.asoc.2026.115296_bib0245","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1007\/s10845-007-0026-8","article-title":"Mathematical modeling and heuristic approaches to flexible job shop scheduling problems","volume":"18","author":"Fattahi","year":"2007","journal-title":"J. Intell. Manuf."},{"key":"10.1016\/j.asoc.2026.115296_bib0250","doi-asserted-by":"crossref","DOI":"10.1016\/j.cor.2023.106401","article-title":"A spatial pyramid pooling-based deep reinforcement learning model for dynamic job-shop scheduling problem","volume":"160","author":"Wu","year":"2023","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/j.asoc.2026.115296_bib0255","doi-asserted-by":"crossref","DOI":"10.1016\/j.ijpe.2021.108342","article-title":"A genetic programming learning approach to generate dispatching rules for flexible shop scheduling problems","volume":"243","author":"Braune","year":"2022","journal-title":"Int. J. Prod. Econ."},{"key":"10.1016\/j.asoc.2026.115296_bib0260","series-title":"Scheduling: Theory, Algorithms, and Systems","author":"Pinedo","year":"2016"},{"issue":"3","key":"10.1016\/j.asoc.2026.115296_bib0265","doi-asserted-by":"crossref","first-page":"1140","DOI":"10.1016\/j.ejor.2022.09.006","article-title":"A hybrid particle swarm optimization and simulated annealing algorithm for the job shop scheduling problem with transport resources","volume":"306","author":"Fontes","year":"2023","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"10.1016\/j.asoc.2026.115296_bib0270","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1287\/opre.25.1.45","article-title":"A survey of scheduling rules","volume":"25","author":"Panwalkar","year":"1977","journal-title":"Oper. Res."},{"key":"10.1016\/j.asoc.2026.115296_bib0275","doi-asserted-by":"crossref","DOI":"10.1016\/j.eswa.2022.119474","article-title":"A multi-agent system for Fjsp with setup and transportation times","volume":"216","author":"Pal","year":"2023","journal-title":"Expert Syst. Appl."},{"key":"10.1016\/j.asoc.2026.115296_bib0280","doi-asserted-by":"crossref","DOI":"10.1016\/j.asoc.2021.108084","article-title":"A hybrid approach for forecasting ship motion using cnn\u2013gru\u2013am and gcwoa","volume":"114","author":"Li","year":"2022","journal-title":"Appl. Soft Comput."},{"issue":"4","key":"10.1016\/j.asoc.2026.115296_bib0285","doi-asserted-by":"crossref","first-page":"983","DOI":"10.1109\/TETCI.2021.3098354","article-title":"Deep reinforcement learning based optimization algorithm for permutation flow-shop scheduling","volume":"7","author":"Pan","year":"2023","journal-title":"IEEE Trans. Emerg. Top. Comput. Intell."},{"key":"10.1016\/j.asoc.2026.115296_bib0290","doi-asserted-by":"crossref","DOI":"10.1016\/j.cie.2019.106064","article-title":"Solving the flexible job shop scheduling problem using an improved jaya algorithm","volume":"137","author":"Caldeira","year":"2019","journal-title":"Comput. Ind. Eng."},{"issue":"1","key":"10.1016\/j.asoc.2026.115296_bib0295","doi-asserted-by":"crossref","first-page":"216","DOI":"10.1016\/j.cie.2008.05.007","article-title":"A discrete particle swarm optimization algorithm for scheduling parallel machines","volume":"56","author":"Kashan","year":"2009","journal-title":"Comput. Ind. Eng."},{"key":"10.1016\/j.asoc.2026.115296_bib0300","doi-asserted-by":"crossref","DOI":"10.1016\/j.eswa.2025.129514","article-title":"Evomapx: an explainable framework for metaheuristic optimization algorithms","volume":"298","author":"Abed-Alguni","year":"2026","journal-title":"Expert Syst. Appl."}],"container-title":["Applied Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1568494626007441?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1568494626007441?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,7,3]],"date-time":"2026-07-03T13:40:54Z","timestamp":1783086054000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1568494626007441"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,7]]},"references-count":60,"alternative-id":["S1568494626007441"],"URL":"https:\/\/doi.org\/10.1016\/j.asoc.2026.115296","relation":{},"ISSN":["1568-4946"],"issn-type":[{"value":"1568-4946","type":"print"}],"subject":[],"published":{"date-parts":[[2026,7]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Hybrid discrete PSO with reinforcement learning for flexible job shop scheduling","name":"articletitle","label":"Article Title"},{"value":"Applied Soft Computing","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.asoc.2026.115296","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Elsevier B.V. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"115296"}}