{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,29]],"date-time":"2024-10-29T09:24:01Z","timestamp":1730193841046,"version":"3.28.0"},"reference-count":13,"publisher":"IEEE","license":[{"start":{"date-parts":[[2021,12,21]],"date-time":"2021-12-21T00:00:00Z","timestamp":1640044800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2021,12,21]],"date-time":"2021-12-21T00:00:00Z","timestamp":1640044800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,12,21]],"date-time":"2021-12-21T00:00:00Z","timestamp":1640044800000},"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":[[2021,12,21]]},"DOI":"10.1109\/acit53391.2021.9677100","type":"proceedings-article","created":{"date-parts":[[2022,1,17]],"date-time":"2022-01-17T16:26:35Z","timestamp":1642436795000},"page":"1-6","source":"Crossref","is-referenced-by-count":1,"title":["Scheduling UET-UCT DAGs of Depth Two on Two Processors"],"prefix":"10.1109","author":[{"given":"Ruzayn","family":"Quaddoura","sequence":"first","affiliation":[]},{"given":"Gassan","family":"Samara","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","article-title":"Scheduling with communication delays: A survey","author":"chretienne","year":"1995","journal-title":"Scheduling Theory and Its Applications"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-5060(08)70356-X"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.4236\/ajor.2016.61010"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/71.539738"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1142\/S0129626493000083"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/s10951-005-6366-3"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1137\/0117070"},{"key":"ref5","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1016\/0304-3975(96)00035-7","article-title":"Scheduling UET-UCT series parallel graphs on two processors","volume":"162","author":"liu","year":"1996","journal-title":"Theoretical Computer Science"},{"key":"ref8","article-title":"Computers and Intractability, A Guide to the Theory of NP-completeness","author":"garey","year":"1979","journal-title":"Ed Freeman"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1142\/S012962649500031X"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/BF00288685"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1016\/0167-8191(90)90056-F"},{"key":"ref9","article-title":"A linear time algorithm to schedule trees with communication delays optimally on two machines","author":"veldhorst","year":"1993","journal-title":"Technical Report COSOR 93-07"}],"event":{"name":"2021 22nd International Arab Conference on Information Technology (ACIT)","start":{"date-parts":[[2021,12,21]]},"location":"Muscat, Oman","end":{"date-parts":[[2021,12,23]]}},"container-title":["2021 22nd International Arab Conference on Information Technology (ACIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9677036\/9677041\/09677100.pdf?arnumber=9677100","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,10]],"date-time":"2022-05-10T12:57:49Z","timestamp":1652187469000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9677100\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,12,21]]},"references-count":13,"URL":"https:\/\/doi.org\/10.1109\/acit53391.2021.9677100","relation":{},"subject":[],"published":{"date-parts":[[2021,12,21]]}}}