{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,27]],"date-time":"2025-10-27T20:27:01Z","timestamp":1761596821373},"reference-count":18,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1994,1,1]],"date-time":"1994-01-01T00:00:00Z","timestamp":757382400000},"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":[[1994,1]]},"DOI":"10.1016\/0167-8191(94)90109-0","type":"journal-article","created":{"date-parts":[[2003,9,3]],"date-time":"2003-09-03T17:52:02Z","timestamp":1062611522000},"page":"1-14","source":"Crossref","is-referenced-by-count":25,"title":["Heuristic algorithms for task assignment and scheduling in a processor network"],"prefix":"10.1016","volume":"20","author":[{"given":"Shen Shen","family":"Wu","sequence":"first","affiliation":[]},{"given":"David","family":"Sweeting","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0167-8191(94)90109-0_BIB1","series-title":"Data Structures and Algorithms","author":"Aho","year":"1983"},{"issue":"3","key":"10.1016\/0167-8191(94)90109-0_BIB2","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1109\/TC.1981.1675756","article-title":"On the mapping problem","volume":"C-30","author":"Bokhair","year":"1981","journal-title":"IEEE Trans. Comput."},{"issue":"2","key":"10.1016\/0167-8191(94)90109-0_BIB3","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1109\/32.4634","article-title":"A taxonomy of scheduling in general-purpose distributed computing systems","volume":"SE-14","author":"Casavant","year":"1988","journal-title":"IEEE Trans. Software Engrg."},{"issue":"4","key":"10.1016\/0167-8191(94)90109-0_BIB4","doi-asserted-by":"crossref","first-page":"401","DOI":"10.1109\/TSE.1982.235574","article-title":"Load balancing in distributed system","volume":"SE-8","author":"Chou","year":"1982","journal-title":"IEEE Trans. Software Engrg."},{"issue":"11","key":"10.1016\/0167-8191(94)90109-0_BIB5","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1109\/MC.1980.1653419","article-title":"Task allocation in distributed data processing","volume":"13","author":"Chu","year":"1980","journal-title":"IEEE Comput."},{"issue":"6","key":"10.1016\/0167-8191(94)90109-0_BIB6","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1109\/MC.1982.1654050","article-title":"Heuristic models of task assignment scheduling in distributed systems","volume":"15","author":"Efe","year":"1982","journal-title":"IEEE Comput."},{"issue":"9","key":"10.1016\/0167-8191(94)90109-0_BIB7","doi-asserted-by":"crossref","first-page":"818","DOI":"10.1109\/TC.1980.1675681","article-title":"Distributed enumeration on network computer","volume":"C-29","author":"El-Dessouki","year":"1980","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0167-8191(94)90109-0_BIB8","series-title":"Computer and Intractability-A Guide to The Theory of NP-Completeness","author":"Garey","year":"1979"},{"key":"10.1016\/0167-8191(94)90109-0_BIB9","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1002\/j.1538-7305.1970.tb01770.x","article-title":"An efficient heuristic procedure for partitioning graphs","volume":"49","author":"Kernighan","year":"1970","journal-title":"Bell Syst. Tech. J."},{"issue":"2","key":"10.1016\/0167-8191(94)90109-0_BIB10","doi-asserted-by":"crossref","first-page":"174","DOI":"10.1109\/TSE.1981.230833","article-title":"Communication issues in the design and analysis of parallel algorithms","volume":"SE-7","author":"Lint","year":"1981","journal-title":"IEEE Trans. Software Engrg."},{"issue":"11","key":"10.1016\/0167-8191(94)90109-0_BIB11","doi-asserted-by":"crossref","first-page":"1384","DOI":"10.1109\/12.8704","article-title":"Heuristic algorithms for task assignment in distributed systems","volume":"C-37","author":"Lo","year":"1988","journal-title":"IEEE Trans. Comput."},{"issue":"1","key":"10.1016\/0167-8191(94)90109-0_BIB12","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1109\/TC.1982.1675884","article-title":"A task allocation model for distributed computing systems","volume":"C-31","author":"Ma","year":"1982","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0167-8191(94)90109-0_BIB13","series-title":"Proc. Internat. Conf. Parallel Proc.","first-page":"352","article-title":"Optimal load balancing strategies for a multiple processor system","author":"Ni","year":"1981"},{"issue":"4","key":"10.1016\/0167-8191(94)90109-0_BIB14","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1109\/TC.1979.1675348","article-title":"Assignment of tasks in a distributed processor system with limited memory","volume":"C-28","author":"Rao","year":"1979","journal-title":"IEEE Trans. Comput."},{"issue":"1","key":"10.1016\/0167-8191(94)90109-0_BIB15","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0167-8191(90)90115-P","article-title":"Cluster partitioning approaches to mapping parallel problems onto a hypercube","volume":"13","author":"Sadayappan","year":"1990","journal-title":"Parallel Comput."},{"issue":"12","key":"10.1016\/0167-8191(94)90109-0_BIB16","doi-asserted-by":"crossref","first-page":"1408","DOI":"10.1109\/TC.1987.5009494","article-title":"Nearest-neighbor mapping of finite element graphs onto processor meshes","volume":"C-36","author":"Sadayappan","year":"1987","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0167-8191(94)90109-0_BIB17","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1109\/C-M.1978.218272","article-title":"Control of distributed processes","volume":"11","author":"Stone","year":"1978","journal-title":"Computer"},{"key":"10.1016\/0167-8191(94)90109-0_BIB18","first-page":"810","article-title":"Flight simulation on a transputer based parallel computer system","volume":"Vol. 2","author":"Sweeting","year":"1991"}],"container-title":["Parallel Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0167819194901090?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0167819194901090?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:28:21Z","timestamp":1551086901000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0167819194901090"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,1]]},"references-count":18,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1994,1]]}},"alternative-id":["0167819194901090"],"URL":"https:\/\/doi.org\/10.1016\/0167-8191(94)90109-0","relation":{},"ISSN":["0167-8191"],"issn-type":[{"value":"0167-8191","type":"print"}],"subject":[],"published":{"date-parts":[[1994,1]]}}}