{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T16:23:52Z","timestamp":1649089432643},"reference-count":21,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1994,5,1]],"date-time":"1994-05-01T00:00:00Z","timestamp":767750400000},"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":[[1994,5]]},"DOI":"10.1016\/0020-0255(94)90017-5","type":"journal-article","created":{"date-parts":[[2003,6,30]],"date-time":"2003-06-30T17:28:37Z","timestamp":1056994117000},"page":"1-18","source":"Crossref","is-referenced-by-count":4,"title":["Optimal task assignment with precedence in distributed computing systems"],"prefix":"10.1016","volume":"78","author":[{"given":"Lin","family":"Jin-Cherng","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"4","key":"10.1016\/0020-0255(94)90017-5_BIB1","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1109\/TSE.1979.234201","article-title":"Dual processor scheduling with dynamic reassignment","volume":"SE-5","author":"Bokhari","year":"1979","journal-title":"IEEE Trans. Software Eng."},{"issue":"6","key":"10.1016\/0020-0255(94)90017-5_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 system","volume":"SE-7","author":"Bokhari","year":"1981","journal-title":"IEEE Trans. Software Eng."},{"issue":"3","key":"10.1016\/0020-0255(94)90017-5_BIB3","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1109\/TC.1981.1675756","article-title":"On the mapping problem","volume":"C-36","author":"Bokhari","year":"1987","journal-title":"IEEE Trans. Comput."},{"issue":"1","key":"10.1016\/0020-0255(94)90017-5_BIB4","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1109\/12.75137","article-title":"Partitioning problems in parallel, pipelines and distributed computing","volume":"C-37","author":"Bokhari","year":"1988","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0020-0255(94)90017-5_BIB5","series-title":"Proc. IEEE 10th Int. Conf. on Distributed Computing Systems","first-page":"494","article-title":"A branch-and-bound-with-underestimates algorithm for the task assignment problem with precedence constraint","author":"Chen","year":"1990"},{"issue":"6","key":"10.1016\/0020-0255(94)90017-5_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 Magazine"},{"key":"10.1016\/0020-0255(94)90017-5_BIB7","series-title":"Fundamentals of Data Structure","author":"Horowitz","year":"1976"},{"key":"10.1016\/0020-0255(94)90017-5_BIB8","article-title":"An optimal task assignment with precedence in distributed computing systems","author":"Hsien","year":"1992"},{"key":"10.1016\/0020-0255(94)90017-5_BIB9","series-title":"Simulated Annealing: Theory and Applications","author":"van Larrhoven","year":"1987"},{"issue":"11","key":"10.1016\/0020-0255(94)90017-5_BIB10","doi-asserted-by":"crossref","first-page":"1384","DOI":"10.1109\/12.8704","article-title":"Heuristic algorithms for task assignment in distributed system","volume":"C-37","author":"Lo","year":"1988","journal-title":"IEEE Trans. Comput."},{"issue":"1","key":"10.1016\/0020-0255(94)90017-5_BIB11","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\/0020-0255(94)90017-5_BIB12","series-title":"Problem Solving Methods in Artificial Intelligence","author":"Nilsson","year":"1977"},{"issue":"4","key":"10.1016\/0020-0255(94)90017-5_BIB13","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1109\/TC.1979.1675348","article-title":"Assignment of task in a distributed processor system with limited memory","volume":"C-28","author":"Rao","year":"1979","journal-title":"IEEE Trans. Comput."},{"issue":"3","key":"10.1016\/0020-0255(94)90017-5_BIB14","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 Trans. Comput."},{"issue":"5","key":"10.1016\/0020-0255(94)90017-5_BIB15","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 Trans. Comput."},{"issue":"4","key":"10.1016\/0020-0255(94)90017-5_BIB16","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":"Parallel and Distributed Comput."},{"issue":"1","key":"10.1016\/0020-0255(94)90017-5_BIB17","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 Trans. Software Eng."},{"issue":"3","key":"10.1016\/0020-0255(94)90017-5_BIB18","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 Trans. Software Eng."},{"issue":"2","key":"10.1016\/0020-0255(94)90017-5_BIB19","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 Eng."},{"issue":"1","key":"10.1016\/0020-0255(94)90017-5_BIB20","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(94)90017-5_BIB21","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:0020025594900175?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020025594900175?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,3,24]],"date-time":"2020-03-24T15:04:07Z","timestamp":1585062247000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020025594900175"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,5]]},"references-count":21,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1994,5]]}},"alternative-id":["0020025594900175"],"URL":"https:\/\/doi.org\/10.1016\/0020-0255(94)90017-5","relation":{},"ISSN":["0020-0255"],"issn-type":[{"value":"0020-0255","type":"print"}],"subject":[],"published":{"date-parts":[[1994,5]]}}}