{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,6]],"date-time":"2026-03-06T17:44:32Z","timestamp":1772819072080,"version":"3.50.1"},"reference-count":22,"publisher":"Elsevier BV","issue":"2-3","license":[{"start":{"date-parts":[[1990,12,1]],"date-time":"1990-12-01T00:00:00Z","timestamp":660009600000},"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":[[1990,12]]},"DOI":"10.1016\/0167-8191(90)90056-f","type":"journal-article","created":{"date-parts":[[2003,9,3]],"date-time":"2003-09-03T17:52:02Z","timestamp":1062611522000},"page":"173-182","source":"Crossref","is-referenced-by-count":109,"title":["Multiprocessor scheduling with communication delays"],"prefix":"10.1016","volume":"16","author":[{"given":"B","family":"Veltman","sequence":"first","affiliation":[]},{"given":"B.J","family":"Lageweg","sequence":"additional","affiliation":[]},{"given":"J.K","family":"Lenstra","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0167-8191(90)90056-F_BIB1","doi-asserted-by":"crossref","first-page":"389","DOI":"10.1109\/TC.1986.1676781","article-title":"Scheduling multiprocessor tasks to minimize schedule length","volume":"C-35","author":"Blazewicz","year":"1986","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0167-8191(90)90056-F_BIB2","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1016\/0020-0190(84)90006-1","article-title":"Scheduling independent 2-processor tasks to minimize schedule length","volume":"18","author":"Blazewicz","year":"1984","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0167-8191(90)90056-F_BIB3","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1109\/TC.1981.1675756","article-title":"On the mapping problem","volume":"C-30","author":"Bokhari","year":"1981","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0167-8191(90)90056-F_BIB4","doi-asserted-by":"crossref","first-page":"246","DOI":"10.1080\/05695557008974759","article-title":"A branch-and-bound algorithm for the continuous-process task shop scheduling problem","volume":"2","author":"Bozoki","year":"1970","journal-title":"AIIE Trans."},{"key":"10.1016\/0167-8191(90)90056-F_BIB5","series-title":"Proc. Conf. Theoretical Aspects of Computer Science","first-page":"273","article-title":"Scheduling independent jobs on hypercubes","author":"Chen","year":"1988"},{"key":"10.1016\/0167-8191(90)90056-F_BIB6","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1016\/0020-0190(88)90209-8","article-title":"Preemptive scheduling of independent jobs on a hypercube","volume":"28","author":"Chen","year":"1988","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0167-8191(90)90056-F_BIB7","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1016\/0377-2217(89)90216-6","article-title":"A polynomial algorithm to optimally schedule tasks on a virtual distributed system under tree-like precedence constraints","volume":"43","author":"Chr\u00e9tienne","year":"1989","journal-title":"European J. Oper. Res."},{"key":"10.1016\/0167-8191(90)90056-F_BIB8","unstructured":"J.Y. Colin and P. Chr\u00e9tienne, C.P.M. scheduling with small communication delays and task duplication, Oper. Res. (1990) to appear."},{"key":"10.1016\/0167-8191(90)90056-F_BIB9","doi-asserted-by":"crossref","first-page":"473","DOI":"10.1137\/0402042","article-title":"Complexity of scheduling parallel task systems","volume":"2","author":"Du","year":"1989","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/0167-8191(90)90056-F_BIB10","series-title":"Computers and Intractability: a Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"key":"10.1016\/0167-8191(90)90056-F_BIB11","doi-asserted-by":"crossref","first-page":"1563","DOI":"10.1002\/j.1538-7305.1966.tb01709.x","article-title":"Bounds for certain multiprocessing anomalies","volume":"45","author":"Graham","year":"1966","journal-title":"Bell System Tech. J."},{"key":"10.1016\/0167-8191(90)90056-F_BIB12","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-8191(90)90056-F_BIB13","series-title":"Preemptive scheduling on a hypercube","author":"van Hoesel","year":"1990"},{"key":"10.1016\/0167-8191(90)90056-F_BIB14","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\/0167-8191(90)90056-F_BIB15","article-title":"A General Approach to Multiprocessor Scheduling","author":"Kim","year":"1988"},{"key":"10.1016\/0167-8191(90)90056-F_BIB16","article-title":"Sequencing and scheduling: algorithms and complexity","author":"Lawler","year":"1989"},{"key":"10.1016\/0167-8191(90)90056-F_BIB17","first-page":"141","article-title":"Multiprocessor scheduling with interprocessor communication delays","volume":"20","author":"Lee","year":"1988","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/0167-8191(90)90056-F_BIB18","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1287\/mnsc.6.1.1","article-title":"Scheduling with deadlines and loss functions","volume":"6","author":"McNaughton","year":"1959","journal-title":"Management Sci."},{"key":"10.1016\/0167-8191(90)90056-F_BIB19","series-title":"Proc. 20th Annual ACM Symp. Theory of Computing","first-page":"510","article-title":"Towards an architecture-independent analysis of parallel algorithms","author":"Papadimitriou","year":"1988"},{"key":"10.1016\/0167-8191(90)90056-F_BIB20","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1016\/0020-0190(87)90231-6","article-title":"The complexity of preemptive scheduling given interprocessor communication delays","volume":"25","author":"Rayward-Smith","year":"1987","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0167-8191(90)90056-F_BIB21","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-8191(90)90056-F_BIB22","series-title":"Partitioning and Scheduling Parallel Programs for Multiprocessors","author":"Sarkar","year":"1989"}],"container-title":["Parallel Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:016781919090056F?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:016781919090056F?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,25]],"date-time":"2019-02-25T09:26:35Z","timestamp":1551086795000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/016781919090056F"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,12]]},"references-count":22,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[1990,12]]}},"alternative-id":["016781919090056F"],"URL":"https:\/\/doi.org\/10.1016\/0167-8191(90)90056-f","relation":{},"ISSN":["0167-8191"],"issn-type":[{"value":"0167-8191","type":"print"}],"subject":[],"published":{"date-parts":[[1990,12]]}}}