{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,15]],"date-time":"2026-04-15T23:52:27Z","timestamp":1776297147416,"version":"3.50.1"},"reference-count":56,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T00:00:00Z","timestamp":1775001600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T00:00:00Z","timestamp":1775001600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T00:00:00Z","timestamp":1775001600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T00:00:00Z","timestamp":1775001600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T00:00:00Z","timestamp":1775001600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T00:00:00Z","timestamp":1775001600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T00:00:00Z","timestamp":1775001600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62333016"],"award-info":[{"award-number":["62333016"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012166","name":"National Key Research and Development Program of China","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100012166","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012165","name":"Key Technologies Research and Development Program","doi-asserted-by":"publisher","award":["2021YFB1714700"],"award-info":[{"award-number":["2021YFB1714700"]}],"id":[{"id":"10.13039\/501100012165","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Computers & Operations Research"],"published-print":{"date-parts":[[2026,4]]},"DOI":"10.1016\/j.cor.2025.107380","type":"journal-article","created":{"date-parts":[[2025,12,29]],"date-time":"2025-12-29T16:58:07Z","timestamp":1767027487000},"page":"107380","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":1,"special_numbering":"C","title":["DGFFRL: Solving multi-machine collaborative scheduling based on Dual Graph Feature Fusion Reinforcement Learning"],"prefix":"10.1016","volume":"188","author":[{"given":"Wenbo","family":"Li","sequence":"first","affiliation":[]},{"given":"Puhai","family":"Yang","sequence":"additional","affiliation":[]},{"given":"Zhenyu","family":"Wu","sequence":"additional","affiliation":[]},{"given":"Junnan","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Chaoxu","family":"Mu","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"1","key":"10.1016\/j.cor.2025.107380_b1","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1007\/s10479-007-0283-0","article-title":"A branch and bound method for the job-shop problem with sequence-dependent setup times","volume":"159","author":"Artigues","year":"2008","journal-title":"Annals of Operations Research"},{"issue":"1","key":"10.1016\/j.cor.2025.107380_b2","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1137\/0803002","article-title":"A cutting plane approach to the sequential ordering problem (with applications to job scheduling in manufacturing)","volume":"3","author":"Ascheuer","year":"1993","journal-title":"SIAM J. Optim."},{"issue":"12","key":"10.1016\/j.cor.2025.107380_b3","doi-asserted-by":"crossref","first-page":"4004","DOI":"10.1080\/00207543.2021.1953181","article-title":"Internet of things (IoT) and big data analytics (BDA) for digital manufacturing (DM)","volume":"61","author":"Bi","year":"2023","journal-title":"Int. J. Prod. Res."},{"key":"10.1016\/j.cor.2025.107380_b4","doi-asserted-by":"crossref","first-page":"300","DOI":"10.1016\/j.cie.2015.12.007","article-title":"The vehicle routing problem: State of the art classification and review","volume":"99","author":"Braekers","year":"2016","journal-title":"Comput. Ind. Eng."},{"key":"10.1016\/j.cor.2025.107380_b5","doi-asserted-by":"crossref","DOI":"10.1016\/j.neucom.2023.126631","article-title":"A survey of dynamic pickup and delivery problems","author":"Cai","year":"2023","journal-title":"Neurocomputing"},{"key":"10.1016\/j.cor.2025.107380_b6","doi-asserted-by":"crossref","DOI":"10.1016\/j.cie.2021.107738","article-title":"An effective multi-population grey wolf optimizer based on reinforcement learning for flow shop scheduling problem with multi-machine collaboration","volume":"162","author":"Chen","year":"2021","journal-title":"Comput. Ind. Eng."},{"key":"10.1016\/j.cor.2025.107380_b7","doi-asserted-by":"crossref","DOI":"10.1016\/j.jclepro.2021.130133","article-title":"Industry 4.0 applications for sustainable manufacturing: A systematic literature review and a roadmap to sustainable development","volume":"334","author":"Ching","year":"2022","journal-title":"J. Clean. Prod."},{"key":"10.1016\/j.cor.2025.107380_b8","first-page":"2257","article-title":"Faster wasserstein distance estimation with the sinkhorn divergence","volume":"33","author":"Chizat","year":"2020","journal-title":"Advances in neural information processing systems"},{"key":"10.1016\/j.cor.2025.107380_b9","doi-asserted-by":"crossref","first-page":"383","DOI":"10.1016\/j.ijpe.2018.08.019","article-title":"The expected contribution of Industry 4.0 technologies for industrial performance","volume":"204","author":"Dalenogare","year":"2018","journal-title":"Int. J. Prod. Econ."},{"key":"10.1016\/j.cor.2025.107380_b10","doi-asserted-by":"crossref","first-page":"650","DOI":"10.1016\/j.jmsy.2022.01.014","article-title":"An improved genetic algorithm for flexible job shop scheduling problem considering reconfigurable machine tools with limited auxiliary modules","volume":"62","author":"Fan","year":"2022","journal-title":"J. Manuf. Syst."},{"issue":"5","key":"10.1016\/j.cor.2025.107380_b11","doi-asserted-by":"crossref","first-page":"13418","DOI":"10.1007\/s11356-022-22916-x","article-title":"Leagile and sustainable supplier selection problem in the Industry 4.0 era: A case study of the medical devices using hybrid multi-criteria decision making tool","volume":"30","author":"ForouzeshNejad","year":"2023","journal-title":"Environ. Sci. Pollut. Res."},{"issue":"5","key":"10.1016\/j.cor.2025.107380_b12","doi-asserted-by":"crossref","first-page":"1368","DOI":"10.26599\/TST.2023.9010140","article-title":"Domain knowledge used in meta-heuristic algorithms for the job-shop scheduling problem: Review and analysis","volume":"29","author":"Gui","year":"2024","journal-title":"Tsinghua Sci. Technol."},{"key":"10.1016\/j.cor.2025.107380_b13","doi-asserted-by":"crossref","DOI":"10.1016\/j.cie.2022.108830","article-title":"Research on assembly scheduling problem with nested operations","volume":"175","author":"Hao","year":"2023","journal-title":"Comput. Ind. Eng."},{"key":"10.1016\/j.cor.2025.107380_b14","doi-asserted-by":"crossref","DOI":"10.1016\/j.cie.2022.108845","article-title":"Integrated supplier selection, scheduling, and routing problem for perishable product supply chain: A distributionally robust approach","volume":"175","author":"Hashemi-Amiri","year":"2023","journal-title":"Comput. Ind. Eng."},{"key":"10.1016\/j.cor.2025.107380_b15","doi-asserted-by":"crossref","DOI":"10.1016\/j.eswa.2023.121756","article-title":"An end-to-end deep reinforcement learning method based on graph neural network for distributed job-shop scheduling problem","volume":"238","author":"Huang","year":"2024","journal-title":"Expert Syst. Appl."},{"issue":"1","key":"10.1016\/j.cor.2025.107380_b16","first-page":"1","article-title":"An improved genetic algorithm for vehicle routing problem pick-up and delivery with time windows","volume":"22","author":"Ibrahim","year":"2021","journal-title":"J. Tek. Ind."},{"issue":"1","key":"10.1016\/j.cor.2025.107380_b17","doi-asserted-by":"crossref","first-page":"1656","DOI":"10.1038\/s41598-023-28707-9","article-title":"The collaborative role of blockchain, artificial intelligence, and industrial internet of things in digitalization of small and medium-size enterprises","volume":"13","author":"Khan","year":"2023","journal-title":"Sci. Rep."},{"key":"10.1016\/j.cor.2025.107380_b18","series-title":"Adam: A method for stochastic optimization","author":"Kingma","year":"2014"},{"issue":"1","key":"10.1016\/j.cor.2025.107380_b19","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1016\/S0377-2217(97)00420-7","article-title":"Some new results on simulated annealing applied to the job shop scheduling problem","volume":"113","author":"Kolonko","year":"1999","journal-title":"European J. Oper. Res."},{"issue":"3","key":"10.1016\/j.cor.2025.107380_b20","first-page":"2033","article-title":"Vehicle routing problem and related algorithms for logistics distribution: A literature review and classification","volume":"22","author":"Konstantakopoulos","year":"2022","journal-title":"Oper. Res."},{"key":"10.1016\/j.cor.2025.107380_b21","article-title":"Deep reinforcement learning for dynamic distributed job shop scheduling problem with transfers","author":"Lei","year":"2024","journal-title":"Expert Syst. Appl."},{"issue":"18","key":"10.1016\/j.cor.2025.107380_b22","first-page":"20185","article-title":"Learning to optimize permutation flow shop scheduling via graph-based imitation learning","volume":"38","author":"Li","year":"2024","journal-title":"Proc. AAAI Conf. Artif. Intell."},{"issue":"5","key":"10.1016\/j.cor.2025.107380_b23","doi-asserted-by":"crossref","first-page":"1283","DOI":"10.26599\/TST.2023.9010098","article-title":"Cooperative-guided ant colony optimization with knowledge learning for job shop scheduling problem","volume":"29","author":"Li","year":"2024","journal-title":"Tsinghua Sci. Technol."},{"key":"10.1016\/j.cor.2025.107380_b24","doi-asserted-by":"crossref","DOI":"10.1016\/j.compag.2022.107532","article-title":"Intelligent scheduling method for multi-machine cooperative operation based on NSGA-III and improved ant colony algorithm","volume":"204","author":"Li","year":"2023","journal-title":"Comput. Electron. Agric."},{"key":"10.1016\/j.cor.2025.107380_b25","series-title":"XuanCe: A comprehensive and unified deep reinforcement learning library","author":"Liu","year":"2023"},{"key":"10.1016\/j.cor.2025.107380_b26","first-page":"23609","article-title":"A hierarchical reinforcement learning based optimization framework for large-scale dynamic pickup and delivery problems","volume":"34","author":"Ma","year":"2021","journal-title":"Adv. Neural Inf. Process. Syst."},{"issue":"7540","key":"10.1016\/j.cor.2025.107380_b27","doi-asserted-by":"crossref","first-page":"529","DOI":"10.1038\/nature14236","article-title":"Human-level control through deep reinforcement learning","volume":"518","author":"Mnih","year":"2015","journal-title":"Nature"},{"key":"10.1016\/j.cor.2025.107380_b28","doi-asserted-by":"crossref","first-page":"405","DOI":"10.1146\/annurev-statistics-030718-104938","article-title":"Statistical aspects of Wasserstein distances","volume":"6","author":"Panaretos","year":"2019","journal-title":"Annu. Rev. Stat. Appl."},{"issue":"11","key":"10.1016\/j.cor.2025.107380_b29","doi-asserted-by":"crossref","first-page":"3360","DOI":"10.1080\/00207543.2020.1870013","article-title":"Learning to schedule job-shop problems: representation and policy learning using graph neural network and reinforcement learning","volume":"59","author":"Park","year":"2021","journal-title":"Int. J. Prod. Res."},{"key":"10.1016\/j.cor.2025.107380_b30","doi-asserted-by":"crossref","first-page":"154","DOI":"10.1016\/j.cor.2014.08.006","article-title":"A tabu search\/path relinking algorithm to solve the job shop scheduling problem","volume":"53","author":"Peng","year":"2015","journal-title":"Comput. Oper. Res."},{"issue":"2","key":"10.1016\/j.cor.2025.107380_b31","doi-asserted-by":"crossref","first-page":"258","DOI":"10.1504\/IJMOR.2016.077995","article-title":"Efficient local search algorithms for job-shop scheduling problems","volume":"9","author":"Pongchairerks","year":"2016","journal-title":"Int. J. Math. Oper. Res."},{"key":"10.1016\/j.cor.2025.107380_b32","series-title":"Advanced IoT Technologies and Applications in the Industry 4.0 Digital Economy","first-page":"1","article-title":"The role of internet of things (IoT) technology in industry 4.0 economy","author":"Rath","year":"2024"},{"key":"10.1016\/j.cor.2025.107380_b33","series-title":"High-dimensional continuous control using generalized advantage estimation","author":"Schulman","year":"2015"},{"key":"10.1016\/j.cor.2025.107380_b34","series-title":"Proximal policy optimization algorithms","author":"Schulman","year":"2017"},{"issue":"15","key":"10.1016\/j.cor.2025.107380_b35","doi-asserted-by":"crossref","first-page":"4255","DOI":"10.1080\/00207543.2011.611539","article-title":"A comparison of priority rules for the job shop scheduling problem under different flow time-and tardiness-related objective functions","volume":"50","author":"Sels","year":"2012","journal-title":"Int. J. Prod. Res."},{"issue":"4","key":"10.1016\/j.cor.2025.107380_b36","doi-asserted-by":"crossref","first-page":"791","DOI":"10.1016\/j.cie.2006.09.002","article-title":"A hybrid particle swarm optimization for job shop scheduling problem","volume":"51","author":"Sha","year":"2006","journal-title":"Comput. Ind. Eng."},{"issue":"2","key":"10.1016\/j.cor.2025.107380_b37","doi-asserted-by":"crossref","first-page":"1600","DOI":"10.1109\/TII.2022.3189725","article-title":"Flexible job-shop scheduling via graph neural network and deep reinforcement learning","volume":"19","author":"Song","year":"2022","journal-title":"IEEE Trans. Ind. Inform."},{"issue":"1","key":"10.1016\/j.cor.2025.107380_b38","article-title":"Deep reinforcement learning with double q-learning","volume":"30","author":"Van Hasselt","year":"2016","journal-title":"Proc. AAAI Conf. Artif. Intell."},{"key":"10.1016\/j.cor.2025.107380_b39","unstructured":"Veli\u010dkovi\u0107, Petar, Cucurull, Guillem, Casanova, Arantxa, Romero, Adriana, Li\u00f2, Pietro, Bengio, Yoshua, 2018. Graph Attention Networks. In: International Conference on Learning Representations."},{"key":"10.1016\/j.cor.2025.107380_b40","series-title":"Internet of Things in Modern Computing","first-page":"13","article-title":"Application of Artificial Intelligence (AI) and the Internet of Things (IoT) in process industries toward Industry 4.0","author":"Verma","year":"2023"},{"issue":"7782","key":"10.1016\/j.cor.2025.107380_b41","doi-asserted-by":"crossref","first-page":"350","DOI":"10.1038\/s41586-019-1724-z","article-title":"Grandmaster level in StarCraft II using multi-agent reinforcement learning","volume":"575","author":"Vinyals","year":"2019","journal-title":"Nature"},{"key":"10.1016\/j.cor.2025.107380_b42","doi-asserted-by":"crossref","DOI":"10.1016\/j.aei.2024.102401","article-title":"A multi-disjunctive-graph model-based memetic algorithm for the distributed job shop scheduling problem","volume":"60","author":"Wang","year":"2024","journal-title":"Adv. Eng. Inform."},{"issue":"19","key":"10.1016\/j.cor.2025.107380_b43","doi-asserted-by":"crossref","first-page":"5867","DOI":"10.1080\/00207543.2020.1794075","article-title":"Adaptive scheduling for assembly job shop with uncertain assembly times based on dual Q-learning","volume":"59","author":"Wang","year":"2021","journal-title":"Int. J. Prod. Res."},{"key":"10.1016\/j.cor.2025.107380_b44","doi-asserted-by":"crossref","DOI":"10.1016\/j.eswa.2011.11.051","article-title":"An improved adaptive genetic algorithm based on hormone modulation mechanism for job-shop scheduling problem","author":"Wang","year":"2011","journal-title":"Expert Syst. Appl."},{"key":"10.1016\/j.cor.2025.107380_b45","article-title":"Flexible job shop scheduling via dual attention Network-Based reinforcement learning","author":"Wang","year":"2023","journal-title":"IEEE Trans. Neural Netw. Learn. Syst."},{"key":"10.1016\/j.cor.2025.107380_b46","doi-asserted-by":"crossref","DOI":"10.1016\/j.cie.2022.108205","article-title":"A hybrid algorithm with a new neighborhood structure for job shop scheduling problems","volume":"169","author":"Xie","year":"2022","journal-title":"Comput. Ind. Eng."},{"key":"10.1016\/j.cor.2025.107380_b47","doi-asserted-by":"crossref","DOI":"10.1016\/j.cor.2022.105731","article-title":"A survey of job shop scheduling problem: The types and models","volume":"142","author":"Xiong","year":"2022","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/j.cor.2025.107380_b48","unstructured":"Xu, Keyulu, Hu, Weihua, Leskovec, Jure, Jegelka, Stefanie, 2018. How Powerful are Graph Neural Networks?. In: International Conference on Learning Representations."},{"key":"10.1016\/j.cor.2025.107380_b49","doi-asserted-by":"crossref","first-page":"334","DOI":"10.1016\/j.jmsy.2024.02.007","article-title":"Hybrid quantum particle swarm optimization and variable neighborhood search for flexible job-shop scheduling problem","volume":"73","author":"Xu","year":"2024","journal-title":"J. Manuf. Syst."},{"key":"10.1016\/j.cor.2025.107380_b50","doi-asserted-by":"crossref","DOI":"10.1016\/j.aei.2023.102307","article-title":"Learning to schedule dynamic distributed reconfigurable workshops using expected deep Q-network","volume":"59","author":"Yang","year":"2024","journal-title":"Adv. Eng. Inform."},{"key":"10.1016\/j.cor.2025.107380_b51","doi-asserted-by":"crossref","DOI":"10.1016\/j.aei.2023.102230","article-title":"A multi-agent double Deep-Q-network based on state machine and event stream for flexible job shop scheduling problem","volume":"58","author":"Yuan","year":"2023","journal-title":"Adv. Eng. Inform."},{"key":"10.1016\/j.cor.2025.107380_b52","doi-asserted-by":"crossref","DOI":"10.1016\/j.eswa.2023.123019","article-title":"Solving flexible job shop scheduling problems via deep reinforcement learning","volume":"245","author":"Yuan","year":"2024","journal-title":"Expert Syst. Appl."},{"key":"10.1016\/j.cor.2025.107380_b53","first-page":"1621","article-title":"Learning to dispatch for job shop scheduling via deep reinforcement learning","volume":"33","author":"Zhang","year":"2020","journal-title":"Adv. Neural Inf. Process. Syst."},{"key":"10.1016\/j.cor.2025.107380_b54","doi-asserted-by":"crossref","DOI":"10.1016\/j.aei.2023.102010","article-title":"An energy-efficient multi-objective integrated process planning and scheduling for a flexible job-shop-type remanufacturing system","volume":"56","author":"Zhang","year":"2023","journal-title":"Adv. Eng. Inform."},{"key":"10.1016\/j.cor.2025.107380_b55","doi-asserted-by":"crossref","DOI":"10.1109\/TCYB.2021.3086181","article-title":"A hyperheuristic with Q-learning for the multiobjective energy-efficient distributed blocking flow shop scheduling problem","author":"Zhao","year":"2022","journal-title":"IEEE Trans. Cybern."},{"issue":"3","key":"10.1016\/j.cor.2025.107380_b56","doi-asserted-by":"crossref","first-page":"1941","DOI":"10.1109\/TASE.2021.3062994","article-title":"Iterated greedy algorithms for flow-shop scheduling problems: A tutorial","volume":"19","author":"Zhao","year":"2021","journal-title":"IEEE Trans. Autom. Sci. Eng."}],"container-title":["Computers & Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054825004095?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054825004095?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,4,15]],"date-time":"2026-04-15T23:12:01Z","timestamp":1776294721000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0305054825004095"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,4]]},"references-count":56,"alternative-id":["S0305054825004095"],"URL":"https:\/\/doi.org\/10.1016\/j.cor.2025.107380","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[2026,4]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"DGFFRL: Solving multi-machine collaborative scheduling based on Dual Graph Feature Fusion Reinforcement Learning","name":"articletitle","label":"Article Title"},{"value":"Computers & Operations Research","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.cor.2025.107380","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2025 Elsevier Ltd. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"107380"}}