{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,14]],"date-time":"2026-01-14T13:50:59Z","timestamp":1768398659082,"version":"3.49.0"},"reference-count":13,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2000,4,1]],"date-time":"2000-04-01T00:00:00Z","timestamp":954547200000},"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":["European Journal of Operational Research"],"published-print":{"date-parts":[[2000,4]]},"DOI":"10.1016\/s0377-2217(99)00251-9","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T11:03:23Z","timestamp":1027595003000},"page":"509-513","source":"Crossref","is-referenced-by-count":44,"title":["Assignment of program modules to processors: A simulated annealing approach"],"prefix":"10.1016","volume":"122","author":[{"given":"Yskandar","family":"Hamam","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Khalil S","family":"Hindi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0377-2217(99)00251-9_BIB1","doi-asserted-by":"crossref","unstructured":"F. Berman, L. Snyder, On mapping parallel algorithms in parallel architecture, Journal of Parallel and Distributed Computing (1987) 439\u2013458","DOI":"10.1016\/0743-7315(87)90018-9"},{"key":"10.1016\/S0377-2217(99)00251-9_BIB2","doi-asserted-by":"crossref","first-page":"502","DOI":"10.1145\/146637.146646","article-title":"An efficient algorithm for a task allocation problem","volume":"39","author":"Billionet","year":"1992","journal-title":"Journal of ACM"},{"key":"10.1016\/S0377-2217(99)00251-9_BIB3","series-title":"Assignment Problems in Parallel and Distributed Computing","author":"Bokhari","year":"1987"},{"key":"10.1016\/S0377-2217(99)00251-9_BIB4","doi-asserted-by":"crossref","first-page":"738","DOI":"10.1109\/12.277293","article-title":"Parametric module allocation on partial k-trees","volume":"42","author":"Fernandez-Baca","year":"1993","journal-title":"IEEE Transactions on Computers"},{"key":"10.1016\/S0377-2217(99)00251-9_BIB5","doi-asserted-by":"crossref","first-page":"667","DOI":"10.1109\/TC.1987.1676960","article-title":"Task allocation and precedence relations for distributed real-time systems","volume":"36","author":"Chu","year":"1987","journal-title":"IEEE Transactions on Computers"},{"key":"10.1016\/S0377-2217(99)00251-9_BIB6","unstructured":"A. Hagin, G. Dermler, K. Rotherml, Problem formulation, model and algorithms for mapping distributed multimedia applications to distributed computer systems, Technical Report, Universit\u00e4t Stuttgart, Fakult\u00e4t Informatik, February, 1996"},{"key":"10.1016\/S0377-2217(99)00251-9_BIB7","doi-asserted-by":"crossref","unstructured":"C.E. Houstis, M. Aboelaze, A comparative performance analysis of mapping applications to parallel multi-processor systems: A case study, Journal of Parallel and Distributed Computing (1991) 17\u201329","DOI":"10.1016\/0743-7315(91)90106-J"},{"key":"10.1016\/S0377-2217(99)00251-9_BIB8","doi-asserted-by":"crossref","unstructured":"V.M. Lo, Heuristic algorithms for task assignment in distributed systems, IEEE Transactions on Computers, 1988, pp. 1384\u20131397","DOI":"10.1109\/12.8704"},{"key":"10.1016\/S0377-2217(99)00251-9_BIB9","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1109\/12.76406","article-title":"Improved algorithms for mapping pipelined and parallel computations","volume":"40","author":"Nicol","year":"1991","journal-title":"IEEE Transactions on Computers"},{"key":"10.1016\/S0377-2217(99)00251-9_BIB10","first-page":"163","article-title":"Models of machines and computation for mapping in multi-computers","volume":"3","author":"Norman","year":"1993","journal-title":"ACM Computing Surveys"},{"key":"10.1016\/S0377-2217(99)00251-9_BIB11","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1109\/TC.1979.1675348","article-title":"Assignment of tasks in a distributed processing system with limited memory","volume":"28","author":"Rao","year":"1979","journal-title":"IEEE Transactions on Computers"},{"key":"10.1016\/S0377-2217(99)00251-9_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\/S0377-2217(99)00251-9_BIB13","unstructured":"C.R. Reeves, Modern Heuristic Techniques for Combinatorial Problems, Blackwell Scientific Publications, Oxford, 1993"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221799002519?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221799002519?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,27]],"date-time":"2019-04-27T12:57:20Z","timestamp":1556369840000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221799002519"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,4]]},"references-count":13,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2000,4]]}},"alternative-id":["S0377221799002519"],"URL":"https:\/\/doi.org\/10.1016\/s0377-2217(99)00251-9","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[2000,4]]}}}