{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,2]],"date-time":"2025-10-02T06:14:28Z","timestamp":1759385668878,"version":"3.37.3"},"reference-count":68,"publisher":"Springer Science and Business Media LLC","issue":"13","license":[{"start":{"date-parts":[[2024,5,22]],"date-time":"2024-05-22T00:00:00Z","timestamp":1716336000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,5,22]],"date-time":"2024-05-22T00:00:00Z","timestamp":1716336000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61673270"],"award-info":[{"award-number":["61673270"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China,China","doi-asserted-by":"crossref","award":["61973212"],"award-info":[{"award-number":["61973212"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100017599","name":"Science and Technology Program of Zhejiang Province","doi-asserted-by":"publisher","award":["2022C01013"],"award-info":[{"award-number":["2022C01013"]}],"id":[{"id":"10.13039\/501100017599","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Supercomput"],"published-print":{"date-parts":[[2024,9]]},"DOI":"10.1007\/s11227-024-06167-w","type":"journal-article","created":{"date-parts":[[2024,5,22]],"date-time":"2024-05-22T04:01:46Z","timestamp":1716350506000},"page":"18761-18796","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["A deep reinforcement learning approach for dynamic task scheduling of flight tests"],"prefix":"10.1007","volume":"80","author":[{"given":"Bei","family":"Tian","sequence":"first","affiliation":[]},{"given":"Gang","family":"Xiao","sequence":"additional","affiliation":[]},{"given":"Yu","family":"Shen","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,5,22]]},"reference":[{"key":"6167_CR1","doi-asserted-by":"publisher","first-page":"871","DOI":"10.4271\/2011-01-2564","volume":"4","author":"A Landi","year":"2011","unstructured":"Landi A, Nicholson M (2011) Arp4754a\/ ed-79a - guidelines for development of civil aircraft and systems - enhancements, novelties and key topics. SAE Int J Aerosp 4:871\u2013879. https:\/\/doi.org\/10.4271\/2011-01-2564","journal-title":"SAE Int J Aerosp"},{"key":"6167_CR2","doi-asserted-by":"publisher","unstructured":"Gregory JW, Liu T (2021) Introduction to flight testing. Wiley, Newark, https:\/\/doi.org\/10.1002\/9781118949818","DOI":"10.1002\/9781118949818"},{"key":"6167_CR3","unstructured":"Corda S (2017) Introduction to aerospace engineering with a flight test perspective"},{"key":"6167_CR4","unstructured":"Hewett M, Tartt D, Agarwal A (1991) Automated flight test management system. Technical report. https:\/\/ntrs.nasa.gov\/api\/citations\/19910012804\/downloads\/19910012804.pdf"},{"key":"6167_CR5","unstructured":"Air Force programs: mission planning system. Technical report (2019). https:\/\/www.dote.osd.mil\/Portals\/97\/pub\/reports\/FY2010\/af\/2010mps.pdf?ver=2019-08-22-112949-083"},{"key":"6167_CR6","unstructured":"Yuan C, Xiu Z, Tian H, Ding Z (2014) Research on flight test planning and management for civil aircraft. Civil Aircraft Design and Research, 1\u2013452"},{"key":"6167_CR7","doi-asserted-by":"publisher","DOI":"10.1007\/s42401-019-00035-9","author":"Y Liu","year":"2019","unstructured":"Liu Y, Xiao G, Wang M, Li T (2019) A method for flight test subject allocation on multiple test aircrafts based on improved genetic algorithm. Aerosp Syst. https:\/\/doi.org\/10.1007\/s42401-019-00035-9","journal-title":"Aerosp Syst"},{"key":"6167_CR8","doi-asserted-by":"publisher","first-page":"108241","DOI":"10.1016\/j.asoc.2021.108241","volume":"115","author":"S Xu","year":"2022","unstructured":"Xu S, Bi W, Zhang A, Mao Z (2022) Optimization of flight test tasks allocation and sequencing using genetic algorithm. Appl Soft Comput 115:108241. https:\/\/doi.org\/10.1016\/j.asoc.2021.108241","journal-title":"Appl Soft Comput"},{"key":"6167_CR9","doi-asserted-by":"publisher","unstructured":"J\u00fcnger M, Reinelt G, Rinaldi G (1995) Chapter 4 the traveling salesman problem 7:225\u2013330 https:\/\/doi.org\/10.1016\/S0927-0507(05)80121-5","DOI":"10.1016\/S0927-0507(05)80121-5"},{"issue":"2","key":"6167_CR10","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1287\/ijoc.3.2.149","volume":"3","author":"D Applegate","year":"1991","unstructured":"Applegate D, Cook W (1991) A computational study of the job-shop scheduling problem. ORSA J Comput 3(2):149\u2013156. https:\/\/doi.org\/10.1287\/ijoc.3.2.149","journal-title":"ORSA J Comput"},{"issue":"1","key":"6167_CR11","doi-asserted-by":"publisher","first-page":"487","DOI":"10.1016\/S0166-218X(01)00351-1","volume":"123","author":"P Toth","year":"2002","unstructured":"Toth P, Vigo D (2002) Models, relaxations and exact approaches for the capacitated vehicle routing problem. Discrete Appl Math 123(1):487\u2013512. https:\/\/doi.org\/10.1016\/S0166-218X(01)00351-1","journal-title":"Discrete Appl Math"},{"key":"6167_CR12","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1016\/j.future.2018.09.014","volume":"91","author":"A Arunarani","year":"2019","unstructured":"Arunarani A, Manjula D, Sugumaran V (2019) Task scheduling techniques in cloud computing: a literature survey. Futur Gener Comput Syst 91:407\u2013415. https:\/\/doi.org\/10.1016\/j.future.2018.09.014","journal-title":"Futur Gener Comput Syst"},{"key":"6167_CR13","doi-asserted-by":"publisher","DOI":"10.3390\/app11146449","author":"F Peres","year":"2021","unstructured":"Peres F, Castelli M (2021) Combinatorial optimization problems and metaheuristics: review, challenges, design, and development. Appl Sci. https:\/\/doi.org\/10.3390\/app11146449","journal-title":"Appl Sci"},{"issue":"3","key":"6167_CR14","doi-asserted-by":"publisher","first-page":"268","DOI":"10.1145\/937503.937505","volume":"35","author":"C Blum","year":"2003","unstructured":"Blum C, Roli A (2003) Metaheuristics in combinatorial optimization: overview and conceptual comparison. ACM Comput Surv 35(3):268\u2013308. https:\/\/doi.org\/10.1145\/937503.937505","journal-title":"ACM Comput Surv"},{"key":"6167_CR15","first-page":"1","volume-title":"Local search for planning and scheduling","author":"S Vo\u00df","year":"2001","unstructured":"Vo\u00df S (2001) Meta-heuristics: the state of the art. In: Nareyek A (ed) Local search for planning and scheduling. Springer, Berlin and Heidelberg, pp 1\u201323"},{"key":"6167_CR16","doi-asserted-by":"publisher","DOI":"10.3390\/app11146449","author":"F Peres","year":"2021","unstructured":"Peres F, Castelli M (2021) Combinatorial optimization problems and metaheuristics: review, challenges, design, and development. Appl Sci. https:\/\/doi.org\/10.3390\/app11146449","journal-title":"Appl Sci"},{"key":"6167_CR17","doi-asserted-by":"publisher","unstructured":"Fran\u00e7ois-Lavet V, Henderson P, Islam R, Bellemare MG, Pineau J (2018) An introduction to deep reinforcement learning. Foundat Trends\u00ae Mach Learn, 11(3-4):219\u2013354 https:\/\/doi.org\/10.1561\/2200000071","DOI":"10.1561\/2200000071"},{"issue":"2","key":"6167_CR18","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1016\/j.ejor.2020.07.063","volume":"290","author":"Y Bengio","year":"2021","unstructured":"Bengio Y, Lodi A, Prouvost A (2021) Machine learning for combinatorial optimization: a methodological tour d\u2019horizon. Eur J Oper Res 290(2):405\u2013421. https:\/\/doi.org\/10.1016\/j.ejor.2020.07.063","journal-title":"Eur J Oper Res"},{"key":"6167_CR19","doi-asserted-by":"publisher","first-page":"120495","DOI":"10.1016\/j.eswa.2023.120495","volume":"231","author":"AK Shakya","year":"2023","unstructured":"Shakya AK, Pillai G, Chakrabarty S (2023) Reinforcement learning algorithms: a brief survey. Expert Syst Appl 231:120495. https:\/\/doi.org\/10.1016\/j.eswa.2023.120495","journal-title":"Expert Syst Appl"},{"key":"6167_CR20","doi-asserted-by":"publisher","unstructured":"Li SE (2023) Deep reinforcement learning, pp. 365\u2013402. Springer, Singapore. https:\/\/doi.org\/10.1007\/978-981-19-7784-8_10","DOI":"10.1007\/978-981-19-7784-8_10"},{"key":"6167_CR21","doi-asserted-by":"publisher","first-page":"102412","DOI":"10.1016\/j.rcim.2022.102412","volume":"78","author":"Y Zhang","year":"2022","unstructured":"Zhang Y, Zhu H, Tang D, Zhou T, Gui Y (2022) Dynamic job shop scheduling based on deep reinforcement learning for multi-agent manufacturing systems. Robot Comput Integr Manuf 78:102412. https:\/\/doi.org\/10.1016\/j.rcim.2022.102412","journal-title":"Robot Comput Integr Manuf"},{"key":"6167_CR22","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1016\/j.jmsy.2023.09.009","volume":"71","author":"L Zhang","year":"2023","unstructured":"Zhang L, Feng Y, Xiao Q, Xu Y, Li D, Yang D, Yang Z (2023) Deep reinforcement learning for dynamic flexible job shop scheduling problem considering variable processing times. J Manuf Syst 71:257\u2013273. https:\/\/doi.org\/10.1016\/j.jmsy.2023.09.009","journal-title":"J Manuf Syst"},{"issue":"2","key":"6167_CR23","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1016\/j.cja.2023.10.011","volume":"37","author":"Q Shi","year":"2024","unstructured":"Shi Q, Li L, Fang Z, Bi X, Liu H, Zhang X, Chen W, Yu J (2024) Efficient and fair PPO-based integrated scheduling method for multiple tasks of satech-01 satellite. Chin J Aeronaut 37(2):417\u2013430. https:\/\/doi.org\/10.1016\/j.cja.2023.10.011","journal-title":"Chin J Aeronaut"},{"issue":"3731","key":"6167_CR24","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1126\/science.153.3731.34","volume":"153","author":"R Bellman","year":"1966","unstructured":"Bellman R (1966) Dynamic programming. Science 153(3731):34\u201337. https:\/\/doi.org\/10.1126\/science.153.3731.34","journal-title":"Science"},{"issue":"12","key":"6167_CR25","doi-asserted-by":"publisher","first-page":"1861","DOI":"10.1287\/mnsc.1040.0263","volume":"50","author":"ML Fisher","year":"2004","unstructured":"Fisher ML (2004) The Lagrangian relaxation method for solving integer programming problems. Manage Sci 50(12):1861\u20131871. https:\/\/doi.org\/10.1287\/mnsc.1040.0263","journal-title":"Manage Sci"},{"issue":"4","key":"6167_CR26","doi-asserted-by":"publisher","first-page":"699","DOI":"10.1287\/opre.14.4.699","volume":"14","author":"EL Lawler","year":"1966","unstructured":"Lawler EL, Wood DE (1966) Branch-and-bound methods: a survey. Oper Res 14(4):699\u2013719. https:\/\/doi.org\/10.1287\/opre.14.4.699","journal-title":"Oper Res"},{"key":"6167_CR27","doi-asserted-by":"publisher","first-page":"113556","DOI":"10.1016\/j.eswa.2020.113556","volume":"158","author":"CP Tomazella","year":"2020","unstructured":"Tomazella CP, Nagano MS (2020) A comprehensive review of branch-and-bound algorithms: guidelines and directions for further research on the flowshop scheduling problem. Expert Syst Appl 158:113556. https:\/\/doi.org\/10.1016\/j.eswa.2020.113556","journal-title":"Expert Syst Appl"},{"issue":"2","key":"6167_CR28","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1016\/j.ejor.2019.08.025","volume":"281","author":"Q Deng","year":"2020","unstructured":"Deng Q, Santos BF, Curran R (2020) A practical dynamic programming based methodology for aircraft maintenance check scheduling optimization. Eur J Oper Res 281(2):256\u2013273. https:\/\/doi.org\/10.1016\/j.ejor.2019.08.025","journal-title":"Eur J Oper Res"},{"key":"6167_CR29","doi-asserted-by":"publisher","unstructured":"Asadi-Gangraj E (2017) Lagrangian relaxation approach to minimize makespan for hybrid flow shop scheduling problem with unrelated parallel machines. Scientia Iranica https:\/\/doi.org\/10.24200\/sci.2017.20018","DOI":"10.24200\/sci.2017.20018"},{"issue":"4","key":"6167_CR30","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1007\/s10951-008-0090-8","volume":"12","author":"D Ouelhadj","year":"2009","unstructured":"Ouelhadj D, Petrovic S (2009) A survey of dynamic scheduling in manufacturing systems. J Sched 12(4):417\u2013431. https:\/\/doi.org\/10.1007\/s10951-008-0090-8","journal-title":"J Sched"},{"issue":"1","key":"6167_CR31","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1016\/S0377-2217(98)00023-X","volume":"116","author":"C Rajendran","year":"1999","unstructured":"Rajendran C, Holthaus O (1999) A comparative study of dispatching rules in dynamic flowshops and jobshops. Eur J Oper Res 116(1):156\u2013170. https:\/\/doi.org\/10.1016\/S0377-2217(98)00023-X","journal-title":"Eur J Oper Res"},{"key":"6167_CR32","doi-asserted-by":"publisher","unstructured":"Sih GC, Lee EA (1990) Dynamic-level scheduling for heterogeneous processor networks. In: Proceedings of the Second IEEE Symposium on Parallel and Distributed Processing 1990, pp. 42\u201349. https:\/\/doi.org\/10.1109\/SPDP.1990.143505","DOI":"10.1109\/SPDP.1990.143505"},{"issue":"3","key":"6167_CR33","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1109\/71.993206","volume":"13","author":"H Topcuoglu","year":"2002","unstructured":"Topcuoglu H, Hariri S, Wu M-Y (2002) Performance-effective and low-complexity task scheduling for heterogeneous computing. IEEE Trans Parallel Distrib Syst 13(3):260\u2013274. https:\/\/doi.org\/10.1109\/71.993206","journal-title":"IEEE Trans Parallel Distrib Syst"},{"key":"6167_CR34","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1016\/j.ins.2020.04.039","volume":"531","author":"L Zhang","year":"2020","unstructured":"Zhang L, Zhou L, Salah A (2020) Efficient scientific workflow scheduling for deadline-constrained parallel tasks in cloud computing environments. Inf Sci 531:31\u201346. https:\/\/doi.org\/10.1016\/j.ins.2020.04.039","journal-title":"Inf Sci"},{"key":"6167_CR35","doi-asserted-by":"publisher","unstructured":"Holland JH (1992) Adaptation in natural and artificial systems: an introductory analysis with applications to biology, control, and artificial intelligence, 1st MIT Press Edn. MIT Press, Cambridge. https:\/\/doi.org\/10.7551\/mitpress\/1090.001.0001","DOI":"10.7551\/mitpress\/1090.001.0001"},{"key":"6167_CR36","doi-asserted-by":"publisher","DOI":"10.1007\/s00500-016-2474-6","author":"D Wang","year":"2018","unstructured":"Wang D, Tan D, Liu L (2018) Particle swarm optimization algorithm: an overview. Soft Comput. https:\/\/doi.org\/10.1007\/s00500-016-2474-6","journal-title":"Soft Comput"},{"issue":"1","key":"6167_CR37","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1109\/4235.585892","volume":"1","author":"M Dorigo","year":"1997","unstructured":"Dorigo M, Gambardella LM (1997) Ant colony system: a cooperative learning approach to the traveling salesman problem. IEEE Trans Evol Comput 1(1):53\u201366. https:\/\/doi.org\/10.1109\/4235.585892","journal-title":"IEEE Trans Evol Comput"},{"key":"6167_CR38","doi-asserted-by":"publisher","unstructured":"Hajek B (1985) A tutorial survey of theory and applications of simulated annealing. In: 1985 24th IEEE Conference on Decision and Control, pp. 755\u2013760. https:\/\/doi.org\/10.1109\/CDC.1985.268599","DOI":"10.1109\/CDC.1985.268599"},{"issue":"5","key":"6167_CR39","doi-asserted-by":"publisher","first-page":"533","DOI":"10.1016\/0305-0548(86)90048-1","volume":"13","author":"F Glover","year":"1986","unstructured":"Glover F (1986) Future paths for integer programming and links to artificial intelligence. Comput Oper Res 13(5):533\u2013549. https:\/\/doi.org\/10.1016\/0305-0548(86)90048-1","journal-title":"Comput Oper Res"},{"issue":"6","key":"6167_CR40","doi-asserted-by":"publisher","first-page":"1531","DOI":"10.1007\/s00521-019-04119-7","volume":"32","author":"Z Zhou","year":"2020","unstructured":"Zhou Z, Li F, Zhu H, Xie H, Abawajy JH, Chowdhury MU (2020) An improved genetic algorithm using greedy strategy toward task scheduling optimization in cloud environments. Neural Comput Appl 32(6):1531\u20131541. https:\/\/doi.org\/10.1007\/s00521-019-04119-7","journal-title":"Neural Comput Appl"},{"key":"6167_CR41","doi-asserted-by":"publisher","first-page":"525","DOI":"10.1007\/978-981-13-0589-4_49","volume-title":"Soft computing: theories and applications","author":"B Jana","year":"2019","unstructured":"Jana B, Chakraborty M, Mandal T (2019) A task scheduling technique based on particle swarm optimization algorithm in cloud environment. In: Ray K, Sharma TK, Rawat S, Saini RK, Bandyopadhyay A (eds) Soft computing: theories and applications. Springer, Singapore, pp 525\u2013536"},{"key":"6167_CR42","doi-asserted-by":"publisher","DOI":"10.3390\/app9224815","author":"LV Tran","year":"2019","unstructured":"Tran LV, Huynh BH, Akhtar H (2019) Ant colony optimization algorithm for maintenance, repair and overhaul scheduling optimization in the context of industrie 40. Appl Sci. https:\/\/doi.org\/10.3390\/app9224815","journal-title":"Appl Sci"},{"key":"6167_CR43","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1016\/j.cie.2018.06.017","volume":"123","author":"J Pang","year":"2018","unstructured":"Pang J, Zhou H, Tsai Y-C, Chou F-D (2018) A scatter simulated annealing algorithm for the bi-objective scheduling problem for the wet station of semiconductor manufacturing. Comput Ind Eng 123:54\u201366. https:\/\/doi.org\/10.1016\/j.cie.2018.06.017","journal-title":"Comput Ind Eng"},{"issue":"3","key":"6167_CR44","doi-asserted-by":"publisher","first-page":"641","DOI":"10.1080\/00207543.2011.644819","volume":"51","author":"J Gao","year":"2013","unstructured":"Gao J, Chen R, Deng W (2013) An efficient tabu search algorithm for the distributed permutation flowshop scheduling problem. Int J Prod Res 51(3):641\u2013651. https:\/\/doi.org\/10.1080\/00207543.2011.644819","journal-title":"Int J Prod Res"},{"key":"6167_CR45","unstructured":"Vinyals O, Fortunato M, Jaitly N (2015) Pointer networks. In: Cortes C, Lawrence ND, Lee DD, Sugiyama M, Garnett R (eds) Advances in Neural Information Processing Systems, vol 28, pp 2692\u20132700"},{"key":"6167_CR46","unstructured":"Bello I, Pham H, Le Q, Norouzi M, Bengio S (2016) Neural combinatorial optimization with reinforcement learning. arXiv preprint arXiv:1611.09940"},{"key":"6167_CR47","unstructured":"Ma Q, Ge S, He D, Thaker D, Drori I (2019) Combinatorial optimization by graph pointer networks and hierarchical reinforcement learning. arXiv preprint arXiv:1911.04936"},{"key":"6167_CR48","doi-asserted-by":"publisher","first-page":"109572","DOI":"10.1016\/j.comnet.2023.109572","volume":"223","author":"X Ju","year":"2023","unstructured":"Ju X, Su S, Xu C, Wang H (2023) Computation offloading and tasks scheduling for the internet of vehicles in edge computing: a deep reinforcement learning-based pointer network approach. Computer Netw 223:109572. https:\/\/doi.org\/10.1016\/j.comnet.2023.109572","journal-title":"Computer Netw"},{"key":"6167_CR49","doi-asserted-by":"publisher","first-page":"106778","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":"6167_CR50","doi-asserted-by":"publisher","first-page":"176","DOI":"10.1007\/978-3-030-58942-4_12","volume-title":"Integration of constraint programming, artificial intelligence, and operations research","author":"M Etheve","year":"2020","unstructured":"Etheve M, Al\u00e8s Z, Bissuel C, Juan O, Kedad-Sidhoum S (2020) Reinforcement learning for variable selection in a branch and bound algorithm. In: Hebrard E, Musliu N (eds) Integration of constraint programming, artificial intelligence, and operations research. Springer, Cham, pp 176\u2013185"},{"key":"6167_CR51","doi-asserted-by":"publisher","DOI":"10.1109\/TASE.2023.3244331","author":"T Li","year":"2023","unstructured":"Li T, Meng Y, Tang L (2023) Scheduling of continuous annealing with a multi-objective differential evolution algorithm based on deep reinforcement learning. IEEE Trans Autom Sci Eng. https:\/\/doi.org\/10.1109\/TASE.2023.3244331","journal-title":"IEEE Trans Autom Sci Eng"},{"issue":"1","key":"6167_CR52","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1109\/TSMC.2023.3305541","volume":"54","author":"R Li","year":"2024","unstructured":"Li R, Gong W, Wang L, Lu C, Dong C (2024) Co-evolution with deep reinforcement learning for energy-aware distributed heterogeneous flexible job shop scheduling. IEEE Trans Syst Man Cybern Syst 54(1):201\u2013211. https:\/\/doi.org\/10.1109\/TSMC.2023.3305541","journal-title":"IEEE Trans Syst Man Cybern Syst"},{"key":"6167_CR53","doi-asserted-by":"publisher","unstructured":"Qu S, Wang J, Shivani G (2016) Learning adaptive dispatching rules for a manufacturing process system by using reinforcement learning approach. In: 2016 IEEE 21st International Conference on Emerging Technologies and Factory Automation (ETFA), pp. 1\u20138. https:\/\/doi.org\/10.1109\/ETFA.2016.7733712","DOI":"10.1109\/ETFA.2016.7733712"},{"issue":"2","key":"6167_CR54","doi-asserted-by":"publisher","first-page":"418","DOI":"10.1016\/j.ejor.2021.10.032","volume":"300","author":"Y Zhang","year":"2022","unstructured":"Zhang Y, Bai R, Qu R, Tu C, Jin J (2022) A deep reinforcement learning based hyper-heuristic for combinatorial optimisation with uncertainties. Eur J Oper Res 300(2):418\u2013427. https:\/\/doi.org\/10.1016\/j.ejor.2021.10.032","journal-title":"Eur J Oper Res"},{"key":"6167_CR55","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2022.3208942","author":"Y Du","year":"2022","unstructured":"Du Y, Li J, Li C, Duan P (2022) A reinforcement learning approach for flexible job shop scheduling problem with crane transportation and setup times. IEEE Trans Neural Netw Learn Syst. https:\/\/doi.org\/10.1109\/TNNLS.2022.3208942","journal-title":"IEEE Trans Neural Netw Learn Syst"},{"key":"6167_CR56","doi-asserted-by":"publisher","DOI":"10.1007\/s10845-023-02161-w","author":"Z Wang","year":"2023","unstructured":"Wang Z, Liao W (2023) Smart scheduling of dynamic job shop based on discrete event simulation and deep reinforcement learning. J Intell Manuf. https:\/\/doi.org\/10.1007\/s10845-023-02161-w","journal-title":"J Intell Manuf"},{"key":"6167_CR57","doi-asserted-by":"publisher","first-page":"109255","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:109255. https:\/\/doi.org\/10.1016\/j.cie.2023.109255","journal-title":"Comput Ind Eng"},{"key":"6167_CR58","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1016\/j.jmsy.2023.11.010","volume":"72","author":"J Zhou","year":"2024","unstructured":"Zhou J, Zheng L, Fan W (2024) Multirobot collaborative task dynamic scheduling based on multiagent reinforcement learning with heuristic graph convolution considering robot service performance. J Manuf Syst 72:122\u2013141. https:\/\/doi.org\/10.1016\/j.jmsy.2023.11.010","journal-title":"J Manuf Syst"},{"key":"6167_CR59","doi-asserted-by":"publisher","first-page":"710","DOI":"10.1016\/j.jclepro.2018.11.021","volume":"210","author":"L Meng","year":"2019","unstructured":"Meng L, Zhang C, Shao X, Ren Y (2019) Milp models for energy-aware flexible job shop scheduling problem. J Clean Prod 210:710\u2013723. https:\/\/doi.org\/10.1016\/j.jclepro.2018.11.021","journal-title":"J Clean Prod"},{"key":"6167_CR60","doi-asserted-by":"publisher","first-page":"106347","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. https:\/\/doi.org\/10.1016\/j.cie.2020.106347","journal-title":"Comput Ind Eng"},{"key":"6167_CR61","doi-asserted-by":"publisher","unstructured":"Puterman ML (2009) Markov decision processes: discrete stochastic dynamic programming. Vol. 414. Wiley, Hoboken. https:\/\/doi.org\/10.1002\/9780470316887","DOI":"10.1002\/9780470316887"},{"key":"6167_CR62","unstructured":"Schulman J, Wolski F, Dhariwal P, Radford A, Klimov O (2017) Proximal policy optimization algorithms. arXiv preprint arXiv:1707.06347"},{"key":"6167_CR63","unstructured":"Schulman J, Moritz P, Levine S, Jordan M, Abbeel P (2015) High-dimensional continuous control using generalized advantage estimation. arXiv preprint arXiv:1506.02438"},{"key":"6167_CR64","doi-asserted-by":"publisher","unstructured":"Van\u00a0Veldhuizen DA, Lamont GB (2000) On measuring multiobjective evolutionary algorithm performance. In: Proceedings of the 2000 Congress on Evolutionary Computation. CEC00 (Cat. No.00TH8512), vol 1, pp 204\u20132111. https:\/\/doi.org\/10.1109\/CEC.2000.870296","DOI":"10.1109\/CEC.2000.870296"},{"issue":"4","key":"6167_CR65","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1109\/4235.797969","volume":"3","author":"E Zitzler","year":"1999","unstructured":"Zitzler E, Thiele L (1999) Multiobjective evolutionary algorithms: a comparative case study and the strength pareto approach. IEEE Trans Evol Comput 3(4):257\u2013271. https:\/\/doi.org\/10.1109\/4235.797969","journal-title":"IEEE Trans Evol Comput"},{"issue":"4","key":"6167_CR66","doi-asserted-by":"publisher","first-page":"647","DOI":"10.1016\/j.cie.2010.07.014","volume":"59","author":"J-Q Li","year":"2010","unstructured":"Li J-Q, Pan Q-K, Liang Y-C (2010) An effective hybrid tabu search algorithm for multi-objective flexible job-shop scheduling problems. Comput Ind Eng 59(4):647\u2013662. https:\/\/doi.org\/10.1016\/j.cie.2010.07.014","journal-title":"Comput Ind Eng"},{"key":"6167_CR67","doi-asserted-by":"publisher","unstructured":"Murata T, Ishibuchi H (1996) Positive and negative combination effects of crossover and mutation operators in sequencing problems. In: Proceedings of IEEE International Conference on Evolutionary Computation, pp 170\u2013175. https:\/\/doi.org\/10.1109\/ICEC.1996.542355","DOI":"10.1109\/ICEC.1996.542355"},{"key":"6167_CR68","first-page":"193","volume":"9","author":"BL Miller","year":"1995","unstructured":"Miller BL, Goldberg DE (1995) Genetic algorithms, tournament selection, and the effects of noise. Complex Syst 9:193\u2013921","journal-title":"Complex Syst"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-024-06167-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11227-024-06167-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-024-06167-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,25]],"date-time":"2024-07-25T10:14:10Z","timestamp":1721902450000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11227-024-06167-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,5,22]]},"references-count":68,"journal-issue":{"issue":"13","published-print":{"date-parts":[[2024,9]]}},"alternative-id":["6167"],"URL":"https:\/\/doi.org\/10.1007\/s11227-024-06167-w","relation":{},"ISSN":["0920-8542","1573-0484"],"issn-type":[{"type":"print","value":"0920-8542"},{"type":"electronic","value":"1573-0484"}],"subject":[],"published":{"date-parts":[[2024,5,22]]},"assertion":[{"value":"27 April 2024","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 May 2024","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 that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}