{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T16:28:46Z","timestamp":1742401726260},"reference-count":14,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1996,3,1]],"date-time":"1996-03-01T00:00:00Z","timestamp":825638400000},"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":[[1996,3]]},"DOI":"10.1016\/0167-8191(95)00068-2","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:18:22Z","timestamp":1027639102000},"page":"395-406","source":"Crossref","is-referenced-by-count":46,"title":["Multiprocessor scheduling in a genetic paradigm"],"prefix":"10.1016","volume":"22","author":[{"given":"Imtiaz","family":"Ahmad","sequence":"first","affiliation":[]},{"given":"Muhammad K.","family":"Dhodhi","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0167-8191(95)00068-2_BIB1","author":"Garey","year":"1979"},{"issue":"1","key":"10.1016\/0167-8191(95)00068-2_BIB2","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\/0167-8191(95)00068-2_BIB3","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1145\/158439.158908","article-title":"Models of machines and computation for mapping in multicomputers","volume":"25","author":"Norman","year":"1993","journal-title":"ACM Computing Surveys"},{"issue":"11","key":"10.1016\/0167-8191(95)00068-2_BIB4","doi-asserted-by":"crossref","first-page":"1023","DOI":"10.1109\/TC.1984.1676376","article-title":"Practical multiprocessor scheduling algorithms for efficient parallel processing","volume":"C-33","author":"Kasahara","year":"1984","journal-title":"IEEE Trans. Comput."},{"issue":"2","key":"10.1016\/0167-8191(95)00068-2_BIB5","doi-asserted-by":"crossref","first-page":"104","DOI":"10.1109\/JRA.1985.1087004","article-title":"Parallel processing of robot-arm control computation onto a multiprocessor system","volume":"RA1","author":"Kasahara","year":"1985","journal-title":"IEEE J. Robotics and Automation"},{"key":"10.1016\/0167-8191(95)00068-2_BIB6","doi-asserted-by":"crossref","first-page":"685","DOI":"10.1145\/361604.361619","article-title":"A comparison of list schedules for parallel processing systems","volume":"17","author":"Adam","year":"1974","journal-title":"Commun. ACM"},{"key":"10.1016\/0167-8191(95)00068-2_BIB7","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1016\/0020-0190(91)90222-4","article-title":"List scheduling of parallel tasks","volume":"37","author":"Wang","year":"1991","journal-title":"Information Processing Letters"},{"key":"10.1016\/0167-8191(95)00068-2_BIB8","doi-asserted-by":"crossref","first-page":"416","DOI":"10.1137\/0117039","article-title":"Bounds on multiprocessoring timing anomalies","volume":"17","author":"Graham","year":"1969","journal-title":"SIAM J. Applied Math."},{"key":"10.1016\/0167-8191(95)00068-2_BIB9","doi-asserted-by":"crossref","first-page":"200","DOI":"10.1007\/BF00288685","article-title":"Optimal scheduling for two-processor systems","volume":"1","author":"Coffman","year":"1972","journal-title":"Acta Informatica"},{"key":"10.1016\/0167-8191(95)00068-2_BIB10","doi-asserted-by":"crossref","first-page":"1321","DOI":"10.1016\/0167-8191(93)90079-Z","article-title":"List scheduling with and without communication delays","volume":"19","author":"Yang","year":"1993","journal-title":"Parallel Computing"},{"issue":"2","key":"10.1016\/0167-8191(95)00068-2_BIB11","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1109\/71.265940","article-title":"A genetic algorithm for multiprocessor scheduling","volume":"5","author":"Hou","year":"1994","journal-title":"IEEE Trans. Parallel Distributed Computing"},{"key":"10.1016\/0167-8191(95)00068-2_BIB12","author":"Goldberg","year":"1989"},{"issue":"8","key":"10.1016\/0167-8191(95)00068-2_BIB13","doi-asserted-by":"crossref","first-page":"934","DOI":"10.1109\/43.402494","article-title":"Datapath synthesis using a problem-space genetic algorithm","volume":"14","author":"Dhodhi","year":"1995","journal-title":"IEEE Trans. CAD"},{"issue":"5","key":"10.1016\/0167-8191(95)00068-2_BIB14","doi-asserted-by":"crossref","first-page":"411","DOI":"10.1002\/cpe.4330070506","article-title":"Task assignment using a problem-space genetic algorithm","volume":"7","author":"Ahmad","year":"1995","journal-title":"Concurrency: Theory and Practice"}],"container-title":["Parallel Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0167819195000682?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0167819195000682?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,18]],"date-time":"2019-04-18T07:20:12Z","timestamp":1555572012000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0167819195000682"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,3]]},"references-count":14,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1996,3]]}},"alternative-id":["0167819195000682"],"URL":"https:\/\/doi.org\/10.1016\/0167-8191(95)00068-2","relation":{},"ISSN":["0167-8191"],"issn-type":[{"value":"0167-8191","type":"print"}],"subject":[],"published":{"date-parts":[[1996,3]]}}}