{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T05:25:32Z","timestamp":1774934732948,"version":"3.50.1"},"reference-count":55,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2025,2,25]],"date-time":"2025-02-25T00:00:00Z","timestamp":1740441600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,2,25]],"date-time":"2025-02-25T00:00:00Z","timestamp":1740441600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"name":"the Key Scientific Research Projects of Higher Education of Henan Province","award":["19A460034"],"award-info":[{"award-number":["19A460034"]}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["U1904167"],"award-info":[{"award-number":["U1904167"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"the Key Research and Development Special Program of Henan Province","award":["231111221200"],"award-info":[{"award-number":["231111221200"]}]},{"name":"the Humanities and Social Sciences of Ministry of Education Planning Fund","award":["23YJAZH193"],"award-info":[{"award-number":["23YJAZH193"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Cluster Comput"],"published-print":{"date-parts":[[2025,8]]},"DOI":"10.1007\/s10586-024-04970-x","type":"journal-article","created":{"date-parts":[[2025,2,25]],"date-time":"2025-02-25T10:05:01Z","timestamp":1740477901000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":33,"title":["Research on dynamic job shop scheduling problem with AGV based on DQN"],"prefix":"10.1007","volume":"28","author":[{"given":"Zhengfeng","family":"Li","sequence":"first","affiliation":[]},{"given":"Wengpeng","family":"Gu","sequence":"additional","affiliation":[]},{"given":"Huichao","family":"Shang","sequence":"additional","affiliation":[]},{"given":"Guohui","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Gaofeng","family":"Zhou","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,2,25]]},"reference":[{"issue":"6","key":"4970_CR1","doi-asserted-by":"publisher","first-page":"1058","DOI":"10.1287\/opre.43.6.1058","volume":"43","author":"\u00dc Bilge","year":"1995","unstructured":"Bilge, \u00dc., G\u00fcnd\u00fcz, U.: A time window approach to simultaneous scheduling of machines and material handling system in an FMS. Oper. Res. 43(6), 1058\u20131070 (1995)","journal-title":"Oper. Res."},{"issue":"2","key":"4970_CR2","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1080\/0020754032000123579","volume":"42","author":"TF Abdelmaguid","year":"2004","unstructured":"Abdelmaguid, T.F., Ashraf, O.N., Badawia, A.K., Mohamed, F.H.: A Hybrid GA\/heuristic approach to the simultaneous scheduling of machines and automated guided vehicles. Int. J. Prod. Res. 42(2), 267\u2013281 (2004)","journal-title":"Int. J. Prod. Res."},{"issue":"1","key":"4970_CR3","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1016\/j.ejor.2003.10.034","volume":"162","author":"J Hurink","year":"2005","unstructured":"Hurink, J., Sigrid, K.: Tabu search algorithms for job-shop problems with a single transport robot. Eur. J. Oper. Res. 162(1), 99\u2013111 (2005)","journal-title":"Eur. J. Oper. Res."},{"issue":"3","key":"4970_CR4","doi-asserted-by":"publisher","first-page":"1818","DOI":"10.1016\/j.ejor.2005.02.077","volume":"175","author":"G El Khayat","year":"2006","unstructured":"El Khayat, G., Andr\u00e9, L., Diane, R.: Integrated production and material handling scheduling using mathematical programming and constraint programming. Eur. J. Oper. Res. 175(3), 1818\u20131832 (2006)","journal-title":"Eur. J. Oper. Res."},{"issue":"8","key":"4970_CR5","doi-asserted-by":"publisher","first-page":"2143","DOI":"10.1080\/00207540600818286","volume":"46","author":"L Deroussi","year":"2008","unstructured":"Deroussi, L., Gourgand, M., Tchernev, N.: A simple metaheuristic approach to the simultaneous scheduling of machines and automated guided vehicles. Int. J. Prod. Res. 46(8), 2143\u20132164 (2008)","journal-title":"Int. J. Prod. Res."},{"issue":"3","key":"4970_CR6","doi-asserted-by":"publisher","first-page":"706","DOI":"10.1016\/j.ejor.2008.03.051","volume":"199","author":"A Caumond","year":"2009","unstructured":"Caumond, A., Lacomme, P., Moukrim, A., Tchernev, N.: An MILP for scheduling problems in an FMS with one vehicle. Eur. J. Oper. Res. 199(3), 706\u2013722 (2009)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"4970_CR7","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1016\/j.ijpe.2010.07.012","volume":"143","author":"P Lacomme","year":"2013","unstructured":"Lacomme, P., Larabi, M., Tchernev, N.: Job-Shop based framework for simultaneous scheduling of machines and automated guided vehicles. Int. J. Prod. Econ. 143(1), 24\u201334 (2013)","journal-title":"Int. J. Prod. Econ."},{"issue":"19","key":"4970_CR8","doi-asserted-by":"publisher","first-page":"5748","DOI":"10.1080\/00207543.2014.910628","volume":"52","author":"Y Zheng","year":"2014","unstructured":"Zheng, Y., Yujie, X., Yoonho, S.: A Tabu search algorithm for simultaneous machine\/AGV scheduling problem. Int. J. Prod. Res. 52(19), 5748\u20135763 (2014)","journal-title":"Int. J. Prod. Res."},{"key":"4970_CR9","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1016\/j.cie.2015.01.003","volume":"86","author":"M Saidi-Mehrabad","year":"2015","unstructured":"Saidi-Mehrabad, M., Dehnavi-Arani, S., Farshid, E., Vahid, M.: An ant colony algorithm (ACA) for solving the new integrated model of job shop scheduling and conflict-free routing of AGVs. Comp. Ind. Eng. 86, 2\u201313 (2015)","journal-title":"Comp. Ind. Eng."},{"key":"4970_CR10","unstructured":"Dai, M., Dunbing T., Adriana G., and Miguel A. S.: Multi-objective optimization for energy-efficient flexible job shop scheduling problem with transportation constraints. Robot. Comp. Integr. Manufact. 59 (2019)."},{"key":"4970_CR11","doi-asserted-by":"publisher","first-page":"106749","DOI":"10.1016\/j.cie.2020.106749","volume":"149","author":"H Hu","year":"2020","unstructured":"Hu, H., Xiaoliang, J., Qixuan, H., Shifeng, F., Kuo, L.: Deep reinforcement learning based AGVs real-time scheduling with mixed rule for flexible shop floor in industry 40. Comp. Ind. Eng. 149, 106749 (2020)","journal-title":"Comp. Ind. Eng."},{"issue":"3","key":"4970_CR12","doi-asserted-by":"publisher","first-page":"813","DOI":"10.1080\/00207543.2019.1709671","volume":"59","author":"A Ham","year":"2021","unstructured":"Ham, A.: Transfer-robot task scheduling in job shop. Int. J. Prod. Res. 59(3), 813\u2013823 (2021)","journal-title":"Int. J. Prod. Res."},{"key":"4970_CR13","doi-asserted-by":"publisher","DOI":"10.1016\/j.rcim.2021.102198","volume":"72","author":"J Yan","year":"2021","unstructured":"Yan, J., Zhifeng, L., Caixia, Z., Tao, Z., Yueze, Z., Congbin, Y.: Research on flexible job shop scheduling under finite transportation conditions for digital twin workshop. Robot. Comp.-Integr. Manufact. 72, 102198 (2021)","journal-title":"Robot. Comp.-Integr. Manufact."},{"issue":"18","key":"4970_CR14","doi-asserted-by":"publisher","first-page":"5675","DOI":"10.1080\/00207543.2021.1968526","volume":"60","author":"W Ren","year":"2022","unstructured":"Ren, W., Yan, Y., Yaoguang, H., Yu, G.: Joint optimisation for dynamic flexible job-shop scheduling problem with transportation time and resource constraints. Int. J. Prod. Res. 60(18), 5675\u20135696 (2022)","journal-title":"Int. J. Prod. Res."},{"issue":"3","key":"4970_CR15","doi-asserted-by":"publisher","first-page":"1140","DOI":"10.1016\/j.ejor.2022.09.006","volume":"306","author":"DBMM Fontes","year":"2023","unstructured":"Fontes, D.B.M.M., Mahdi Homayouni, S., Gon\u00e7alves, J.F.: A hybrid particle swarm optimization and simulated annealing algorithm for the job shop scheduling problem with transport resources. Euro. J. Oper. Res. 306(3), 1140\u20131157 (2023)","journal-title":"Euro. J. Oper. Res."},{"issue":"8","key":"4970_CR16","doi-asserted-by":"publisher","first-page":"3815","DOI":"10.3390\/s23083815","volume":"23","author":"L Meng","year":"2023","unstructured":"Meng, L., Weiyao, C., Biao, Z., Wenqiang, Z., Weikang, F., Peng, D.: An improved genetic algorithm for solving the multi-AGV flexible job shop scheduling problem. Sensors 23(8), 3815 (2023)","journal-title":"Sensors"},{"issue":"6","key":"4970_CR17","doi-asserted-by":"publisher","first-page":"1590","DOI":"10.1109\/TEVC.2022.3219238","volume":"27","author":"Z Pan","year":"2023","unstructured":"Pan, Z., Ling, W., Jie, Z., Jing-Fang, C., Xing, W.: A learning-based multipopulation evolutionary optimization for flexible job shop scheduling problem with finite transportation resources. IEEE Trans. Evol. Comput. 27(6), 1590\u20131603 (2023)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"4970_CR18","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1016\/j.jmsy.2023.03.011","volume":"68","author":"K Sanogo","year":"2023","unstructured":"Sanogo, K., Abdelkader, M.B., Hammed Sahnoun, M., Bettayeb, B., Abderrahim, M., Bekrar, A.: A multi-agent system simulation based approach for collision avoidance in integrated job-shop scheduling problem with transportation tasks. J. Manufact. Syst. 68, 209\u2013226 (2023)","journal-title":"J. Manufact. Syst."},{"key":"4970_CR19","doi-asserted-by":"crossref","unstructured":"Yuan, M., Liang Z., Hanyu H., Kaiwen Z., Fengque P., Wenbin G.: Research on flexible job shop scheduling problem with AGV using double DQN. J. Intell. Manufact. 1\u201327 (2023).","DOI":"10.1007\/s10845-023-02252-8"},{"key":"4970_CR20","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2024.101538","volume":"86","author":"X Han","year":"2024","unstructured":"Han, X., Weiyao, C., Leilei, M., Biao, Z., Kaizhou, G., Chaoyong, Z., Peng, D.: A dual population collaborative genetic algorithm for solving flexible job shop scheduling problem with AGV. Swarm Evol. Comput. 86, 101538 (2024)","journal-title":"Swarm Evol. Comput."},{"key":"4970_CR21","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2024.101544","volume":"87","author":"Y Yao","year":"2024","unstructured":"Yao, Y., Xinyu, L., Liang, G.: A DQN-based memetic algorithm for energy-efficient job shop scheduling problem with integrated limited AGVs. Swarm Evol. Comput. 87, 101544 (2024)","journal-title":"Swarm Evol. Comput."},{"issue":"4","key":"4970_CR22","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1007\/s10951-008-0090-8","volume":"12","author":"D Ouelhadj","year":"2009","unstructured":"Ouelhadj, D., Sanja, P.: A survey of dynamic scheduling in manufacturing systems. J. Sched. 12(4), 417\u2013431 (2009)","journal-title":"J. Sched."},{"issue":"12","key":"4970_CR23","doi-asserted-by":"publisher","first-page":"3516","DOI":"10.1080\/00207543.2012.751509","volume":"51","author":"L Zhang","year":"2013","unstructured":"Zhang, L., Liang, G., Xinyu, L.: A hybrid genetic algorithm and tabu search for a multi-objective dynamic job shop scheduling problem. Int. J. Prod. Res. 51(12), 3516\u20133531 (2013)","journal-title":"Int. J. Prod. Res."},{"key":"4970_CR24","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1016\/j.future.2020.02.019","volume":"108","author":"J Luo","year":"2020","unstructured":"Luo, J., El Didier, B., Rui, X., Jinglu, H.: Solving the dynamic energy aware job shop scheduling problem with the heterogeneous parallel genetic algorithm. Futur. Gener. Comput. Syst. 108, 119\u2013134 (2020)","journal-title":"Futur. Gener. Comput. Syst."},{"key":"4970_CR25","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2019.100594","volume":"51","author":"Z Wang","year":"2019","unstructured":"Wang, Z., Jihui, Z., Shengxiang, Y.: An improved particle swarm optimization algorithm for dynamic job shop scheduling problems with random job arrivals. Swarm Evol. Comput. 51, 100594 (2019)","journal-title":"Swarm Evol. Comput."},{"issue":"8","key":"4970_CR26","doi-asserted-by":"publisher","first-page":"909","DOI":"10.3390\/math9080909","volume":"9","author":"H Zhang","year":"2021","unstructured":"Zhang, H., Borut, B., Xueyan, L., Robert, O.: Advanced metaheuristic method for decision-making in a dynamic job shop scheduling environment. Mathematics 9(8), 909 (2021)","journal-title":"Mathematics"},{"issue":"19","key":"4970_CR27","doi-asserted-by":"publisher","first-page":"5867","DOI":"10.1080\/00207543.2020.1794075","volume":"59","author":"H Wang","year":"2021","unstructured":"Wang, H., Bhaba, R.S., Jing, L., Jian, L.: Adaptive scheduling for assembly job shop with uncertain assembly times based on dual Q-learning. Int. J. Prod. Res. 59(19), 5867\u20135883 (2021)","journal-title":"Int. J. Prod. Res."},{"key":"4970_CR28","doi-asserted-by":"publisher","first-page":"122995","DOI":"10.1109\/ACCESS.2021.3110242","volume":"9","author":"Y Zhao","year":"2021","unstructured":"Zhao, Y., Yanhong, W., Yuanyuan, T., Jun, Z., Hongxia, Y.: Dynamic jobshop scheduling algorithm based on deep Q network. IEEE Access 9, 122995\u2013123011 (2021)","journal-title":"IEEE Access"},{"issue":"6","key":"4970_CR29","doi-asserted-by":"publisher","first-page":"2593","DOI":"10.1007\/s10845-023-02161-w","volume":"35","author":"Z Wang","year":"2024","unstructured":"Wang, Z., Wenzhu, L.: Smart scheduling of dynamic job shop based on discrete event simulation and deep reinforcement learning. J. Intell. Manuf. 35(6), 2593\u20132610 (2024)","journal-title":"J. Intell. Manuf."},{"key":"4970_CR30","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2023.106294","volume":"159","author":"R Liu","year":"2023","unstructured":"Liu, R., Rajesh, P., Carlos, T.: A deep multi-agent reinforcement learning approach to solve dynamic job shop scheduling problem. Comput. Oper. Res. 159, 106294 (2023)","journal-title":"Comput. Oper. Res."},{"key":"4970_CR31","unstructured":"Zeng, Y.: Hybrid intelligence for dynamic job-shop scheduling with deep reinforcement learning and attention mechanism. arXiv preprint arXiv:2201.00548 (2022)"},{"key":"4970_CR32","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2022.109717","volume":"131","author":"H Wang","year":"2022","unstructured":"Wang, H., Junfu, C., Chang, L., Yuanyuan, Z., Shunfang, H., Liangyin, C.: Multi-objective reinforcement learning framework for dynamic flexible job shop scheduling problem with uncertain events. Appl. Soft Comput. 131, 109717 (2022)","journal-title":"Appl. Soft Comput."},{"issue":"13","key":"4970_CR33","doi-asserted-by":"publisher","first-page":"4049","DOI":"10.1080\/00207543.2022.2058432","volume":"60","author":"R Liu","year":"2022","unstructured":"Liu, R., Rajesh, P., Carlos, T.: Deep reinforcement learning for dynamic scheduling of a flexible job shop. Int. J. Prod. Res. 60(13), 4049\u20134069 (2022)","journal-title":"Int. J. Prod. Res."},{"key":"4970_CR34","doi-asserted-by":"publisher","DOI":"10.1016\/j.rcim.2021.102283","volume":"74","author":"Y Li","year":"2022","unstructured":"Li, Y., Wenbin, G., Minghai, Y., Yaming, T.: Real-time data-driven dynamic scheduling for flexible job shop with insufficient transportation resources using hybrid deep Q network. Robot. Comp.-Integr.Manufact. 74, 102283 (2022)","journal-title":"Robot. Comp.-Integr.Manufact."},{"issue":"1","key":"4970_CR35","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1007\/s11590-020-01674-0","volume":"16","author":"M Abderrahim","year":"2022","unstructured":"Abderrahim, M., Abdelghani, B., Damien, T., Nassima, A., Karim, B.: Bi-local search based variable neighborhood search for job-shop scheduling problem with transport constraints. Optim. Lett. 16(1), 255\u2013280 (2022)","journal-title":"Optim. Lett."},{"key":"4970_CR36","doi-asserted-by":"publisher","DOI":"10.1016\/j.rcim.2022.102506","volume":"81","author":"Y-J Yao","year":"2023","unstructured":"Yao, Y.-J., Qi-Hao, L., Xin-Yu, L., Liang, G.: A novel MILP model for job shop scheduling problem with mobile robots. Robot. Comp.-Integr. Manufact. 81, 102506 (2023)","journal-title":"Robot. Comp.-Integr. Manufact."},{"issue":"6","key":"4970_CR37","doi-asserted-by":"publisher","first-page":"553","DOI":"10.1016\/j.rcim.2004.07.003","volume":"20","author":"W Yi-Chi","year":"2004","unstructured":"Yi-Chi, W., Usher, J.: Learning policies for single machine job dispatching. Robot. Comp.-Integr.Manufact. 20(6), 553\u2013562 (2004)","journal-title":"Robot. Comp.-Integr.Manufact."},{"issue":"1","key":"4970_CR38","doi-asserted-by":"publisher","first-page":"15890","DOI":"10.1016\/j.ifacol.2017.08.2354","volume":"50","author":"W Bouazza","year":"2017","unstructured":"Bouazza, W., Yves, S., Bouziane, B.: A distributed approach solving partially flexible job-shop scheduling problem with a Q-learning effect. IFAC-PapersOnLine 50(1), 15890\u201315895 (2017)","journal-title":"IFAC-PapersOnLine"},{"issue":"2","key":"4970_CR39","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1007\/s10845-018-1454-3","volume":"31","author":"W Yu-Fang","year":"2020","unstructured":"Yu-Fang, W.: Adaptive job shop scheduling strategy based on weighted Q-learning algorithm. J. Intell. Manufact. 31(2), 417\u2013432 (2020)","journal-title":"J. Intell. Manufact."},{"issue":"23","key":"4970_CR40","doi-asserted-by":"publisher","first-page":"13016","DOI":"10.3390\/su132313016","volume":"13","author":"R Naimi","year":"2021","unstructured":"Naimi, R., Maroua, N., Olivier, C.: A Q-learning rescheduling approach to the flexible job shop problem combining energy and productivity objectives. Sustainability 13(23), 13016 (2021)","journal-title":"Sustainability"},{"key":"4970_CR41","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., Mohammad, A.A., Masoud, M.: A reinforcement learning approach to parameter estimation in dynamic job shop scheduling. Comput. Ind. Eng. 110, 75\u201382 (2017)","journal-title":"Comput. Ind. Eng."},{"key":"4970_CR42","doi-asserted-by":"crossref","unstructured":"Qu, S., Jie, W., Govil, S.: 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. IEEE (2016)","DOI":"10.1109\/ETFA.2016.7733712"},{"key":"4970_CR43","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2020.106208","volume":"91","author":"S Luo","year":"2020","unstructured":"Luo, S.: Dynamic scheduling for flexible job shop with new job insertions by deep reinforcement learning. Appl. Soft Comput. 91, 106208 (2020)","journal-title":"Appl. Soft Comput."},{"key":"4970_CR44","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2023.109255","volume":"180","author":"Y Gui","year":"2023","unstructured":"Gui, Y., Dunbing, T., Haihua, Z., Yi, Z., Zequn, Z.: Dynamic scheduling for flexible job shop using a deep reinforcement learning approach. Comput. Ind. Eng. 180, 109255 (2023)","journal-title":"Comput. Ind. Eng."},{"issue":"4","key":"4970_CR45","doi-asserted-by":"publisher","first-page":"760","DOI":"10.3390\/pr10040760","volume":"10","author":"J Chang","year":"2022","unstructured":"Chang, J., Dong, Y., Yi, H., Wuwei, H., Haoyu, Y.: Deep reinforcement learning for dynamic flexible job shop scheduling with random job arrival. Processes 10(4), 760 (2022)","journal-title":"Processes"},{"issue":"7","key":"4970_CR46","doi-asserted-by":"publisher","first-page":"2018","DOI":"10.3390\/pr11072018","volume":"11","author":"Z Wu","year":"2023","unstructured":"Wu, Z., Hongbo, F., Yimeng, S., Manyu, P.: Efficient multi-objective optimization on dynamic flexible job shop scheduling using deep reinforcement learning approach. Processes 11(7), 2018 (2023)","journal-title":"Processes"},{"key":"4970_CR47","doi-asserted-by":"publisher","first-page":"107969","DOI":"10.1016\/j.comnet.2021.107969","volume":"190","author":"L Wang","year":"2021","unstructured":"Wang, L., Xin, H., Yin, W., Sujie, X., Shijun, M., Kexin, Y., Zhijun, L., Weidong, W.: Dynamic job-shop scheduling in smart manufacturing using deep reinforcement learning. Comp. Netw. 190, 107969 (2021)","journal-title":"Comp. Netw."},{"key":"4970_CR48","doi-asserted-by":"publisher","DOI":"10.1016\/j.rcim.2022.102412","volume":"78","author":"Y Zhang","year":"2022","unstructured":"Zhang, Y., Haihua, Z., Dunbing, T., Tong, Z., Yong, G.: Dynamic job shop scheduling based on deep reinforcement learning for multi-agent manufacturing systems. Robot. Comp. Integr. Manufact. 78, 102412 (2022)","journal-title":"Robot. Comp. Integr. Manufact."},{"issue":"3","key":"4970_CR49","doi-asserted-by":"publisher","first-page":"2912","DOI":"10.1109\/TASE.2023.3271666","volume":"21","author":"L Zhao","year":"2024","unstructured":"Zhao, L., Jiaxin, F., Chunjiang, Z., Weiming, S., Jing, Z.: A DRL-based reactive scheduling policy for flexible job shops with random job arrivals. IEEE Trans. Autom. Sci. Eng. 21(3), 2912\u20132923 (2024)","journal-title":"IEEE Trans. Autom. Sci. Eng."},{"key":"4970_CR50","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., Yi, F., Qinge, X., Yunlang, X., Di, L., Dongsheng, Y., Zhile, Y.: Deep reinforcement learning for dynamic flexible job shop scheduling problem considering variable processing times. J. Manuf. Syst. 71, 257\u2013273 (2023)","journal-title":"J. Manuf. Syst."},{"key":"4970_CR51","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2023.109718","volume":"186","author":"M Zhang","year":"2023","unstructured":"Zhang, M., Liang, W., Fusheng, Q., Xiaorui, L.: Dynamic scheduling for flexible job shop with insufficient transportation resources via graph neural network and deep reinforcement learning. Comput. Ind. Eng. 186, 109718 (2023)","journal-title":"Comput. Ind. Eng."},{"key":"4970_CR52","doi-asserted-by":"publisher","first-page":"186474","DOI":"10.1109\/ACCESS.2020.3029868","volume":"8","author":"H Bao-An","year":"2020","unstructured":"Bao-An, H., Jian-Jun, Y.: Research on adaptive job shop scheduling problems based on dueling double DQN. IEEE Access 8, 186474\u2013186495 (2020)","journal-title":"IEEE Access"},{"issue":"1","key":"4970_CR53","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1287\/opre.25.1.45","volume":"25","author":"SS Panwalkar","year":"1977","unstructured":"Panwalkar, S.S., Iskander, W.: A survey of scheduling rules. Oper. Res. 25(1), 45\u201361 (1977)","journal-title":"Oper. Res."},{"key":"4970_CR54","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1016\/j.procir.2019.02.119","volume":"79","author":"J Heger","year":"2019","unstructured":"Heger, J., Thomas, V.: Dynamic priority based dispatching of AGVs in Flexible Job Shops. Procedia CIRP 79, 445\u2013449 (2019)","journal-title":"Procedia CIRP"},{"issue":"1","key":"4970_CR55","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/S0925-5273(96)00068-0","volume":"48","author":"O Holthaus","year":"1997","unstructured":"Holthaus, O., Chandrasekharan, R.: Efficient dispatching rules for scheduling in a job shop. Int. J. Prod. Econ. 48(1), 87\u2013105 (1997)","journal-title":"Int. J. Prod. Econ."}],"container-title":["Cluster Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10586-024-04970-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10586-024-04970-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10586-024-04970-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,6]],"date-time":"2025-09-06T07:26:14Z","timestamp":1757143574000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10586-024-04970-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,2,25]]},"references-count":55,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2025,8]]}},"alternative-id":["4970"],"URL":"https:\/\/doi.org\/10.1007\/s10586-024-04970-x","relation":{},"ISSN":["1386-7857","1573-7543"],"issn-type":[{"value":"1386-7857","type":"print"},{"value":"1573-7543","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,2,25]]},"assertion":[{"value":"9 July 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 November 2024","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 December 2024","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 February 2025","order":4,"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 known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"236"}}