{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,16]],"date-time":"2026-07-16T12:41:08Z","timestamp":1784205668596,"version":"3.55.0"},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"20","license":[{"start":{"date-parts":[[2024,4,18]],"date-time":"2024-04-18T00:00:00Z","timestamp":1713398400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,4,18]],"date-time":"2024-04-18T00:00:00Z","timestamp":1713398400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"name":"Excellent Youth Foundation of Education Bureau of Hunan Province, China","award":["21B0547"],"award-info":[{"award-number":["21B0547"]}]},{"name":"National Natural Science Foundation for Young Scientists of China","award":["61702177"],"award-info":[{"award-number":["61702177"]}]},{"DOI":"10.13039\/501100004735","name":"Hunan Provincial Natural Science Foundation of China","doi-asserted-by":"crossref","award":["2023JJ30217"],"award-info":[{"award-number":["2023JJ30217"]}],"id":[{"id":"10.13039\/501100004735","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Research Foundation of Education Bureau of Hunan Province","award":["21A0356"],"award-info":[{"award-number":["21A0356"]}]},{"name":"Research Foundation of Education Bureau of Hunan Province","award":["22A0408"],"award-info":[{"award-number":["22A0408"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Neural Comput & Applic"],"published-print":{"date-parts":[[2024,7]]},"DOI":"10.1007\/s00521-024-09654-6","type":"journal-article","created":{"date-parts":[[2024,4,18]],"date-time":"2024-04-18T15:01:51Z","timestamp":1713452511000},"page":"11877-11899","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":12,"title":["An effective deep actor-critic reinforcement learning method for solving the flexible job shop scheduling problem"],"prefix":"10.1007","volume":"36","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7236-3589","authenticated-orcid":false,"given":"Lanjun","family":"Wan","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xueyan","family":"Cui","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Haoxin","family":"Zhao","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Changyun","family":"Li","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Zhibing","family":"Wang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2024,4,18]]},"reference":[{"key":"9654_CR1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2022.105731","volume":"142","author":"H Xiong","year":"2022","unstructured":"Xiong H, Shi S, Ren D, Hu J (2022) A survey of job shop scheduling problem: the types and models. Comput Oper Res 142:105731. https:\/\/doi.org\/10.1016\/j.cor.2022.105731","journal-title":"Comput Oper Res"},{"issue":"3","key":"9654_CR2","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1049\/iet-cim.2018.0009","volume":"1","author":"J Xie","year":"2019","unstructured":"Xie J, Gao L, Peng K, Li X, Li H (2019) Review on flexible job shop scheduling. IET Collob Intell Manuf 1(3):67\u201377. https:\/\/doi.org\/10.1049\/iet-cim.2018.0009","journal-title":"IET Collob Intell Manuf"},{"key":"9654_CR3","doi-asserted-by":"publisher","first-page":"555","DOI":"10.1016\/j.eswa.2018.06.053","volume":"113","author":"M Durasevi\u0107","year":"2018","unstructured":"Durasevi\u0107 M, Jakobovi\u0107 D (2018) A survey of dispatching rules for the dynamic unrelated machines environment. Expert Syst Appl 113:555\u2013569. https:\/\/doi.org\/10.1016\/j.eswa.2018.06.053","journal-title":"Expert Syst Appl"},{"issue":"4","key":"9654_CR4","doi-asserted-by":"publisher","first-page":"904","DOI":"10.1109\/JAS.2019.1911540","volume":"6","author":"K Gao","year":"2019","unstructured":"Gao K, Cao Z, Zhang L, Chen Z, Han Y, Pan Q (2019) A review on swarm intelligence and evolutionary algorithms for solving flexible job shop scheduling problems. IEEE\/CAA J Autom Sin 6(4):904\u2013916. https:\/\/doi.org\/10.1109\/JAS.2019.1911540","journal-title":"IEEE\/CAA J Autom Sin"},{"key":"9654_CR5","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2020.100664","volume":"54","author":"G Zhang","year":"2020","unstructured":"Zhang G, Hu Y, Sun J, Zhang W (2020) An improved genetic algorithm for the flexible job shop scheduling problem with multiple time constraints. Swarm Evol Comput 54:100664. https:\/\/doi.org\/10.1016\/j.swevo.2020.100664","journal-title":"Swarm Evol Comput"},{"key":"9654_CR6","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2021.105431","volume":"135","author":"Z Liu","year":"2021","unstructured":"Liu Z, Wang J, Zhang C, Chu H, Ding G, Zhang L (2021) A hybrid genetic-particle swarm algorithm based on multilevel neighbourhood structure for flexible job shop scheduling problem. Comput Oper Res 135:105431. https:\/\/doi.org\/10.1016\/j.cor.2021.105431","journal-title":"Comput Oper Res"},{"key":"9654_CR7","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2022.109783","volume":"131","author":"N Chen","year":"2022","unstructured":"Chen N, Xie N, Wang Y (2022) An elite genetic algorithm for flexible job shop scheduling problem with extracted grey processing time. Appl Soft Comput 131:109783. https:\/\/doi.org\/10.1016\/j.asoc.2022.109783","journal-title":"Appl Soft Comput"},{"key":"9654_CR8","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2020.106605","volume":"147","author":"FM Defersha","year":"2020","unstructured":"Defersha FM, Rooyani D (2020) An efficient two-stage genetic algorithm for a flexible job-shop scheduling problem with sequence dependent attached\/detached setup, machine release date and lag-time. Comput Ind Eng 147:106605. https:\/\/doi.org\/10.1016\/j.cie.2020.106605","journal-title":"Comput Ind Eng"},{"key":"9654_CR9","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2021.107318","volume":"157","author":"W Xu","year":"2021","unstructured":"Xu W, Hu Y, Luo W, Wang L, Wu R (2021) A multi-objective scheduling method for distributed and flexible job shop based on hybrid genetic algorithm and tabu search considering operation outsourcing and carbon emission. Comput Ind Eng 157:107318. https:\/\/doi.org\/10.1016\/j.cie.2021.107318","journal-title":"Comput Ind Eng"},{"key":"9654_CR10","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2020.104951","volume":"121","author":"H Ding","year":"2020","unstructured":"Ding H, Gu X (2020) Improved particle swarm optimization algorithm based novel encoding and decoding schemes for flexible job shop scheduling problem. Comput Oper Res 121:104951. https:\/\/doi.org\/10.1016\/j.cor.2020.104951","journal-title":"Comput Oper Res"},{"key":"9654_CR11","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/s11721-019-00167-w","volume":"13","author":"R Zarrouk","year":"2019","unstructured":"Zarrouk R, Bennour IE, Jemai A (2019) A two-level particle swarm optimization algorithm for the flexible job shop scheduling problem. Swarm Intell 13:145\u2013168. https:\/\/doi.org\/10.1007\/s11721-019-00167-w","journal-title":"Swarm Intell"},{"issue":"4","key":"9654_CR12","doi-asserted-by":"publisher","first-page":"845","DOI":"10.16182\/j.issn1004731x.joss.19-0672","volume":"33","author":"K Chen","year":"2021","unstructured":"Chen K, Bi L (2021) Research on FJSP of improved particle swarm optimization algorithm considering transportation time. J Syst Simul 33(4):845\u2013853. https:\/\/doi.org\/10.16182\/j.issn1004731x.joss.19-0672","journal-title":"J Syst Simul"},{"key":"9654_CR13","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2020.106544","volume":"95","author":"Y Li","year":"2020","unstructured":"Li Y, Huang W, Wu R, Guo K (2020) An improved artificial bee colony algorithm for solving multi-objective low-carbon flexible job shop scheduling problem. Appl Soft Comput 95:106544. https:\/\/doi.org\/10.1016\/j.asoc.2020.106544","journal-title":"Appl Soft Comput"},{"issue":"3","key":"9654_CR14","doi-asserted-by":"publisher","first-page":"524","DOI":"10.1080\/0305215X.2021.1884243","volume":"54","author":"J Sassi","year":"2022","unstructured":"Sassi J, Alaya I, Borne P, Tagina M (2022) A decomposition-based artificial bee colony algorithm for the multi-objective flexible jobshop scheduling problem. Eng Optim 54(3):524\u2013538. https:\/\/doi.org\/10.1080\/0305215X.2021.1884243","journal-title":"Eng Optim"},{"issue":"8","key":"9654_CR15","doi-asserted-by":"publisher","first-page":"618","DOI":"10.3390\/machines10080618","volume":"10","author":"W Yang","year":"2022","unstructured":"Yang W, Su J, Yao Y, Yang Z, Yuan Y (2022) A novel hybrid whale optimization algorithm for flexible job-shop scheduling problem. Machines 10(8):618. https:\/\/doi.org\/10.3390\/machines10080618","journal-title":"Machines"},{"key":"9654_CR16","first-page":"20132","volume":"34","author":"S Fujimoto","year":"2021","unstructured":"Fujimoto S, Gu SS (2021) A minimalist approach to offline reinforcement learning. Adv Neural Inf Process Syst 34:20132\u201320145","journal-title":"Adv Neural Inf Process Syst"},{"key":"9654_CR17","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2021.105400","volume":"134","author":"N Mazyavkina","year":"2021","unstructured":"Mazyavkina N, Sviridov S, Ivanov S, Burnaev E (2021) Reinforcement learning for combinatorial optimization: a survey. Comput Oper Res 134:105400. https:\/\/doi.org\/10.1016\/j.cor.2021.105400","journal-title":"Comput Oper Res"},{"key":"9654_CR18","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2022.109235","volume":"125","author":"Z Zhu","year":"2022","unstructured":"Zhu Z, Zhou X, Cao D, Li M (2022) A shuffled cellular evolutionary grey wolf optimizer for flexible job shop scheduling problem with tree-structure job precedence constraints. Appl Soft Comput 125:109235. https:\/\/doi.org\/10.1016\/j.asoc.2022.109235","journal-title":"Appl Soft Comput"},{"key":"9654_CR19","doi-asserted-by":"publisher","unstructured":"Palacio JC, Jim\u00e9nez YMn, Schietgat L, Van Doninck B, Now\u00e9 A (2022) A Q-learning algorithm for flexible job shop scheduling in a real-world manufacturing scenario. Proc CIRP 106:227\u2013232. https:\/\/doi.org\/10.1016\/j.procir.2022.02.183","DOI":"10.1016\/j.procir.2022.02.183"},{"key":"9654_CR20","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2022.117380","volume":"203","author":"R Li","year":"2022","unstructured":"Li R, Gong W, Lu C (2022) A reinforcement learning based RMOEA\/D for bi-objective fuzzy flexible job shop scheduling. Expert Syst Appl 203:117380. https:\/\/doi.org\/10.1016\/j.eswa.2022.117380","journal-title":"Expert Syst Appl"},{"issue":"19","key":"9654_CR21","doi-asserted-by":"publisher","first-page":"5867","DOI":"10.1080\/00207543.2020.1794075","volume":"59","author":"H Wang","year":"2021","unstructured":"Wang H, Sarker BR, Li J, Li J (2021) Adaptive scheduling for assembly job shop with uncertain assembly times based on dual Q-learning. Int J Prod Res 59(19):5867\u20135883. https:\/\/doi.org\/10.1080\/00207543.2020.1794075","journal-title":"Int J Prod Res"},{"key":"9654_CR22","doi-asserted-by":"publisher","unstructured":"Zhao M, Li X, Gao L, Wang L, Xiao M (2019) An improved Q-learning based rescheduling method for flexible job-shops with machine failures. In: 2019 IEEE 15th international conference on automation science and engineering (CASE), 331\u2013337. https:\/\/doi.org\/10.1109\/COASE.2019.8843100","DOI":"10.1109\/COASE.2019.8843100"},{"key":"9654_CR23","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2020.106778","volume":"149","author":"R Chen","year":"2020","unstructured":"Chen R, Yang B, Li S, Wang S (2020) A self-learning genetic algorithm based on reinforcement learning for flexible job-shop scheduling problem. Comput Ind Eng 149:106778. https:\/\/doi.org\/10.1016\/j.cie.2020.106778","journal-title":"Comput Ind Eng"},{"key":"9654_CR24","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2021.107489","volume":"159","author":"S Luo","year":"2021","unstructured":"Luo S, Zhang L, Fan Y (2021) Dynamic multi-objective scheduling for flexible job shop by deep reinforcement learning. Comput Ind Eng 159:107489. https:\/\/doi.org\/10.1016\/j.cie.2021.107489","journal-title":"Comput Ind Eng"},{"key":"9654_CR25","doi-asserted-by":"publisher","DOI":"10.1016\/j.comnet.2021.107969","volume":"190","author":"L Wang","year":"2021","unstructured":"Wang L, Hu X, Wang Y, Xu S, Ma S, Yang K, Liu Z, Wang W (2021) Dynamic job-shop scheduling in smart manufacturing using deep reinforcement learning. Comput Netw 190:107969. https:\/\/doi.org\/10.1016\/j.comnet.2021.107969","journal-title":"Comput Netw"},{"issue":"2","key":"9654_CR26","doi-asserted-by":"publisher","first-page":"1322","DOI":"10.1109\/TII.2022.3167380","volume":"19","author":"R Chen","year":"2023","unstructured":"Chen R, Li W, Yang H (2023) A deep reinforcement learning framework based on an attention mechanism and disjunctive graph embedding for the job-shop scheduling problem. IEEE Trans Ind Inform 19(2):1322\u20131331. https:\/\/doi.org\/10.1109\/TII.2022.3167380","journal-title":"IEEE Trans Ind Inform"},{"key":"9654_CR27","doi-asserted-by":"publisher","first-page":"186474","DOI":"10.1109\/ACCESS.2020.3029868","volume":"8","author":"B Han","year":"2020","unstructured":"Han B, Yang J (2020) Research on adaptive job shop scheduling problems based on dueling double DQN. IEEE Access 8:186474\u2013186495. https:\/\/doi.org\/10.1109\/ACCESS.2020.3029868","journal-title":"IEEE Access"},{"key":"9654_CR28","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2022.117796","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. https:\/\/doi.org\/10.1016\/j.eswa.2022.117796","journal-title":"Expert Syst Appl"},{"key":"9654_CR29","doi-asserted-by":"publisher","unstructured":"Jing X, Yao X, Liu M, Zhou J (2022) Multi-agent reinforcement learning based on graph convolutional network for flexible job shop scheduling. J Intell Manuf, pp 1\u201319 https:\/\/doi.org\/10.1007\/s10845-022-02037-5","DOI":"10.1007\/s10845-022-02037-5"},{"issue":"4","key":"9654_CR30","doi-asserted-by":"publisher","first-page":"1125","DOI":"10.1109\/TCCN.2019.2952909","volume":"5","author":"C Zhong","year":"2019","unstructured":"Zhong C, Lu Z, Gursoy MC, Velipasalar S (2019) A deep actor-critic reinforcement learning framework for dynamic multichannel access. IEEE Trans Cogn Commun Netw 5(4):1125\u20131139. https:\/\/doi.org\/10.1109\/TCCN.2019.2952909","journal-title":"IEEE Trans Cogn Commun Netw"},{"key":"9654_CR31","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1007\/BF01719451","volume":"15","author":"J Hurink","year":"1994","unstructured":"Hurink J, Jurisch B, Thole M (1994) Tabu search for the job-shop scheduling problem with multi-purpose machines. OR Spectr 15:205\u2013215. https:\/\/doi.org\/10.1007\/BF01719451","journal-title":"OR Spectr"},{"key":"9654_CR32","doi-asserted-by":"publisher","unstructured":"Behnke D, Geiger MJ (2012) Test instances for the flexible job shop scheduling problem with work centers. Arbeitspapier\/Research Paper\/Helmut-Schmidt-Universit\u00e4t, Lehrstuhl f\u00fcr Betriebswirtschaftslehre, insbes. Logistik-Management https:\/\/doi.org\/10.24405\/436","DOI":"10.24405\/436"},{"key":"9654_CR33","doi-asserted-by":"publisher","DOI":"10.1016\/j.aei.2023.102230","volume":"58","author":"M Yuan","year":"2023","unstructured":"Yuan M, Huang H, Li Z, Zhang C, Pei F, Gu W (2023) A multi-agent double Deep-Q-network based on state machine and event stream for flexible job shop scheduling problem. Adv Eng Inform 58:102230. https:\/\/doi.org\/10.1016\/j.aei.2023.102230","journal-title":"Adv Eng Inform"}],"container-title":["Neural Computing and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-024-09654-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00521-024-09654-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-024-09654-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,8]],"date-time":"2024-07-08T14:08:24Z","timestamp":1720447704000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00521-024-09654-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,4,18]]},"references-count":33,"journal-issue":{"issue":"20","published-print":{"date-parts":[[2024,7]]}},"alternative-id":["9654"],"URL":"https:\/\/doi.org\/10.1007\/s00521-024-09654-6","relation":{},"ISSN":["0941-0643","1433-3058"],"issn-type":[{"value":"0941-0643","type":"print"},{"value":"1433-3058","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,4,18]]},"assertion":[{"value":"14 May 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 March 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 April 2024","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 declare that there is no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}