{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T22:41:43Z","timestamp":1649112103980},"reference-count":20,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1993,12,1]],"date-time":"1993-12-01T00:00:00Z","timestamp":754704000000},"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":["Information Sciences"],"published-print":{"date-parts":[[1993,12]]},"DOI":"10.1016\/0020-0255(93)90110-8","type":"journal-article","created":{"date-parts":[[2003,6,30]],"date-time":"2003-06-30T17:28:37Z","timestamp":1056994117000},"page":"1-34","source":"Crossref","is-referenced-by-count":2,"title":["Optimal assignment of task modules with precedence in distributed computing systems"],"prefix":"10.1016","volume":"75","author":[{"given":"Chen","family":"Gen-Huey","sequence":"first","affiliation":[]},{"given":"Yur","family":"Jyh-Shiarn","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"4","key":"10.1016\/0020-0255(93)90110-8_BIB1","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1109\/TSE.1979.234201","article-title":"Dual processors scheduling with dynamic reassignment","volume":"SE-5","author":"Bokhari","year":"1979","journal-title":"IEEE Transactions on Software Engineering"},{"issue":"6","key":"10.1016\/0020-0255(93)90110-8_BIB2","doi-asserted-by":"crossref","first-page":"583","DOI":"10.1109\/TSE.1981.226469","article-title":"A shortest tree algorithm for optimal assignments across space and time in a distributed processor systems","volume":"SE-7","author":"Bokhari","year":"1981","journal-title":"IEEE Transactions on Software Engineering"},{"issue":"3","key":"10.1016\/0020-0255(93)90110-8_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":"1987","journal-title":"IEEE Transactions on Computers"},{"issue":"1","key":"10.1016\/0020-0255(93)90110-8_BIB4","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1109\/12.75137","article-title":"Partitioning problems in parallel, pipelined, and distributed computing","volume":"C-37","author":"Bokhari","year":"1988","journal-title":"IEEE Transactions on Computers"},{"issue":"2","key":"10.1016\/0020-0255(93)90110-8_BIB5","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1016\/0020-0190(89)90032-X","article-title":"An LC branch-and-bound algorithm for module assignment problem","volume":"32","author":"Chern","year":"1989","journal-title":"Information Processing Letters"},{"key":"10.1016\/0020-0255(93)90110-8_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 Computer"},{"key":"10.1016\/0020-0255(93)90110-8_BIB7","series-title":"Fundamentals of Data Structures","author":"Horowitz","year":"1976"},{"issue":"11","key":"10.1016\/0020-0255(93)90110-8_BIB8","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 Transactions on Computers"},{"issue":"1","key":"10.1016\/0020-0255(93)90110-8_BIB9","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 Transactions on Computers"},{"key":"10.1016\/0020-0255(93)90110-8_BIB10","series-title":"Problem Solving Methods in Artificial Intelligence","author":"Nilsson","year":"1977"},{"issue":"4","key":"10.1016\/0020-0255(93)90110-8_BIB11","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 Transactions on Computers"},{"issue":"3","key":"10.1016\/0020-0255(93)90110-8_BIB12","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1109\/TC.1985.1676563","article-title":"A graph matching approach to optimal task assignment in distributed computing systems using a minimax criterion","volume":"C-34","author":"Shen","year":"1985","journal-title":"IEEE Transactions on Computers"},{"key":"10.1016\/0020-0255(93)90110-8_BIB13","doi-asserted-by":"crossref","first-page":"342","DOI":"10.1016\/0743-7315(87)90024-4","article-title":"Efficient computation of optimal assignments for distributed tasks","volume":"4","author":"Sinclair","year":"1987","journal-title":"Journal of Parallel and Distributed Computing"},{"issue":"5","key":"10.1016\/0020-0255(93)90110-8_BIB14","doi-asserted-by":"crossref","first-page":"521","DOI":"10.1109\/12.4603","article-title":"Optimal assignments in broadcast networks","volume":"C-37","author":"Sinclair","year":"1988","journal-title":"IEEE Transactions on Computers"},{"issue":"1","key":"10.1016\/0020-0255(93)90110-8_BIB15","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1109\/TSE.1977.233840","article-title":"Multiprocessor scheduling with the aid of network flow algorithms","volume":"SE-3","author":"Stone","year":"1977","journal-title":"IEEE Transactions on Software Engineering"},{"issue":"3","key":"10.1016\/0020-0255(93)90110-8_BIB16","doi-asserted-by":"crossref","first-page":"254","DOI":"10.1109\/TSE.1978.231502","article-title":"Critical load factors in two-processor distributed systems","volume":"SE-4","author":"Stone","year":"1978","journal-title":"IEEE Transactions on Software Engineering"},{"issue":"2","key":"10.1016\/0020-0255(93)90110-8_BIB17","first-page":"141","article-title":"A taxonomy of scheduling in general-purpose distributed computing systems","volume":"SE-14","author":"Thomas","year":"1988","journal-title":"IEEE Transactions on Software Engineering"},{"key":"10.1016\/0020-0255(93)90110-8_BIB18","series-title":"Simulated Annealing: Theory and Applications","author":"van Laarhoven","year":"1987"},{"key":"10.1016\/0020-0255(93)90110-8_BIB19","doi-asserted-by":"crossref","first-page":"54","DOI":"10.1007\/BF01934694","article-title":"Optimal assignment of task modules with precedence for distributed processing by graph matching and state-space search","volume":"28","author":"Wang","year":"1988","journal-title":"BIT"},{"key":"10.1016\/0020-0255(93)90110-8_BIB20","article-title":"Optimal assignment of task modules with precedence in distributed computing systems","author":"Yur","year":"1989"}],"container-title":["Information Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020025593901108?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020025593901108?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,18]],"date-time":"2019-03-18T13:50:40Z","timestamp":1552917040000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020025593901108"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,12]]},"references-count":20,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1993,12]]}},"alternative-id":["0020025593901108"],"URL":"https:\/\/doi.org\/10.1016\/0020-0255(93)90110-8","relation":{},"ISSN":["0020-0255"],"issn-type":[{"value":"0020-0255","type":"print"}],"subject":[],"published":{"date-parts":[[1993,12]]}}}