{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,14]],"date-time":"2026-04-14T15:44:58Z","timestamp":1776181498455,"version":"3.50.1"},"reference-count":46,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2025,2,10]],"date-time":"2025-02-10T00:00:00Z","timestamp":1739145600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,2,10]],"date-time":"2025-02-10T00:00:00Z","timestamp":1739145600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"name":"the Ministry of Science and Technology of China-Research","award":["2020YFB1712202"],"award-info":[{"award-number":["2020YFB1712202"]}]},{"name":"the Ministry of Science and Technology of China-Research","award":["2020YFB1712202"],"award-info":[{"award-number":["2020YFB1712202"]}]},{"name":"the Ministry of Science and Technology of China-Research","award":["2020YFB1712202"],"award-info":[{"award-number":["2020YFB1712202"]}]},{"name":"the Ministry of Science and Technology of China-Research","award":["2020YFB1712202"],"award-info":[{"award-number":["2020YFB1712202"]}]},{"name":"the Ministry of Science and Technology of China-Research","award":["2020YFB1712202"],"award-info":[{"award-number":["2020YFB1712202"]}]},{"name":"Basic Research Project of Science and Technology Department of Jilin Province","award":["202002044JC"],"award-info":[{"award-number":["202002044JC"]}]},{"name":"Basic Research Project of Science and Technology Department of Jilin Province","award":["202002044JC"],"award-info":[{"award-number":["202002044JC"]}]},{"name":"Basic Research Project of Science and Technology Department of Jilin Province","award":["202002044JC"],"award-info":[{"award-number":["202002044JC"]}]},{"name":"Basic Research Project of Science and Technology Department of Jilin Province","award":["202002044JC"],"award-info":[{"award-number":["202002044JC"]}]},{"name":"Basic Research Project of Science and Technology Department of Jilin Province","award":["202002044JC"],"award-info":[{"award-number":["202002044JC"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Supercomput"],"DOI":"10.1007\/s11227-025-06935-2","type":"journal-article","created":{"date-parts":[[2025,2,10]],"date-time":"2025-02-10T21:11:06Z","timestamp":1739221866000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["A random flight\u2013follow leader and reinforcement learning approach for flexible job shop scheduling problem"],"prefix":"10.1007","volume":"81","author":[{"given":"Changshun","family":"Shao","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhenglin","family":"Yu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hongchang","family":"Ding","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guohua","family":"Cao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jingsong","family":"Duan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bin","family":"Zhou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,2,10]]},"reference":[{"issue":"5","key":"6935_CR1","doi-asserted-by":"publisher","first-page":"6917","DOI":"10.1007\/s11227-023-05714-1","volume":"80","author":"Y Cheng","year":"2024","unstructured":"Cheng Y, Cao Z, Zhang X, Cao Q, Zhang D (2024) Multi objective dynamic task scheduling optimization algorithm based on deep reinforcement learning. J Supercomput 80(5):6917\u20136945. https:\/\/doi.org\/10.1007\/s11227-023-05714-1","journal-title":"J Supercomput"},{"issue":"2","key":"6935_CR2","doi-asserted-by":"publisher","first-page":"1322","DOI":"10.1109\/TII.2022.3167380","volume":"19","author":"R Chen","year":"2022","unstructured":"Chen R, Li W, Yang H (2022) A deep reinforcement learning framework based on an attention mechanism and disjunctive graph embedding for the job-shop scheduling problem. IEEE Trans Industr Inf 19(2):1322\u20131331. https:\/\/doi.org\/10.1109\/TII.2022.3167380","journal-title":"IEEE Trans Industr Inf"},{"issue":"10","key":"6935_CR3","doi-asserted-by":"publisher","first-page":"1635","DOI":"10.1080\/0305215X.2022.2106477","volume":"55","author":"KC Lim","year":"2023","unstructured":"Lim KC, Wei L-P, Chin JF (2023) Simulated-annealing-based hyper-heuristic for flexible job-shop scheduling. Eng Optim 55(10):1635\u20131651. https:\/\/doi.org\/10.1080\/0305215X.2022.2106477","journal-title":"Eng Optim"},{"issue":"6","key":"6935_CR4","doi-asserted-by":"publisher","first-page":"2586","DOI":"10.3390\/app14062586","volume":"14","author":"J Kong","year":"2024","unstructured":"Kong J, Wang Z (2024) Research on flexible job shop scheduling problem with handling and setup time based on improved discrete particle swarm algorithm. Appl Sci 14(6):2586. https:\/\/doi.org\/10.3390\/app14062586","journal-title":"Appl Sci"},{"key":"6935_CR5","doi-asserted-by":"publisher","first-page":"334","DOI":"10.1016\/j.jmsy.2024.02.007","volume":"73","author":"Y Xu","year":"2024","unstructured":"Xu Y et al (2024) Hybrid quantum particle swarm optimization and variable neighborhood search for flexible job-shop scheduling problem. J Manuf Syst 73:334\u2013348. https:\/\/doi.org\/10.1016\/j.jmsy.2024.02.007","journal-title":"J Manuf Syst"},{"key":"6935_CR6","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2024.101538","volume":"86","author":"X Han","year":"2024","unstructured":"Han X et al (2024) A dual population collaborative genetic algorithm for solving flexible job shop scheduling problem with AGV. Swarm Evol Comput 86:101538. https:\/\/doi.org\/10.1016\/j.swevo.2024.101538","journal-title":"Swarm Evol Comput"},{"key":"6935_CR7","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1016\/j.jmsy.2024.03.002","volume":"74","author":"C Fan","year":"2024","unstructured":"Fan C, Wang W, Tian J (2024) Flexible job shop scheduling with stochastic machine breakdowns by an improved tuna swarm optimization algorithm. J Manuf Syst 74:180\u2013197. https:\/\/doi.org\/10.1016\/j.jmsy.2024.03.002","journal-title":"J Manuf Syst"},{"issue":"9","key":"6935_CR8","doi-asserted-by":"publisher","first-page":"590","DOI":"10.3390\/machines12090590","volume":"12","author":"Z Mei","year":"2024","unstructured":"Mei Z, Lu Y, Lv L (2024) Research on multi-objective low-carbon flexible job shop scheduling based on improved NSGA-II. Machines 12(9):590. https:\/\/doi.org\/10.3390\/machines12090590","journal-title":"Machines"},{"issue":"1","key":"6935_CR9","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1007\/s11063-024-11488-1","volume":"56","author":"K Zhou","year":"2024","unstructured":"Zhou K, Tan C, Zhao Y, Yu J, Zhang Z, Wu Y (2024) Research on solving flexible job shop scheduling problem based on improved GWO algorithm SS-GWO. Neural Process Lett 56(1):26. https:\/\/doi.org\/10.1007\/s11063-024-11488-1","journal-title":"Neural Process Lett"},{"key":"6935_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"},{"issue":"12","key":"6935_CR11","doi-asserted-by":"publisher","first-page":"2873","DOI":"10.1108\/K-06-2019-0430","volume":"49","author":"Y Zhang","year":"2020","unstructured":"Zhang Y, Zhu H, Tang D (2020) An improved hybrid particle swarm optimization for multi-objective flexible job-shop scheduling problem. Kybernetes 49(12):2873\u20132892. https:\/\/doi.org\/10.1108\/K-06-2019-0430","journal-title":"Kybernetes"},{"issue":"3","key":"6935_CR12","doi-asserted-by":"publisher","first-page":"80","DOI":"10.3390\/mca24030080","volume":"24","author":"P Sriboonchandr","year":"2019","unstructured":"Sriboonchandr P, Kriengkorakot N, Kriengkorakot P (2019) Improved differential evolution algorithm for flexible job shop scheduling problems. Math Comput Appl 24(3):80. https:\/\/doi.org\/10.3390\/mca24030080","journal-title":"Math Comput Appl"},{"key":"6935_CR13","doi-asserted-by":"publisher","unstructured":"Mart\u00ednez Y, et al (2011) A reinforcement learning approach for the flexible job shop scheduling problem. In: International Conference on Learning and Intelligent Optimization. Berlin, Heidelberg: Springer Berlin Heidelberg. https:\/\/doi.org\/10.1007\/978-3-642-25566-3_19","DOI":"10.1007\/978-3-642-25566-3_19"},{"key":"6935_CR14","doi-asserted-by":"publisher","DOI":"10.1109\/TASE.2023.3271666","author":"L Zhao","year":"2023","unstructured":"Zhao L et al (2023) A drl-based reactive scheduling policy for flexible job shops with random job arrivals. IEEE Trans Autom Sci Eng. https:\/\/doi.org\/10.1109\/TASE.2023.3271666","journal-title":"IEEE Trans Autom Sci Eng"},{"issue":"1","key":"6935_CR15","doi-asserted-by":"publisher","first-page":"1007","DOI":"10.1109\/TII.2023.3272661","volume":"20","author":"K Lei","year":"2023","unstructured":"Lei K et al (2023) Large-scale dynamic scheduling for flexible job-shop with random arrivals of new jobs by hierarchical reinforcement learning. IEEE Trans Industr Inf 20(1):1007\u20131018. https:\/\/doi.org\/10.1109\/TII.2023.3272661","journal-title":"IEEE Trans Industr Inf"},{"key":"6935_CR16","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2022.117796","volume":"205","author":"K Lei","year":"2022","unstructured":"Lei K et al (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":"6935_CR17","doi-asserted-by":"publisher","unstructured":"Zeng Z, Li X, Bai C (2022) A deep reinforcement learning approach to flexible job shop scheduling. In: 2022 IEEE International Conference on Systems, Man, and Cybernetics (SMC). IEEE. https:\/\/doi.org\/10.1109\/SMC53654.2022.9945107","DOI":"10.1109\/SMC53654.2022.9945107"},{"issue":"1","key":"6935_CR18","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1007\/s10845-022-02037-5","volume":"35","author":"X Jing","year":"2024","unstructured":"Jing X et al (2024) Multi-agent reinforcement learning based on graph convolutional network for flexible job shop scheduling. J Intell Manuf 35(1):75\u201393. https:\/\/doi.org\/10.1007\/s10845-022-02037-5","journal-title":"J Intell Manuf"},{"issue":"2","key":"6935_CR19","doi-asserted-by":"publisher","first-page":"548","DOI":"10.1007\/s10696-021-09437-4","volume":"35","author":"M Saqlain","year":"2023","unstructured":"Saqlain M, Ali S, Lee JY (2023) A Monte-Carlo tree search algorithm for the flexible job-shop scheduling in manufacturing systems. Flex Serv Manuf J 35(2):548\u2013571. https:\/\/doi.org\/10.1007\/s10696-021-09437-4","journal-title":"Flex Serv Manuf J"},{"key":"6935_CR20","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2023.3306421","author":"R Wang","year":"2023","unstructured":"Wang R et al (2023) Flexible job shop scheduling via dual attention network-based reinforcement learning. IEEE Trans Neural Netw Learn Syst. https:\/\/doi.org\/10.1109\/TNNLS.2023.3306421","journal-title":"IEEE Trans Neural Netw Learn Syst"},{"issue":"2","key":"6935_CR21","doi-asserted-by":"publisher","first-page":"1600","DOI":"10.1109\/TII.2022.3189725","volume":"19","author":"W Song","year":"2022","unstructured":"Song W et al (2022) Flexible job-shop scheduling via graph neural network and deep reinforcement learning. IEEE Trans Industr Inf 19(2):1600\u20131610. https:\/\/doi.org\/10.1109\/TII.2022.3189725","journal-title":"IEEE Trans Industr Inf"},{"key":"6935_CR22","doi-asserted-by":"publisher","DOI":"10.1016\/j.aei.2023.102230","volume":"58","author":"M Yuan","year":"2023","unstructured":"Yuan M et al (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"},{"key":"6935_CR23","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1016\/j.jmsy.2024.03.012","volume":"74","author":"W Zhang","year":"2024","unstructured":"Zhang W et al (2024) A novel collaborative agent reinforcement learning framework based on an attention mechanism and disjunctive graph embedding for flexible job shop scheduling problem. J Manuf Syst 74:329\u2013345. https:\/\/doi.org\/10.1016\/j.jmsy.2024.03.012","journal-title":"J Manuf Syst"},{"key":"6935_CR24","doi-asserted-by":"publisher","DOI":"10.1109\/TETCI.2022.3145706","author":"Yu Du","year":"2022","unstructured":"Du Yu et al (2022) Knowledge-based reinforcement learning and estimation of distribution algorithm for flexible job shop scheduling problem. IEEE Trans Emerg Top Comput Intell 74. https:\/\/doi.org\/10.1109\/TETCI.2022.3145706","journal-title":"IEEE Trans Emerg Top Comput Intell 7.4"},{"key":"6935_CR25","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2023.123019","volume":"245","author":"E Yuan","year":"2024","unstructured":"Yuan E et al (2024) Solving flexible job shop scheduling problems via deep reinforcement learning. Expert Syst Appl 245:123019. https:\/\/doi.org\/10.1016\/j.eswa.2023.123019","journal-title":"Expert Syst Appl"},{"key":"6935_CR26","doi-asserted-by":"publisher","DOI":"10.1007\/s00521-024-09654-6","author":"L Wan","year":"2024","unstructured":"Wan L et al (2024) An effective deep actor-critic reinforcement learning method for solving the flexible job shop scheduling problem. Neural Comput Appl. https:\/\/doi.org\/10.1007\/s00521-024-09654-6","journal-title":"Neural Comput Appl"},{"key":"6935_CR27","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2024.111940","volume":"296","author":"L Wan","year":"2024","unstructured":"Wan L et al (2024) Flexible job shop scheduling via deep reinforcement learning with meta-path-based heterogeneous graph neural network. Knowl-Based Syst 296:111940. https:\/\/doi.org\/10.1016\/j.knosys.2024.111940","journal-title":"Knowl-Based Syst"},{"key":"6935_CR28","doi-asserted-by":"publisher","unstructured":"Liu W, Chen H, Zhang J, Wang Y (2024) A multiobjective flexible job shop scheduling method based on deep reinforcement learning. In: Ninth international symposium on sensors, mechatronics, and automation system (ISSMAS 2023) Vol. 12981, pp. 1195\u20131201. SPIE. https:\/\/doi.org\/10.1117\/12.3014960","DOI":"10.1117\/12.3014960"},{"issue":"18","key":"6935_CR29","doi-asserted-by":"publisher","first-page":"3696","DOI":"10.3390\/electronics13183696","volume":"13","author":"S Xu","year":"2024","unstructured":"Xu S, Li Y, Li Q (2024) A deep reinforcement learning method based on a transformer model for the flexible job shop scheduling problem. Electronics 13(18):3696. https:\/\/doi.org\/10.3390\/electronics13183696","journal-title":"Electronics"},{"key":"6935_CR30","doi-asserted-by":"publisher","unstructured":"He J, Li J (2024) Deep reinforcement learning based on graph neural network for flexible job shop scheduling problem with lot streaming. In: International conference on intelligent computing (pp. 85\u201395). Singapore: Springer Nature Singapore. https:\/\/doi.org\/10.1007\/978-981-97-5675-9_8","DOI":"10.1007\/978-981-97-5675-9_8"},{"key":"6935_CR31","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2024.125189","volume":"258","author":"M Zhuang","year":"2024","unstructured":"Zhuang M, Zhang W, Tang H, Li X, Wang K (2024) A multi-objective genetic algorithm based on two-stage reinforcement learning for green flexible shop scheduling problem considering machine speed. Expert Syst Appl 258:125189. https:\/\/doi.org\/10.1016\/j.eswa.2024.125189","journal-title":"Expert Syst Appl"},{"key":"6935_CR32","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. https:\/\/doi.org\/10.1016\/j.asoc.2023.110658","journal-title":"Appl Soft Comput"},{"key":"6935_CR33","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2020.106778","volume":"149","author":"R Chen","year":"2020","unstructured":"Chen R et al (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"},{"issue":"4","key":"6935_CR34","doi-asserted-by":"publisher","DOI":"10.1002\/cpe.6658","volume":"34","author":"X Long","year":"2022","unstructured":"Long X et al (2022) A self-learning artificial bee colony algorithm based on reinforcement learning for a flexible job-shop scheduling problem. Concurr Comput: Pract Exp 34(4):e6658. https:\/\/doi.org\/10.1002\/cpe.6658","journal-title":"Concurr Comput: Pract Exp"},{"key":"6935_CR35","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2024.101658","volume":"90","author":"R Chen","year":"2024","unstructured":"Chen R, Wu B, Wang H, Tong H, Yan F (2024) A Q-Learning based NSGA-II for dynamic flexible job shop scheduling with limited transportation resources. Swarm Evol Comput 90:101658. https:\/\/doi.org\/10.1016\/j.swevo.2024.101658","journal-title":"Swarm Evol Comput"},{"issue":"2","key":"6935_CR36","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1016\/j.ejor.2023.05.017","volume":"314","author":"S Dauz\u00e8re-P\u00e9r\u00e8s","year":"2024","unstructured":"Dauz\u00e8re-P\u00e9r\u00e8s S et al (2024) The flexible job shop scheduling problem: a review. Eur J Oper Res 314(2):409\u2013432. https:\/\/doi.org\/10.1016\/j.ejor.2023.05.017","journal-title":"Eur J Oper Res"},{"issue":"7","key":"6935_CR37","doi-asserted-by":"publisher","first-page":"3259","DOI":"10.1016\/j.asoc.2013.02.013","volume":"13","author":"HX Yuan","year":"2013","unstructured":"Yuan HX, Yang J (2013) A hybrid harmony search algorithm for the flexible job shop scheduling problem. Appl Soft Comput 13(7):3259\u20133272. https:\/\/doi.org\/10.1016\/j.asoc.2013.02.013","journal-title":"Appl Soft Comput"},{"key":"6935_CR38","volume-title":"Particle Swarm optimization and scheduling algorithms","author":"L Wang","year":"2008","unstructured":"Wang L (2008) Particle Swarm optimization and scheduling algorithms. Tsinghua University Press, Beijing"},{"key":"6935_CR39","doi-asserted-by":"publisher","unstructured":"Geist M, Scherrer B, Pietquin O (2019) A theory of regularized markov decision processes. In: International conference on machine learning (pp. 2160\u20132169). PMLR. https:\/\/doi.org\/10.48550\/arXiv.1901.11275","DOI":"10.48550\/arXiv.1901.11275"},{"key":"6935_CR40","doi-asserted-by":"publisher","unstructured":"Zhao D, et al (2016) Deep reinforcement learning with experience replay based on SARSA. In: 2016 IEEE symposium series on computational intelligence (SSCI). IEEE. https:\/\/doi.org\/10.1109\/SSCI.2016.7849837","DOI":"10.1109\/SSCI.2016.7849837"},{"key":"6935_CR41","doi-asserted-by":"publisher","first-page":"81177","DOI":"10.1109\/ACCESS.2022.3195530","volume":"10","author":"H Moradimaryamnegari","year":"2022","unstructured":"Moradimaryamnegari H, Frego M, Peer A (2022) Model predictive control-based reinforcement learning using expected sarsa. IEEE Access 10:81177\u201381191. https:\/\/doi.org\/10.1109\/ACCESS.2022.3195530","journal-title":"IEEE Access"},{"key":"6935_CR42","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/j.cie.2017.05.026","volume":"110","author":"J Shahrabi","year":"2017","unstructured":"Shahrabi J, Adibi MA, Mahootchi M (2017) A reinforcement learning approach to parameter estimation in dynamic job shop scheduling. Comput Ind Eng 110:75\u201382. https:\/\/doi.org\/10.1016\/j.cie.2017.05.026","journal-title":"Comput Ind Eng"},{"key":"6935_CR43","doi-asserted-by":"publisher","unstructured":"Behnke D, Geiger MJ (2012) Test instances for the flexible job shop scheduling problem with work centers. https:\/\/doi.org\/10.24405\/436","DOI":"10.24405\/436"},{"issue":"1","key":"6935_CR44","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1109\/TEVC.2020.2991040","volume":"25","author":"X Cai","year":"2020","unstructured":"Cai X, Xiao Y, Li M, Hu H, Ishibuchi H, Li X (2020) A grid-based inverted generational distance for multi\/many-objective optimization. IEEE Trans Evol Comput 25(1):21\u201334. https:\/\/doi.org\/10.1109\/TEVC.2020.2991040","journal-title":"IEEE Trans Evol Comput"},{"issue":"1","key":"6935_CR45","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1109\/TEVC.2020.3013290","volume":"25","author":"K Shang","year":"2020","unstructured":"Shang K, Ishibuchi H, He L, Pang LM (2020) A survey on the hypervolume indicator in evolutionary multiobjective optimization. IEEE Trans Evol Comput 25(1):1\u201320. https:\/\/doi.org\/10.1109\/TEVC.2020.3013290","journal-title":"IEEE Trans Evol Comput"},{"key":"6935_CR46","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1016\/j.procs.2017.08.174","volume":"112","author":"B Marzouki","year":"2017","unstructured":"Marzouki B, Driss OB, Gh\u00e9dira K (2017) Multi agent model based on chemical reaction optimization with greedy algorithm for flexible job shop scheduling problem. Procedia Computer Science 112:81\u201390. https:\/\/doi.org\/10.1016\/j.procs.2017.08.174","journal-title":"Procedia Computer Science"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-025-06935-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11227-025-06935-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-025-06935-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,10]],"date-time":"2025-02-10T21:11:15Z","timestamp":1739221875000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11227-025-06935-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,2,10]]},"references-count":46,"journal-issue":{"issue":"3","published-online":{"date-parts":[[2025,2]]}},"alternative-id":["6935"],"URL":"https:\/\/doi.org\/10.1007\/s11227-025-06935-2","relation":{},"ISSN":["1573-0484"],"issn-type":[{"value":"1573-0484","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,2,10]]},"assertion":[{"value":"13 January 2025","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 February 2025","order":2,"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 no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"No ethical approval was required for this research.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical approval"}}],"article-number":"478"}}