{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,14]],"date-time":"2025-10-14T07:09:59Z","timestamp":1760425799195,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":6,"publisher":"ACM","license":[{"start":{"date-parts":[[2020,6,9]],"date-time":"2020-06-09T00:00:00Z","timestamp":1591660800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2020,6,9]]},"DOI":"10.1145\/3394810.3394813","type":"proceedings-article","created":{"date-parts":[[2020,6,12]],"date-time":"2020-06-12T16:04:53Z","timestamp":1591977893000},"page":"111-116","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":13,"title":["Scheduling DAGs When Processor Assignments Are Specified"],"prefix":"10.1145","author":[{"given":"Sanjoy","family":"Baruah","sequence":"first","affiliation":[{"name":"Washington University in Saint Louis"}]}],"member":"320","published-online":{"date-parts":[[2020,6,12]]},"reference":[{"doi-asserted-by":"publisher","key":"e_1_3_2_1_1_1","DOI":"10.1016\/0272-6963(82)90020-1"},{"key":"e_1_3_2_1_2_1","volume-title":"Baker and Dan Trietsch","author":"Kenneth","year":"2009","unstructured":"Kenneth R. Baker and Dan Trietsch . 2009 . Principles of Sequencing and Scheduling. Wiley Publishing . Kenneth R. Baker and Dan Trietsch. 2009. Principles of Sequencing and Scheduling. Wiley Publishing."},{"volume-title":"Proceedings of the 11th Real-Time Systems Symposium. IEEE Computer Society Press","author":"Baruah S.","unstructured":"S. Baruah , A. Mok , and L. Rosier . 1990. Preemptively Scheduling Hard-Real-Time Sporadic Tasks on One Processor . In Proceedings of the 11th Real-Time Systems Symposium. IEEE Computer Society Press , Orlando, Florida, 182--190. S. Baruah, A. Mok, and L. Rosier. 1990. Preemptively Scheduling Hard-Real-Time Sporadic Tasks on One Processor. In Proceedings of the 11th Real-Time Systems Symposium. IEEE Computer Society Press, Orlando, Florida, 182--190.","key":"e_1_3_2_1_3_1"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_4_1","DOI":"10.1109\/ETFA.2019.8869147"},{"unstructured":"M. Garey and D. Johnson. 1979. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman and company NY.  M. Garey and D. Johnson. 1979. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman and company NY.","key":"e_1_3_2_1_5_1"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_6_1","DOI":"10.1016\/0166-218X(94)90142-2"}],"event":{"sponsor":["INRIA INRIA Saclay \u00cele-de-France"],"acronym":"RTNS 2020","name":"RTNS 2020: 28th International Conference on Real-Time Networks and Systems","location":"Paris France"},"container-title":["Proceedings of the 28th International Conference on Real-Time Networks and Systems"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3394810.3394813","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3394810.3394813","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T21:32:01Z","timestamp":1750195921000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3394810.3394813"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,6,9]]},"references-count":6,"alternative-id":["10.1145\/3394810.3394813","10.1145\/3394810"],"URL":"https:\/\/doi.org\/10.1145\/3394810.3394813","relation":{},"subject":[],"published":{"date-parts":[[2020,6,9]]},"assertion":[{"value":"2020-06-12","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}