{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,4]],"date-time":"2026-07-04T21:16:23Z","timestamp":1783199783807,"version":"3.54.6"},"reference-count":34,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T00:00:00Z","timestamp":1777593600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T00:00:00Z","timestamp":1777593600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T00:00:00Z","timestamp":1777593600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T00:00:00Z","timestamp":1777593600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T00:00:00Z","timestamp":1777593600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T00:00:00Z","timestamp":1777593600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T00:00:00Z","timestamp":1777593600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100005047","name":"Liaoning Provincial Natural Science Foundation","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100005047","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100019033","name":"Key Research and Development Program of Liaoning Province","doi-asserted-by":"publisher","award":["2025080041-JH2\/1028"],"award-info":[{"award-number":["2025080041-JH2\/1028"]}],"id":[{"id":"10.13039\/501100019033","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100013804","name":"Fundamental Research Funds for the Central Universities","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100013804","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100017683","name":"Dalian Science and Technology Innovation Fund","doi-asserted-by":"publisher","award":["2025JJ12CG028"],"award-info":[{"award-number":["2025JJ12CG028"]}],"id":[{"id":"10.13039\/501100017683","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012226","name":"Fundamental Research Funds for the Central Universities","doi-asserted-by":"publisher","award":["DUT25YG235"],"award-info":[{"award-number":["DUT25YG235"]}],"id":[{"id":"10.13039\/501100012226","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Swarm and Evolutionary Computation"],"published-print":{"date-parts":[[2026,5]]},"DOI":"10.1016\/j.swevo.2026.102390","type":"journal-article","created":{"date-parts":[[2026,4,21]],"date-time":"2026-04-21T03:16:24Z","timestamp":1776741384000},"page":"102390","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":1,"special_numbering":"C","title":["Mamba-CrossAttention: Solving Flexible Job Shop Scheduling via sequence modeling and reinforcement learning"],"prefix":"10.1016","volume":"105","author":[{"given":"Zhi","family":"Cao","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8434-1181","authenticated-orcid":false,"given":"Cong","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yaoxin","family":"Wu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yaqing","family":"Hou","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8937-1515","authenticated-orcid":false,"given":"Hongwei","family":"Ge","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"issue":"3","key":"10.1016\/j.swevo.2026.102390_b1","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":"2","key":"10.1016\/j.swevo.2026.102390_b2","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":"European J. Oper. Res."},{"key":"10.1016\/j.swevo.2026.102390_b3","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."},{"issue":"10","key":"10.1016\/j.swevo.2026.102390_b4","doi-asserted-by":"crossref","first-page":"3020","DOI":"10.1080\/00207543.2018.1524165","article-title":"A heuristic model for dynamic flexible job shop scheduling problem considering variable processing times","volume":"57","author":"Shahgholi Zadeh","year":"2019","journal-title":"Int. J. Prod. Res."},{"key":"10.1016\/j.swevo.2026.102390_b5","series-title":"Latin American Symposium on Theoretical Informatics","first-page":"68","article-title":"Approximation algorithms for flexible job shop problems","author":"Jansen","year":"2000"},{"key":"10.1016\/j.swevo.2026.102390_b6","first-page":"1621","article-title":"Learning to dispatch for job shop scheduling via deep reinforcement learning","volume":"33","author":"Zhang","year":"2020","journal-title":"Adv. Neural Inf. Process. Syst."},{"key":"10.1016\/j.swevo.2026.102390_b7","unstructured":"C. Zhang, Z. Cao, W. Song, Y. Wu, J. Zhang, Deep Reinforcement Learning Guided Improvement Heuristic for Job Shop Scheduling, in: The Twelfth International Conference on Learning Representations, 2024."},{"key":"10.1016\/j.swevo.2026.102390_b8","series-title":"Uncertainty in Artificial Intelligence","first-page":"4192","article-title":"Learning topological representations with bidirectional graph attention network for solving job shop scheduling problem","author":"Zhang","year":"2024"},{"issue":"11","key":"10.1016\/j.swevo.2026.102390_b9","doi-asserted-by":"crossref","first-page":"3360","DOI":"10.1080\/00207543.2020.1870013","article-title":"Learning to schedule job-shop problems: representation and policy learning using graph neural network and reinforcement learning","volume":"59","author":"Park","year":"2021","journal-title":"Int. J. Prod. Res."},{"issue":"2","key":"10.1016\/j.swevo.2026.102390_b10","doi-asserted-by":"crossref","first-page":"1600","DOI":"10.1109\/TII.2022.3189725","article-title":"Flexible job-shop scheduling via graph neural network and deep reinforcement learning","volume":"19","author":"Song","year":"2023","journal-title":"IEEE Trans. Ind. Informatics"},{"issue":"3","key":"10.1016\/j.swevo.2026.102390_b11","doi-asserted-by":"crossref","first-page":"3091","DOI":"10.1109\/TNNLS.2023.3306421","article-title":"Flexible job shop scheduling via dual attention network-based reinforcement learning","volume":"35","author":"Wang","year":"2024","journal-title":"IEEE Trans. Neural Networks Learn. Syst."},{"key":"10.1016\/j.swevo.2026.102390_b12","series-title":"A survey on oversmoothing in graph neural networks","author":"Rusch","year":"2023"},{"key":"10.1016\/j.swevo.2026.102390_b13","series-title":"Mamba: Linear-time sequence modeling with selective state spaces","author":"Gu","year":"2023"},{"issue":"13","key":"10.1016\/j.swevo.2026.102390_b14","doi-asserted-by":"crossref","first-page":"2519","DOI":"10.1016\/j.ifacol.2019.11.585","article-title":"An efficient two-stage genetic algorithm for flexible job-shop scheduling","volume":"52","author":"Rooyani","year":"2019","journal-title":"Ifac-Papersonline"},{"key":"10.1016\/j.swevo.2026.102390_b15","doi-asserted-by":"crossref","DOI":"10.1016\/j.cor.2020.104951","article-title":"Improved particle swarm optimization algorithm based novel encoding and decoding schemes for flexible job shop scheduling problem","volume":"121","author":"Ding","year":"2020","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/j.swevo.2026.102390_b16","doi-asserted-by":"crossref","DOI":"10.1016\/j.asoc.2025.113128","article-title":"Optimizing the flexible job shop scheduling problem via deep reinforcement learning with mean multichannel graph attention","author":"Huang","year":"2025","journal-title":"Appl. Soft Comput."},{"key":"10.1016\/j.swevo.2026.102390_b17","doi-asserted-by":"crossref","DOI":"10.1016\/j.cor.2025.107139","article-title":"Flexible job shop scheduling problem using graph neural networks and reinforcement learning","author":"Liu","year":"2025","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/j.swevo.2026.102390_b18","doi-asserted-by":"crossref","DOI":"10.1016\/j.cie.2024.110768","article-title":"A deep reinforcement learning method based on a multiexpert graph neural network for flexible job shop scheduling","volume":"200","author":"Huang","year":"2025","journal-title":"Comput. Ind. Eng."},{"key":"10.1016\/j.swevo.2026.102390_b19","doi-asserted-by":"crossref","DOI":"10.1016\/j.knosys.2024.111940","article-title":"Flexible job shop scheduling via deep reinforcement learning with meta-path-based heterogeneous graph neural network","volume":"296","author":"Wan","year":"2024","journal-title":"Knowl.-Based Syst."},{"key":"10.1016\/j.swevo.2026.102390_b20","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."},{"issue":"18","key":"10.1016\/j.swevo.2026.102390_b21","doi-asserted-by":"crossref","first-page":"3696","DOI":"10.3390\/electronics13183696","article-title":"A deep reinforcement learning method based on a transformer model for the flexible job shop scheduling problem","volume":"13","author":"Xu","year":"2024","journal-title":"Electronics"},{"key":"10.1016\/j.swevo.2026.102390_b22","series-title":"International Conference on Machine Learning","first-page":"62429","article-title":"Vision mamba: Efficient visual representation learning with bidirectional state space model","author":"Zhu","year":"2024"},{"key":"10.1016\/j.swevo.2026.102390_b23","doi-asserted-by":"crossref","DOI":"10.1016\/j.neucom.2024.129178","article-title":"Is mamba effective for time series forecasting?","volume":"619","author":"Wang","year":"2025","journal-title":"Neurocomputing"},{"issue":"3","key":"10.1016\/j.swevo.2026.102390_b24","doi-asserted-by":"crossref","first-page":"155","DOI":"10.3390\/systems13030155","article-title":"Combining MAMBA and attention-based neural network for electric ground-handling vehicles scheduling","volume":"13","author":"Li","year":"2025","journal-title":"Systems"},{"key":"10.1016\/j.swevo.2026.102390_b25","series-title":"Gaussian error linear units (gelus)","author":"Hendrycks","year":"2016"},{"key":"10.1016\/j.swevo.2026.102390_b26","article-title":"Flexible job shop scheduling by tabu search","author":"Barnes","year":"1996"},{"key":"10.1016\/j.swevo.2026.102390_b27","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."},{"key":"10.1016\/j.swevo.2026.102390_b28","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":"Operations-Research-Spektrum"},{"key":"10.1016\/j.swevo.2026.102390_b29","series-title":"OR-tools","author":"Perron","year":"2019"},{"key":"10.1016\/j.swevo.2026.102390_b30","doi-asserted-by":"crossref","DOI":"10.1016\/j.asoc.2023.110436","article-title":"Solving job shop scheduling problems via deep reinforcement learning","volume":"143","author":"Yuan","year":"2023","journal-title":"Appl. Soft Comput."},{"key":"10.1016\/j.swevo.2026.102390_b31","doi-asserted-by":"crossref","first-page":"105528","DOI":"10.52202\/079017-3349","article-title":"Self-labeling the job shop scheduling problem","volume":"37","author":"Corsini","year":"2024","journal-title":"Adv. Neural Inf. Process. Syst."},{"issue":"2","key":"10.1016\/j.swevo.2026.102390_b32","doi-asserted-by":"crossref","first-page":"278","DOI":"10.1016\/0377-2217(93)90182-M","article-title":"Benchmarks for basic scheduling problems","volume":"64","author":"Taillard","year":"1993","journal-title":"European J. Oper. Res."},{"issue":"1","key":"10.1016\/j.swevo.2026.102390_b33","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1016\/S0377-2217(97)00019-2","article-title":"Benchmarks for shop scheduling problems","volume":"109","author":"Demirkol","year":"1998","journal-title":"European J. Oper. Res."},{"issue":"8","key":"10.1016\/j.swevo.2026.102390_b34","doi-asserted-by":"crossref","first-page":"1949","DOI":"10.1007\/s10845-020-01547-4","article-title":"A research survey: heuristic approaches for solving multi objective flexible job shop problems","volume":"31","author":"T\u00fcrky\u0131lmaz","year":"2020","journal-title":"J. Intell. Manuf."}],"container-title":["Swarm and Evolutionary Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S2210650226001100?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S2210650226001100?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,7,4]],"date-time":"2026-07-04T20:37:59Z","timestamp":1783197479000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S2210650226001100"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,5]]},"references-count":34,"alternative-id":["S2210650226001100"],"URL":"https:\/\/doi.org\/10.1016\/j.swevo.2026.102390","relation":{},"ISSN":["2210-6502"],"issn-type":[{"value":"2210-6502","type":"print"}],"subject":[],"published":{"date-parts":[[2026,5]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Mamba-CrossAttention: Solving Flexible Job Shop Scheduling via sequence modeling and reinforcement learning","name":"articletitle","label":"Article Title"},{"value":"Swarm and Evolutionary Computation","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.swevo.2026.102390","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":"102390"}}