{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T16:53:56Z","timestamp":1648832036600},"reference-count":11,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1999,1,1]],"date-time":"1999-01-01T00:00:00Z","timestamp":915148800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Parallel Computing"],"published-print":{"date-parts":[[1999,1]]},"DOI":"10.1016\/s0167-8191(98)00099-4","type":"journal-article","created":{"date-parts":[[2003,4,7]],"date-time":"2003-04-07T14:52:00Z","timestamp":1049727120000},"page":"3-21","source":"Crossref","is-referenced-by-count":1,"title":["Scheduling interval-ordered tasks with non-uniform deadlines subject to non-zero communication delays"],"prefix":"10.1016","volume":"25","author":[{"given":"Jacques","family":"Verriet","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0167-8191(98)00099-4_BIB1","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1016\/0166-218X(87)90042-4","article-title":"UET scheduling with unit interprocessor communication delays","volume":"18","author":"Rayward-Smith","year":"1987","journal-title":"Discrete Applied Mathematics"},{"key":"10.1016\/S0167-8191(98)00099-4_BIB2","unstructured":"C. Picouleau, Etude de Probl\u00e8mes d'Optimisation dans les Syst\u00e8mes Distribu\u00e9s. Ph.D. Thesis, Universit\u00e9 Pierre et Marie Curie, Paris, 1992"},{"issue":"1","key":"10.1016\/S0167-8191(98)00099-4_BIB3","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1006\/jagm.1996.0007","article-title":"The complexity of scheduling trees with communication delays","volume":"20","author":"Lenstra","year":"1996","journal-title":"Journal of Algorithms"},{"issue":"2","key":"10.1016\/S0167-8191(98)00099-4_BIB4","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":"Finta","year":"1996","journal-title":"Theoretical Computer Science"},{"issue":"2","key":"10.1016\/S0167-8191(98)00099-4_BIB5","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1006\/jcss.1995.1068","article-title":"An optimal algorithm for scheduling interval ordered tasks with communication on N processors","volume":"51","author":"Ali","year":"1995","journal-title":"Journal of Computer and System Sciences"},{"key":"10.1016\/S0167-8191(98)00099-4_BIB6","unstructured":"J. Verriet, Scheduling UET, UCT dags with release dates and deadlines, Technical Report 1995-31, Department of Computer Science, Utrecht University, September 1995"},{"issue":"6","key":"10.1016\/S0167-8191(98)00099-4_BIB7","doi-asserted-by":"crossref","first-page":"461","DOI":"10.1145\/321958.321967","article-title":"Scheduling tasks with nonuniform deadlines on two processors","volume":"23","author":"Garey","year":"1976","journal-title":"Journal of the ACM"},{"issue":"3","key":"10.1016\/S0167-8191(98)00099-4_BIB8","doi-asserted-by":"crossref","first-page":"405","DOI":"10.1137\/0208031","article-title":"Scheduling interval-ordered tasks","volume":"8","author":"Papadimitriou","year":"1979","journal-title":"SIAM Journal on Computing"},{"key":"10.1016\/S0167-8191(98)00099-4_BIB9","unstructured":"T.H. Cormen, C.E. Leiserson, R.L. Rivest, Introduction to Algorithms, MIT Press, Cambridge, MA, 1990"},{"key":"10.1016\/S0167-8191(98)00099-4_BIB10","unstructured":"M.R. Garey, D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, Freeman, New York, 1979"},{"key":"10.1016\/S0167-8191(98)00099-4_BIB11","doi-asserted-by":"crossref","unstructured":"J. Verriet, Scheduling interval orders with release dates and deadlines, Technical Report 1996-12, Department of Computer Science, Utrecht University, March 1996","DOI":"10.1007\/BFb0009513"}],"container-title":["Parallel Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167819198000994?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167819198000994?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,1,8]],"date-time":"2020-01-08T10:31:53Z","timestamp":1578479513000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0167819198000994"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,1]]},"references-count":11,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1999,1]]}},"alternative-id":["S0167819198000994"],"URL":"https:\/\/doi.org\/10.1016\/s0167-8191(98)00099-4","relation":{},"ISSN":["0167-8191"],"issn-type":[{"value":"0167-8191","type":"print"}],"subject":[],"published":{"date-parts":[[1999,1]]}}}