{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T22:56:18Z","timestamp":1648767378874},"reference-count":16,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1999,4,1]],"date-time":"1999-04-01T00:00:00Z","timestamp":922924800000},"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":["Journal of Systems and Software"],"published-print":{"date-parts":[[1999,4]]},"DOI":"10.1016\/s0164-1212(98)10088-2","type":"journal-article","created":{"date-parts":[[2003,4,5]],"date-time":"2003-04-05T02:09:52Z","timestamp":1049508592000},"page":"59-75","source":"Crossref","is-referenced-by-count":22,"title":["Optimal task allocation in distributed systems by graph matching and state space search"],"prefix":"10.1016","volume":"46","author":[{"given":"Ajith","family":"Tom P","sequence":"first","affiliation":[]},{"given":"C.","family":"Siva Ram Murthy","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0164-1212(98)10088-2_BIB1","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1109\/TSE.1979.234201","article-title":"Dual processor scheduling with dynamic reassignment","volume":"5","author":"Bokhari","year":"1979","journal-title":"IEEE Transactions on Software Engineering"},{"key":"10.1016\/S0164-1212(98)10088-2_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":"7","author":"Bokhari","year":"1981","journal-title":"IEEE Transactions on Software Engineering"},{"key":"10.1016\/S0164-1212(98)10088-2_BIB3","unstructured":"Chen, G.H., Yur, J.S., 1990. A branch and bound with underestimates algorithm for the task assignment problem with precedence constraint, Proceedings IEEE Conference on Distributed Computing Systems, pp. 494\u2013501"},{"key":"10.1016\/S0164-1212(98)10088-2_BIB4","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\/S0164-1212(98)10088-2_BIB5","doi-asserted-by":"crossref","unstructured":"Chu, W.W., Holloway, L.J., Lan. M.T., Efe, K., 1980. Task allocation in distributed data processing. Computer, pp. 57\u201369","DOI":"10.1109\/MC.1980.1653419"},{"key":"10.1016\/S0164-1212(98)10088-2_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":"Computer"},{"key":"10.1016\/S0164-1212(98)10088-2_BIB7","unstructured":"Garey, M.R., Johnson, D.S., 1979. Computers and Intractability: A Guide to the Theory of NP-Completeness, Freeman, San Francisco"},{"key":"10.1016\/S0164-1212(98)10088-2_BIB8","first-page":"41","article-title":"Heuristic algorithms for task assignment in distributed systems","volume":"31","author":"Lo","year":"1982","journal-title":"IEEE Transactions on Computers"},{"key":"10.1016\/S0164-1212(98)10088-2_BIB9","unstructured":"Nilsson, N.J., 1977. Problem Solving Methods in Artificial Intelligence, McGraw-Hill, New York"},{"key":"10.1016\/S0164-1212(98)10088-2_BIB10","unstructured":"Ramakrishnan, S., Dunning, L., Thondapu, P., Yue, C., 1993. A hybrid task allocation strategy for delay optimization in distributed computer systems. Proceedings IFIP Conference on Computer Networks, Architecture and Applications, pp. 55\u201363"},{"key":"10.1016\/S0164-1212(98)10088-2_BIB11","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":"34","author":"Shen","year":"1985","journal-title":"IEEE Transactions on Computers"},{"key":"10.1016\/S0164-1212(98)10088-2_BIB12","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"},{"key":"10.1016\/S0164-1212(98)10088-2_BIB13","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1109\/TSE.1977.233840","article-title":"Multiprocessor Scheduling with the aid of network flow diagrams","volume":"3","author":"Stone","year":"1977","journal-title":"IEEE Transactions on Software Engineering"},{"key":"10.1016\/S0164-1212(98)10088-2_BIB14","doi-asserted-by":"crossref","first-page":"254","DOI":"10.1109\/TSE.1978.231502","article-title":"Critical load factors in two-processor distributed systems","volume":"4","author":"Stone","year":"1978","journal-title":"IEEE Transactions on Software Engineering"},{"key":"10.1016\/S0164-1212(98)10088-2_BIB15","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\/S0164-1212(98)10088-2_BIB16","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"}],"container-title":["Journal of Systems and Software"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0164121298100882?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0164121298100882?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,19]],"date-time":"2019-04-19T05:56:46Z","timestamp":1555653406000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0164121298100882"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,4]]},"references-count":16,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1999,4]]}},"alternative-id":["S0164121298100882"],"URL":"https:\/\/doi.org\/10.1016\/s0164-1212(98)10088-2","relation":{},"ISSN":["0164-1212"],"issn-type":[{"value":"0164-1212","type":"print"}],"subject":[],"published":{"date-parts":[[1999,4]]}}}