{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,12]],"date-time":"2025-11-12T09:10:29Z","timestamp":1762938629731,"version":"3.45.0"},"reference-count":21,"publisher":"Wiley","issue":"25-26","license":[{"start":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T00:00:00Z","timestamp":1759017600000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"funder":[{"DOI":"10.13039\/100012547","name":"Natural Science Foundation of Guangxi Zhuang Autonomous Region","doi-asserted-by":"publisher","award":["2025GXNSFAA069830"],"award-info":[{"award-number":["2025GXNSFAA069830"]}],"id":[{"id":"10.13039\/100012547","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["onlinelibrary.wiley.com"],"crossmark-restriction":true},"short-container-title":["Concurrency and Computation"],"published-print":{"date-parts":[[2025,11,30]]},"abstract":"<jats:title>ABSTRACT<\/jats:title>\n                  <jats:p>Task scheduling algorithms for data centers must be capable of making instantaneous decisions based on the current state of the system. However, due to information limitations, these scheduling algorithms often fail to achieve optimal scheduling plans. To address the information bottleneck faced in DAG (Directed Acyclic Graph) task scheduling within data centers, this paper proposes a deep reinforcement learning scheduling model based on a DAG attention mechanism. This model utilizes the attention mechanism to capture the potential relationships between dependent tasks, thereby improving scheduling efficiency and system performance under limited information conditions. The experimental results indicate that our DAG attention mechanism can significantly reduce makespan.<\/jats:p>","DOI":"10.1002\/cpe.70279","type":"journal-article","created":{"date-parts":[[2025,9,29]],"date-time":"2025-09-29T00:56:17Z","timestamp":1759107377000},"update-policy":"https:\/\/doi.org\/10.1002\/crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Deep Reinforcement Learning Approach With Attention Mechanism for\n                    <scp>DAG<\/scp>\n                    Task Scheduling in Data Centers"],"prefix":"10.1002","volume":"37","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1373-6183","authenticated-orcid":false,"given":"Jun","family":"Cai","sequence":"first","affiliation":[{"name":"School of Architecture and Electrical Engineering Hezhou University  Hezhou China"}]},{"given":"Li\u2010juan","family":"Lu","sequence":"additional","affiliation":[{"name":"School of Architecture and Electrical Engineering Hezhou University  Hezhou China"}]}],"member":"311","published-online":{"date-parts":[[2025,9,28]]},"reference":[{"key":"e_1_2_7_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/SMC53654.2022.9945255"},{"key":"e_1_2_7_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10723-020-09533-z"},{"key":"e_1_2_7_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICABCD.2019.8851045"},{"key":"e_1_2_7_5_1","doi-asserted-by":"publisher","DOI":"10.1155\/2020\/3046769"},{"key":"e_1_2_7_6_1","doi-asserted-by":"crossref","unstructured":"A.PrajapatiandD. M.Patel \u201cContainer Scheduling: A Taxonomy Open Issues and Future Directions for Scheduling of Containerized Microservices \u201dOpen Issues and Future Directions for Scheduling of Containerized Microservices 2024.","DOI":"10.2139\/ssrn.4699558"},{"key":"e_1_2_7_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2024.3373316"},{"key":"e_1_2_7_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2016.2623803"},{"key":"e_1_2_7_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00521-023-08208-6"},{"key":"e_1_2_7_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSC.2024.3442544"},{"key":"e_1_2_7_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/3654823.3654885"},{"key":"e_1_2_7_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10489-022-04164-1"},{"key":"e_1_2_7_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICCC57788.2023.10233668"},{"key":"e_1_2_7_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/JIOT.2020.2972041"},{"key":"e_1_2_7_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/MSN53354.2021.00024"},{"key":"e_1_2_7_16_1","doi-asserted-by":"publisher","DOI":"10.1186\/s13638-023-02253-4"},{"key":"e_1_2_7_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/3637528.3671508"},{"key":"e_1_2_7_18_1","first-page":"1","article-title":"Optimizing Network Resource Allocation With Graph Pointer Neural Network in Large\u2010Scale Ai Systems","author":"Zhang P.","year":"2024","journal-title":"Digital Communications and Networks"},{"key":"e_1_2_7_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSC.2024.3394689"},{"key":"e_1_2_7_20_1","doi-asserted-by":"publisher","DOI":"10.3390\/electronics14010098"},{"key":"e_1_2_7_21_1","first-page":"47764","article-title":"Transformers Over Directed Acyclic Graphs","volume":"36","author":"Luo Y.","year":"2024","journal-title":"Advances in Neural Information Processing Systems"},{"key":"e_1_2_7_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/3335484.3335513"}],"container-title":["Concurrency and Computation: Practice and Experience"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/cpe.70279","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,12]],"date-time":"2025-11-12T09:05:49Z","timestamp":1762938349000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/cpe.70279"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,9,28]]},"references-count":21,"journal-issue":{"issue":"25-26","published-print":{"date-parts":[[2025,11,30]]}},"alternative-id":["10.1002\/cpe.70279"],"URL":"https:\/\/doi.org\/10.1002\/cpe.70279","archive":["Portico"],"relation":{},"ISSN":["1532-0626","1532-0634"],"issn-type":[{"type":"print","value":"1532-0626"},{"type":"electronic","value":"1532-0634"}],"subject":[],"published":{"date-parts":[[2025,9,28]]},"assertion":[{"value":"2025-04-21","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2025-08-19","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2025-09-28","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}],"article-number":"e70279"}}