{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,16]],"date-time":"2026-03-16T10:15:15Z","timestamp":1773656115538,"version":"3.50.1"},"reference-count":16,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[2001,3,1]],"date-time":"2001-03-01T00:00:00Z","timestamp":983404800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":4521,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[2001,3]]},"DOI":"10.1016\/s0166-218x(00)00179-7","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T14:25:18Z","timestamp":1027607118000},"page":"239-257","source":"Crossref","is-referenced-by-count":11,"title":["An approximation algorithm for scheduling dependent tasks on m processors with small communication delays"],"prefix":"10.1016","volume":"108","author":[{"given":"C","family":"Hanen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A","family":"Munier","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0166-218X(00)00179-7_BIB1","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\/S0166-218X(00)00179-7_BIB2","doi-asserted-by":"crossref","first-page":"200","DOI":"10.1007\/BF00288685","article-title":"Optimal scheduling for two processor systems","volume":"1","author":"Coffman","year":"1972","journal-title":"Acta Inform."},{"key":"10.1016\/S0166-218X(00)00179-7_BIB3","series-title":"Computer and Job-Shop Scheduling Theory","article-title":"Bounds on the performance of scheduling algorithms","author":"Graham","year":"1976"},{"key":"10.1016\/S0166-218X(00)00179-7_BIB4","unstructured":"F. Guinand, R. Rapine, D. Trystram, Worst case analysis of Lawler's algorithm for scheduling trees with communication delays, Technical Report IMAG, 1995."},{"key":"10.1016\/S0166-218X(00)00179-7_BIB5","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1016\/S0166-218X(97)00077-2","article-title":"Performance of Coffman\u2013Graham schedules in presence of unit communication delay","volume":"81","author":"Hanen","year":"1998","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0166-218X(00)00179-7_BIB6","doi-asserted-by":"crossref","unstructured":"C. Hanen, A. Munier, An approximation algorithm for scheduling dependent tasks on m processors with small communication delays, in: IEEE Symposium on Emerging Technologies and Factory Automation, Paris, France, September 1995, pp. 167\u2013190.","DOI":"10.1109\/ETFA.1995.496773"},{"key":"10.1016\/S0166-218X(00)00179-7_BIB7","doi-asserted-by":"crossref","DOI":"10.1016\/0167-6377(94)90024-8","article-title":"3, 4, 5, 6, or the complexity of scheduling with communication delays","volume":"16","author":"Hoogeven","year":"1994","journal-title":"Oper. Res. Lett."},{"key":"10.1016\/S0166-218X(00)00179-7_BIB8","doi-asserted-by":"crossref","first-page":"244","DOI":"10.1137\/0218016","article-title":"Scheduling precedence graphs in systems with interprocessor communication times","volume":"18","author":"Hwang","year":"1989","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0166-218X(00)00179-7_BIB9","series-title":"Scheduling trees on multiprocessors with unit communication delays, in: Workshop on Models and Algorithms for Planning and Scheduling Problems, Villa Vigoni","author":"Lawler","year":"1993"},{"key":"10.1016\/S0166-218X(00)00179-7_BIB10","unstructured":"R.H. Mohring, M.W. Schaffter, Approximation algorithms for scheduling series-parallel orders subject to unit time communication delays, Technical Report 483, Technische universitat Berlin, 1995."},{"key":"10.1016\/S0166-218X(00)00179-7_BIB11","unstructured":"R.H. Mohring, M.W. Schaffter, A simple approximation algorithm for scheduling forest with unit processing times and zero-one communication delays Technical Report 506, Technische universitat Berlin, 1996."},{"issue":"1","key":"10.1016\/S0166-218X(00)00179-7_BIB12","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1287\/opre.45.1.145","article-title":"A heuristic for a scheduling problem with communications delays","volume":"45","author":"Munier","year":"1997","journal-title":"Oper. Res."},{"key":"10.1016\/S0166-218X(00)00179-7_BIB13","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 Appl. Math."},{"key":"10.1016\/S0166-218X(00)00179-7_BIB14","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 Appl. Math."},{"key":"10.1016\/S0166-218X(00)00179-7_BIB15","unstructured":"M.W. Schaffter, Approximation Algorithm for scheduling with communication delays, Ph.D. Thesis, Technische universitat Berlin, 1996."},{"key":"10.1016\/S0166-218X(00)00179-7_BIB16","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 Comput."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X00001797?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X00001797?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,23]],"date-time":"2019-04-23T16:58:54Z","timestamp":1556038734000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X00001797"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,3]]},"references-count":16,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2001,3]]}},"alternative-id":["S0166218X00001797"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(00)00179-7","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[2001,3]]}}}