{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:20:15Z","timestamp":1759638015225},"reference-count":12,"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)00101-x","type":"journal-article","created":{"date-parts":[[2003,4,7]],"date-time":"2003-04-07T18:52:00Z","timestamp":1049741520000},"page":"41-48","source":"Crossref","is-referenced-by-count":9,"title":["Approximation algorithms for scheduling trees with general communication delays"],"prefix":"10.1016","volume":"25","author":[{"given":"Alix","family":"Munier","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0167-8191(98)00101-X_BIB1","unstructured":"P. Chr\u00e9tienne, C. Picouleau, Scheduling with communication delays: a survey, in: P. Chr\u00e9tienne, E.G. Coffman, J.K. Lenstra, Z. Liu (Eds.), Scheduling Theory and its Applications, Wiley, New York, 1995, pp. 65\u201389"},{"key":"10.1016\/S0167-8191(98)00101-X_BIB2","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"},{"key":"10.1016\/S0167-8191(98)00101-X_BIB3","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(98)00101-X_BIB4","doi-asserted-by":"crossref","unstructured":"A. Jakoby, R. Reischuk, Scheduling trees with communication delays, in: 3.SWAT, 1992, pp. 165\u2013177","DOI":"10.1007\/3-540-55706-7_15"},{"issue":"1","key":"10.1016\/S0167-8191(98)00101-X_BIB5","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"},{"key":"10.1016\/S0167-8191(98)00101-X_BIB6","unstructured":"E.L. Lawler, Scheduling trees on multiprocessors with unit communication delays, in: Workshop on Models and Algorithms for Planning and Scheduling Problems, Villa Vigoni, Lake Como, Italy, 1993"},{"key":"10.1016\/S0167-8191(98)00101-X_BIB7","unstructured":"F. Guinand, D. Trystram, Optimal scheduling of uect trees on two processors, Technical report, Apache-imag 3, Institut nationale polytechnique de Grenoble, France, 1993"},{"key":"10.1016\/S0167-8191(98)00101-X_BIB8","unstructured":"F. Guinand, R. Rapine, D. Trystram, Worst case analysis of lawler's algorithm for scheduling trees with communication delays, 95"},{"key":"10.1016\/S0167-8191(98)00101-X_BIB9","unstructured":"R.H. Mohring, M.W. Schaffter, A simple approximation algorithm for scheduling forests with unit processing times and zero-one communication delays, Technical Report 506, Technische universitat Berlin, 1996"},{"key":"10.1016\/S0167-8191(98)00101-X_BIB10","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(98)00101-X_BIB11","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(98)00101-X_BIB12","doi-asserted-by":"crossref","unstructured":"A. Munier, C. Hanen, Using duplication for scheduling unitary tasks on m processors with communication delays, Theoretical Computer Science, to be published","DOI":"10.1016\/S0304-3975(97)88194-7"}],"container-title":["Parallel Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S016781919800101X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S016781919800101X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,1,30]],"date-time":"2020-01-30T06:46:46Z","timestamp":1580366806000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S016781919800101X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,1]]},"references-count":12,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1999,1]]}},"alternative-id":["S016781919800101X"],"URL":"https:\/\/doi.org\/10.1016\/s0167-8191(98)00101-x","relation":{},"ISSN":["0167-8191"],"issn-type":[{"value":"0167-8191","type":"print"}],"subject":[],"published":{"date-parts":[[1999,1]]}}}