{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:29:03Z","timestamp":1759638543912},"reference-count":13,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1998,1,1]],"date-time":"1998-01-01T00:00:00Z","timestamp":883612800000},"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":5676,"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":[[1998,1]]},"DOI":"10.1016\/s0166-218x(97)00077-2","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T17:35:45Z","timestamp":1027618545000},"page":"93-108","source":"Crossref","is-referenced-by-count":9,"title":["Performance of Coffman-Graham schedules in the presence of unit communication delays"],"prefix":"10.1016","volume":"81","author":[{"given":"C.","family":"Hanen","sequence":"first","affiliation":[]},{"given":"A.","family":"Munier","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0166-218X(97)00077-2_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(97)00077-2_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(97)00077-2_bib3","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":"Theoret. Comput. Sci."},{"key":"10.1016\/S0166-218X(97)00077-2_bib4","doi-asserted-by":"crossref","DOI":"10.1109\/71.629491","article-title":"Worst case analysis of Lawler's algorithm for scheduling trees with communication delays","author":"Guinand","year":"1995"},{"key":"10.1016\/S0166-218X(97)00077-2_bib5","article-title":"Optimal scheduling of UECT trees on two processors","author":"Guinand","year":"1993"},{"key":"10.1016\/S0166-218X(97)00077-2_bib6","doi-asserted-by":"crossref","DOI":"10.1016\/S0166-218X(97)00077-2","article-title":"Performance of Coffman-Graham schedules in the presence of unit communication delay","author":"Hanen","year":"1994"},{"key":"10.1016\/S0166-218X(97)00077-2_bib7","doi-asserted-by":"crossref","first-page":"518","DOI":"10.1137\/0206037","article-title":"Worst case analysis of two scheduling algorithms","volume":"6","author":"Lam","year":"1977","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0166-218X(97)00077-2_bib8","series-title":"Workshop on Models and Algorithms for Planning and Scheduling problems","article-title":"Scheduling trees on multiprocessors with unit communication delays","author":"Lawler","year":"1993"},{"issue":"1","key":"10.1016\/S0166-218X(97)00077-2_bib9","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":"J. Algorithms"},{"key":"10.1016\/S0166-218X(97)00077-2_bib10","article-title":"A simple approximation algorithm for scheduling forests with unit processing times and zero-one communication delays","author":"Mohring","year":"1996"},{"key":"10.1016\/S0166-218X(97)00077-2_bib11","article-title":"An approximation algorithm for scheduling unitary tasks onm processors with communication delays","author":"Munier","year":"1995"},{"key":"10.1016\/S0166-218X(97)00077-2_bib12","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(97)00077-2_bib13","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:S0166218X97000772?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X97000772?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,24]],"date-time":"2019-04-24T18:50:51Z","timestamp":1556131851000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X97000772"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,1]]},"references-count":13,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1998,1]]}},"alternative-id":["S0166218X97000772"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(97)00077-2","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1998,1]]}}}