{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T05:57:58Z","timestamp":1767333478346,"version":"3.48.0"},"reference-count":21,"publisher":"IEEE","license":[{"start":{"date-parts":[[2025,10,6]],"date-time":"2025-10-06T00:00:00Z","timestamp":1759708800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,10,6]],"date-time":"2025-10-06T00:00:00Z","timestamp":1759708800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025,10,6]]},"DOI":"10.1109\/milcom64451.2025.11310446","type":"proceedings-article","created":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T18:35:33Z","timestamp":1767292533000},"page":"1-6","source":"Crossref","is-referenced-by-count":0,"title":["Studying the Effect of Schedule Preemption on Dynamic Task Graph Scheduling"],"prefix":"10.1109","author":[{"given":"Mohammadali","family":"Khodabandehlou","sequence":"first","affiliation":[{"name":"University of Southern California,Dept. of Electrical and Computer Engineering,Los Angeles,USA"}]},{"given":"Jared","family":"Coleman","sequence":"additional","affiliation":[{"name":"Loyola Marymount University,Dept. of Computer Science,Los Angeles,USA"}]},{"given":"Niranjan","family":"Suri","sequence":"additional","affiliation":[{"name":"US Army Research Laboratory,Maryland,USA"}]},{"given":"Bhaskar","family":"Krishnamachari","sequence":"additional","affiliation":[{"name":"University of Southern California,Dept. of Electrical and Computer Engineering,Los Angeles,USA"}]}],"member":"263","reference":[{"article-title":"Computers and intractability: A guide to the theory of np-completeness","year":"1979","author":"Michael","key":"ref1"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-0000(75)80008-0"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/344588.344618"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/32.4634"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1137\/0117039"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/3715014.3724039"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/71.993206"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/71.790598"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ISPA.2012.94"},{"article-title":"Graph assisted offline-online deep reinforcement learning for dynamic workflow scheduling","volume-title":"The Thirteenth International Conference on Learning Representations","author":"Yang","key":"ref10"},{"article-title":"Deep reinforcement learning for job scheduling and resource management in cloud computing: An algorithm-level review","year":"2025","author":"Gu","key":"ref11"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-03869-3_80"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/MCSE.2013.98"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/3492323.3495630"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-20984-0_32"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/ICCEET.2012.6203873"},{"article-title":"Comparing task graph scheduling algorithms: An adversarial approach","year":"2024","author":"Coleman","key":"ref17"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/HCW.1999.765092"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1006\/jpdc.2000.1714"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1002\/cpe.4257"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1016\/j.future.2023.04.031"}],"event":{"name":"MILCOM 2025 - 2025 IEEE Military Communications Conference (MILCOM)","start":{"date-parts":[[2025,10,6]]},"location":"Los Angeles, CA, USA","end":{"date-parts":[[2025,10,10]]}},"container-title":["MILCOM 2025 - 2025 IEEE Military Communications Conference (MILCOM)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/11309822\/11309347\/11310446.pdf?arnumber=11310446","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T05:55:52Z","timestamp":1767333352000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11310446\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,10,6]]},"references-count":21,"URL":"https:\/\/doi.org\/10.1109\/milcom64451.2025.11310446","relation":{},"subject":[],"published":{"date-parts":[[2025,10,6]]}}}