{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T23:38:10Z","timestamp":1648597090480},"reference-count":11,"publisher":"Elsevier BV","issue":"11","license":[{"start":{"date-parts":[[2002,11,1]],"date-time":"2002-11-01T00:00:00Z","timestamp":1036108800000},"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":[[2002,11]]},"DOI":"10.1016\/s0167-8191(02)00131-x","type":"journal-article","created":{"date-parts":[[2003,1,9]],"date-time":"2003-01-09T14:01:52Z","timestamp":1042120912000},"page":"1573-1585","source":"Crossref","is-referenced-by-count":1,"title":["Minimizing the volume in scheduling an out-tree with communication delays and duplication"],"prefix":"10.1016","volume":"28","author":[{"given":"Claire","family":"Hanen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alix Munier","family":"Kordon","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0167-8191(02)00131-X_BIB1","series-title":"Random Generation of Trees","author":"Alonso","year":"1995"},{"key":"10.1016\/S0167-8191(02)00131-X_BIB2","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1016\/0377-2217(89)90216-6","article-title":"A polynomial time to optimally schedule tasks over an ideal distributed system under tree-like precedence constraints","volume":"2","author":"Chr\u00e9tienne","year":"1989","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0167-8191(02)00131-X_BIB3","series-title":"Scheduling Theory and its Applications","first-page":"65","article-title":"Scheduling with communication delays a survey","author":"Chr\u00e9tienne","year":"1995"},{"key":"10.1016\/S0167-8191(02)00131-X_BIB4","doi-asserted-by":"crossref","first-page":"681","DOI":"10.1287\/opre.39.4.680","article-title":"C.p.m scheduling with small communication delays and task duplication","volume":"39","author":"Colin","year":"1991","journal-title":"Operations Research"},{"key":"10.1016\/S0167-8191(02)00131-X_BIB5","series-title":"1.SPAA","first-page":"254","article-title":"Lower bounds and efficient algorithms for multiprocessor scheduling of dag\u2019s with communication delays","author":"Jung","year":"1989"},{"key":"10.1016\/S0167-8191(02)00131-X_BIB6","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1016\/S0167-8191(98)00101-X","article-title":"Approximation algorithms for scheduling trees with general communication delays","volume":"25","author":"Munier","year":"1999","journal-title":"Parallel Computing"},{"issue":"178","key":"10.1016\/S0167-8191(02)00131-X_BIB7","first-page":"119","author":"Munier","year":"1997","journal-title":"Using duplication for scheduling unitary tasks on m processors with communication delays, Theoretical Computer Science"},{"key":"10.1016\/S0167-8191(02)00131-X_BIB8","doi-asserted-by":"crossref","first-page":"322","DOI":"10.1137\/0219021","article-title":"Towards an architecture independent analysis of parallel algorithms","volume":"19","author":"Papadimitriou","year":"1990","journal-title":"SIAM Journal on Computing"},{"key":"10.1016\/S0167-8191(02)00131-X_BIB9","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1016\/0166-218X(94)00063-J","article-title":"Two new NP-complete scheduling problems with communication delays and unlimited number of processors","volume":"60","author":"Picouleau","year":"1995","journal-title":"Discrete Applied Mathematics"},{"key":"10.1016\/S0167-8191(02)00131-X_BIB10","unstructured":"B. Veltman, Multiprocessor scheduling with communication delays, Ph.D. Thesis, CWI-Amsterdam, 1993"},{"key":"10.1016\/S0167-8191(02)00131-X_BIB11","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1016\/0167-8191(90)90056-F","article-title":"Multiprocessor scheduling with communication delays","volume":"16","author":"Veltman","year":"1990","journal-title":"Parallel Computing"}],"container-title":["Parallel Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S016781910200131X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S016781910200131X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,7]],"date-time":"2019-04-07T06:22:03Z","timestamp":1554618123000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S016781910200131X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,11]]},"references-count":11,"journal-issue":{"issue":"11","published-print":{"date-parts":[[2002,11]]}},"alternative-id":["S016781910200131X"],"URL":"https:\/\/doi.org\/10.1016\/s0167-8191(02)00131-x","relation":{},"ISSN":["0167-8191"],"issn-type":[{"value":"0167-8191","type":"print"}],"subject":[],"published":{"date-parts":[[2002,11]]}}}