{"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":1773656115543,"version":"3.50.1"},"reference-count":12,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1994,10,1]],"date-time":"1994-10-01T00:00:00Z","timestamp":780969600000},"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":["Operations Research Letters"],"published-print":{"date-parts":[[1994,10]]},"DOI":"10.1016\/0167-6377(94)90024-8","type":"journal-article","created":{"date-parts":[[2003,6,30]],"date-time":"2003-06-30T14:40:45Z","timestamp":1056984045000},"page":"129-137","source":"Crossref","is-referenced-by-count":61,"title":["Three, four, five, six, or the complexity of scheduling with communication delays"],"prefix":"10.1016","volume":"16","author":[{"given":"J.A.","family":"Hoogeveen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J.K.","family":"Lenstra","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"B.","family":"Veltman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0167-6377(94)90024-8_BIB1","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":"Oper. Res."},{"key":"10.1016\/0167-6377(94)90024-8_BIB2","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/S0167-5060(08)70356-X","article-title":"Optimization and approximation in deterministic sequencing and scheduling: a survey","volume":"5","author":"Graham","year":"1979","journal-title":"Ann. Discrete Math."},{"key":"10.1016\/0167-6377(94)90024-8_BIB3","doi-asserted-by":"crossref","first-page":"22","DOI":"10.1287\/opre.26.1.22","article-title":"Complexity of scheduling under precedence constraints","volume":"26","author":"Lenstra","year":"1978","journal-title":"Oper. Res."},{"key":"10.1016\/0167-6377(94)90024-8_BIB4","unstructured":"J.K. Lenstra, M. Veldhorst and B. Veltman, \u201cThe complexity of scheduling trees with communication delays\u201d, submitted for publication."},{"key":"10.1016\/0167-6377(94)90024-8_BIB5","article-title":"A heuristic for a scheduling problem with communication delays","author":"Munier","year":"1994"},{"key":"10.1016\/0167-6377(94)90024-8_BIB6","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 J. Comput."},{"key":"10.1016\/0167-6377(94)90024-8_BIB7","article-title":"Ordonnancement de t\u00e2ches de dur\u00e9e unitaire avec des d\u00e9lais de communication unitaires sur m processeurs","author":"Picouleau","year":"1991"},{"key":"10.1016\/0167-6377(94)90024-8_BIB8","article-title":"Two new NP-complete scheduling problems with communication delays and unlimited number of processors","author":"Picouleau","year":"1991"},{"key":"10.1016\/0167-6377(94)90024-8_BIB9","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\/0167-6377(94)90024-8_BIB10","series-title":"Theory of Linear and Integer Programming","author":"Schrijver","year":"1986"},{"key":"10.1016\/0167-6377(94)90024-8_BIB11","series-title":"Scheduling in and out forests in the presence of communication delays","author":"Varvarigou","year":"1992"},{"key":"10.1016\/0167-6377(94)90024-8_BIB12","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":["Operations Research Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0167637794900248?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0167637794900248?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,18]],"date-time":"2019-03-18T05:53:03Z","timestamp":1552888383000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0167637794900248"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,10]]},"references-count":12,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1994,10]]}},"alternative-id":["0167637794900248"],"URL":"https:\/\/doi.org\/10.1016\/0167-6377(94)90024-8","relation":{},"ISSN":["0167-6377"],"issn-type":[{"value":"0167-6377","type":"print"}],"subject":[],"published":{"date-parts":[[1994,10]]}}}