{"id":11608,"date":"2026-09-06T15:25:20","date_gmt":"2026-09-06T07:25:20","guid":{"rendered":"\/jase\/?post_type=tkuisotope&#038;p=11608"},"modified":"2026-09-06T16:54:07","modified_gmt":"2026-09-06T08:54:07","slug":"jase-202612-35-017","status":"publish","type":"tkuisotope","link":"\/jase\/?tkuisotope=jase-202612-35-017","title":{"rendered":"Research on Logistics Scheduling Model for Production Workshops Based on Deep Reinforcement Learning"},"content":{"rendered":"\n<div class=\"wp-block-tkuwpbs5-bs5-row row article-info\">\n<div class=\"wp-block-tkuwpbs5-bs5-column col-md-3 align-self-start\">\n<p><i class=\"fa fa-folder\" aria-hidden=\"true\"><\/i>&nbsp;<a href=\"\/jase\/?page_id=807\" data-type=\"page\" data-id=\"807\">2026<\/a><\/p>\n<\/div>\n\n\n\n<div class=\"wp-block-tkuwpbs5-bs5-column col-md-3 align-self-start\">\n<p><i class=\"fa fa-folder-open\" aria-hidden=\"true\"><\/i>&nbsp;<a href=\"\/jase\/?page_id=11162\" data-type=\"page\" data-id=\"11162\">Volume 35<\/a><\/p>\n<\/div>\n\n\n\n<div class=\"wp-block-tkuwpbs5-bs5-column col-md-6 align-self-start\">\n<div class=\"wp-block-tkuwpbs5-bs5-div dv_publish\" data-aos=\"normal\"><div class=\"wp-block-post-date\"><time datetime=\"2026-09-06T15:25:20+08:00\">2026-09-06<\/time><\/div><\/div>\n<\/div>\n<\/div>\n\n\n\n<div class=\"wp-block-tkuwpbs5-bs5-row row\">\n<div class=\"wp-block-tkuwpbs5-bs5-column col-md-5 align-self-start\">\n<div class=\"wp-block-tkuwpbs5-bs5-div au-ol\" data-aos=\"normal\">\n<p>Yan Wang, Xiufeng Cao<a href=\"mailto:caoxf@cque.edu.cn\"><i class=\"fa fa-envelope\"><\/i><\/a>, Xiaosuo Luo, and Bin Zhou<\/p>\n\n\n\n<p style=\"font-size:14px\">School of Artificial Intelligence, Chongqing University of Education, Chongqing 400065, China<\/p>\n<\/div>\n\n\n\n<div class=\"wp-block-tkuwpbs5-bs5-div\" style=\"margin-top:var(--wp--preset--spacing--40)\" data-aos=\"normal\">\n<p>Received: June 13, 2026<br>Accepted: August 14, 2026<br>Publication Date: September 06, 2026<\/p>\n<\/div>\n<\/div>\n\n\n\n<div class=\"wp-block-tkuwpbs5-bs5-column col-md-7 align-self-start clk=\u5716\u7247\"><img decoding=\"async\" src=\"\/jase\/wp-content\/uploads\/2026\/09\/35_017.jpg\" class=\"img-fluid img-fluid mx-auto d-block\" alt=\"\u4e0a\u50b3\u5716\u7247\">\n\n\n<p class=\"has-text-align-center\">Comparison of the results of different reinforcement algorithms<\/p>\n<\/div>\n<\/div>\n\n\n\n<p class=\"has-small-font-size\"><i class=\"fab fa-creative-commons\"><\/i>&nbsp;<strong>Copyright&nbsp;<\/strong>The Author(s). This is an open access article distributed under the terms of the&nbsp;<a rel=\"noreferrer noopener\" href=\"https:\/\/creativecommons.org\/licenses\/by\/4.0\/\" target=\"_blank\">Creative Commons Attribution&nbsp;License (CC BY 4.0)<\/a>, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are cited.<\/p>\n\n\n\n<p>Download Citation:  <a href=\"\/jase\/wp-content\/uploads\/2026\/09\/V35.0017.txt\" data-type=\"attachment\" data-id=\"11663\" target=\"_blank\" rel=\"noreferrer noopener\">BibTeX <\/a>| <a rel=\"noreferrer noopener\" href=\"http:\/\/dx.doi.org\/10.6180\/jase.202612_35.017\" target=\"_blank\">http:\/\/dx.doi.org\/10.6180\/jase.202612_35.017<\/a>  <\/p>\n\n\n\n<p class=\"btn btn-primary article-btn\"><a href=\"\/jase\/wp-content\/uploads\/2026\/09\/017_2026_1638_V35.pdf\" data-type=\"attachment\" data-id=\"11621\" target=\"_blank\" rel=\"noreferrer noopener\">Download PDF<\/a><\/p>\n\n\n\n<div style=\"height:24px\" aria-hidden=\"true\" class=\"wp-block-spacer\"><\/div>\n\n\n\n<p>Aiming at solving difficult problems with traditional methods of logistics scheduling in production workshops, a logistics scheduling model based on deep reinforcement learning is studied[cite: 15]. The proposed reinforcement learning method based on the Markov Decision Process fully explores the impact of various factors within the production workshop on logistics scheduling[cite: 15]. Meanwhile, its correlation is analyzed, and the scheduling problem of the production workshop is solved through the double deep Q-network (DDQN) algorithm[cite: 15]. Multi-source heterogeneous data such as people, machines, processes, and the environment in the manufacturing workshop will be processed and analyzed, which can extract the logical data for model training in the production workshop and guide the intelligence of the production workshop[cite: 15]. Experimental results show that this method has better time allocation and higher efficiency, has better advantages than other algorithms, and is more adaptable to dynamic environments[cite: 15]. Through the comparison of 100 experimental results, the probability of obtaining the optimal solution of the model by this method reaches 92%, and the working time obtained is shorter[cite: 15].<\/p>\n\n\n\n<p><em>Keywords:&nbsp;Markov decision, deep reinforcement learning, production workshop, logistics scheduling, DDQN<\/em><\/p>\n\n\n\n<div style=\"height:2rem\" aria-hidden=\"true\" class=\"wp-block-spacer\"><\/div>\n\n\n\n<div class=\"wp-block-tkuwpbs5-bs5-div ref_ol\" data-aos=\"normal\">\n<div class=\"container\">\n<div id=\"model-response-message-contentr_53180f64958e6cc2\" class=\"markdown markdown-main-panel md-content enable-luminous-fast-follows enable-updated-hr-color stronger\" dir=\"ltr\" aria-busy=\"false\" aria-live=\"polite\">\n<ol>\n<li data-path-to-node=\"0\">[1] J. Fu, B. Yang, Z. Chang, Y. Zhang, J. Wang, X. Wang, and L. Wang, (2025) &#8220;Integrated Production-Logistics Scheduling in Flexible Assembly Shops Using an Improved Genetic Algorithm&#8221; Machines 13(12): 1090. DOI: https:\/\/doi.org\/10.3390\/machines13121090.<\/li>\n<li data-path-to-node=\"0\">[2] Y. Fu, M. Zhou, X. Guo, L. Qi, K. Gao, and A. Albeshri, (2024) &#8220;Multiobjective scheduling of energy-efficient stochastic hybrid open shop with brain storm optimization and simulation evaluation&#8221; IEEE Transactions on Systems, Man, and Cybernetics: Systems 54(7): 4260-4272. DOI: https:\/\/doi.org\/10.1109\/TSMC.2024.3376292.<\/li>\n<li data-path-to-node=\"0\">[3] L. Sun, W. Shi, J. Wang, H. Mao, J. Tu, and L. Wang, (2023) &#8220;Research on production scheduling technology in knitting workshop based on improved genetic algorithm&#8221; Applied Sciences 13(9): 5701. DOI: https:\/\/doi.org\/10.3390\/app13095701.<\/li>\n<li data-path-to-node=\"0\">[4] L. Cai, W. Li, Y. Luo, and L. He, (2023) &#8220;Real-time scheduling simulation optimisation of job shop in a production-logistics collaborative environment&#8221; International Journal of Production Research 61(5): 1373-1393. DOI: https:\/\/doi.org\/10.1080\/00207543.2021.2023777.<\/li>\n<li data-path-to-node=\"0\">[5] R. Li, J. Mao, X. Wu, W. Zhou, C. Qian, and H. Du, (2026) &#8220;A new framework for job shop integrated scheduling and vehicle path planning problem&#8221; Sensors 26(2): 543. DOI: https:\/\/doi.org\/10.3390\/s26020543.<\/li>\n<li data-path-to-node=\"0\">[6] Z. Zhang, X. He, Y. Man, and Z. He, (2023) &#8220;Multi-objective scheduling in dynamic of household paper workshop considering energy consumption in production process&#8221; Journal of Smart Environments and Green Computing 3(3): 87-105. DOI: https:\/\/doi.org\/10.20517\/jsegc.2023.05.<\/li>\n<li data-path-to-node=\"0\">[7] J.-F. Chen, L. Wang, H. Ren, J. Pan, S. Wang, J. Zheng, and X. Wang, (2022) &#8220;An imitation learning-enhanced iterated matching algorithm for on-demand food delivery&#8221; IEEE Transactions on Intelligent Transportation Systems 23(10): 18603-18619. DOI: https:\/\/doi.org\/10.1109\/TITS.2022.3163263.<\/li>\n<li data-path-to-node=\"0\">[8] S. Li, M. Zhang, N. Wang, R. Cao, Z. Zhang, Y. Ji, H. Li, and H. Wang, (2023) &#8220;Intelligent scheduling method for multi-machine cooperative operation based on NSGA-III and improved ant colony algorithm&#8221; Computers and Electronics in Agriculture 204: 107532. DOI: https:\/\/doi.org\/10.1016\/j.compag.2022.107532.<\/li>\n<li data-path-to-node=\"0\">[9] A. D. Workneh, M. El Mouhtadi, and A. El Hilali Alaoui, (2024) &#8220;Deep reinforcement learning for adaptive flexible job shop scheduling: coping with variability and uncertainty&#8221; Smart Science 12(2): 387-405. DOI: https:\/\/doi.org\/10.1080\/23080477.2024.2345951.<\/li>\n<li data-path-to-node=\"0\">[10] Z.-j. Tao, X.-p. Chen, and P.-H. Koo, (2025) &#8220;Optimizing pricing strategies in cross-border green supply chains with revenue sharing and flexible exchange rate mechanisms: Z. Tao et al.&#8221; Operational Research 25(4): 101. DOI: https:\/\/doi.org\/10.1007\/s12351-025-00975-5.<\/li>\n<li data-path-to-node=\"0\">[11] J. Park, J. Chun, S. H. Kim, Y. Kim, and J. Park, (2021) &#8220;Learning to schedule job-shop problems: representation and policy learning using graph neural network and reinforcement learning&#8221; International Journal of Production Research 59(11): 3360-3377. DOI: https:\/\/doi.org\/10.1080\/00207543.2020.1870013.<\/li>\n<li data-path-to-node=\"0\">[12] K. Lei, P. Guo, Y. Wang, J. Zhang, X. Meng, and L. Qian, (2023) &#8220;Large-scale dynamic scheduling for flexible job-shop with random arrivals of new jobs by hierarchical reinforcement learning&#8221; IEEE Transactions on Industrial Informatics 20(1): 1007-1018. DOI: https:\/\/doi.org\/10.1109\/TII.2023.3272661.<\/li>\n<li data-path-to-node=\"0\">[13] Y. Di, L. Deng, and L. Zhang, (2024) &#8220;A collaborative-learning multi-agent reinforcement learning method for distributed hybrid flow shop scheduling problem&#8221; Swarm and Evolutionary Computation 91: 101764. DOI: https:\/\/doi.org\/10.1016\/j.swevo.2024.101764.<\/li>\n<li data-path-to-node=\"0\">[14] S. Liu, H. Zhu, L. Shen, Y. Li, and J. Zhang, (2026) &#8220;The end-to-end real-time scheduling method for hybrid flow shop based on heterogeneous cooperative multi-agent deep reinforcement learning&#8221; Journal of Manufacturing Systems 85: 487-512. DOI: https:\/\/doi.org\/10.1016\/j.jmsy.2026.02.011.<\/li>\n<li data-path-to-node=\"0\">[15] Z. Wu and M. Tu, (2024) &#8220;Workshop Logistics Planning for Small and Medium Manufacturing Enterprises Based on SLP Method-with a Furniture Manufacturing Factory as an Example&#8221; In: The International Conference on Artificial Intelligence and Logistics Engineering. Springer: 290-300. DOI: https:\/\/doi.org\/10.1007\/978-3-031-72017-8-27.<\/li>\n<li data-path-to-node=\"0\">[16] Z. He, N. Li, N. Ran, and L. Li, (2026) &#8220;Scheduling of flexible manufacturing systems based on place-timed petri nets and basis reachability graphs&#8221; IEEE Transactions on Control Systems Technology. DOI: https:\/\/doi.org\/10.1109\/TCST.2026.3664466.<\/li>\n<li data-path-to-node=\"0\">[17] D. Yang, Z. Cheng, W. Zhang, H. Zhang, and X. Shen, (2023) &#8220;Burst-aware time-triggered flow scheduling with enhanced multi-CQF in time-sensitive networks&#8221; IEEE\/ACM Transactions on Networking 31(6): 2809-2824. DOI: https:\/\/doi.org\/10.1109\/TNET.2023.3264583.<\/li>\n<li data-path-to-node=\"0\">[18] A. Ly, R. Dazeley, P. Vamplew, F. Cruz, and S. Aryal, (2024) &#8220;Elastic step DQN: A novel multi-step algorithm to alleviate overestimation in Deep Q-Networks&#8221; Neurocomputing 576: 127170. DOI: https:\/\/doi.org\/10.1016\/j.neucom.2023.127170.<\/li>\n<li data-path-to-node=\"0\">[19] M. F. Uslu, S. Uslu, and F. Bulut, (2022) &#8220;An adaptive hybrid approach: Combining genetic algorithm and ant colony optimization for integrated process planning and scheduling&#8221; Applied Computing and Informatics 18(1-2): 101-112. DOI: https:\/\/doi.org\/10.1016\/j.aci.2018.12.002.<\/li>\n<\/ol>\n<\/div>\n<\/div>\n<\/div>\n\n\n\n<p><\/p>\n","protected":false},"author":3,"template":"wp-custom-template-detail-4-aricles","meta":{"_uag_custom_page_level_css":""},"categories":[12,1956,6],"tags":[2097],"acf":[],"uagb_featured_image_src":[],"uagb_author_info":{"display_name":"\u6797\u923a\u6db5","author_link":"\/jase\/?author=3"},"uagb_comment_info":0,"uagb_excerpt":"&nbsp;Copyright&nbsp;The Author(s). This is an open access article distributed under the terms of the&nbsp;Creative Commons Attribution&nbsp;License (CC BY 4.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are cited. Download Citation: BibTeX | http:\/\/dx.doi.org\/10.6180\/jase.202612_35.017 Download PDF Aiming at solving difficult problems with traditional methods of logistics scheduling&hellip;","_links":{"self":[{"href":"\/jase\/index.php?rest_route=\/wp\/v2\/tkuisotope\/11608"}],"collection":[{"href":"\/jase\/index.php?rest_route=\/wp\/v2\/tkuisotope"}],"about":[{"href":"\/jase\/index.php?rest_route=\/wp\/v2\/types\/tkuisotope"}],"author":[{"embeddable":true,"href":"\/jase\/index.php?rest_route=\/wp\/v2\/users\/3"}],"wp:attachment":[{"href":"\/jase\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=11608"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"\/jase\/index.php?rest_route=%2Fwp%2Fv2%2Fcategories&post=11608"},{"taxonomy":"post_tag","embeddable":true,"href":"\/jase\/index.php?rest_route=%2Fwp%2Fv2%2Ftags&post=11608"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}