{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,25]],"date-time":"2026-02-25T12:09:42Z","timestamp":1772021382818,"version":"3.50.1"},"reference-count":16,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1991,1,1]],"date-time":"1991-01-01T00:00:00Z","timestamp":662688000000},"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":["Computers & Operations Research"],"published-print":{"date-parts":[[1991,1]]},"DOI":"10.1016\/0305-0548(91)90034-o","type":"journal-article","created":{"date-parts":[[2003,6,30]],"date-time":"2003-06-30T16:15:45Z","timestamp":1056989745000},"page":"323-331","source":"Crossref","is-referenced-by-count":69,"title":["Heuristics for scheduling unrelated parallel machines"],"prefix":"10.1016","volume":"18","author":[{"given":"A.M.A.","family":"Hariri","sequence":"first","affiliation":[]},{"given":"C.N.","family":"Potts","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0305-0548(91)90034-O_BIB1","article-title":"Sequencing and scheduling: algorithms and complexity","author":"Lawler","year":"1989"},{"key":"10.1016\/0305-0548(91)90034-O_BIB2","series-title":"Complexity of Computer Computations","first-page":"85","article-title":"Reducibility among combinatorial problems","author":"Karp","year":"1972"},{"key":"10.1016\/0305-0548(91)90034-O_BIB3","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1007\/BF01585745","article-title":"Approximation algorithms for scheduling unrelated parallel machines","volume":"46","author":"Lenstra","year":"1990","journal-title":"Mathemat. Program"},{"key":"10.1016\/0305-0548(91)90034-O_BIB4","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1287\/mnsc.26.1.1","article-title":"Worst case analysis of heuristic algorithms","volume":"26","author":"Fisher","year":"1980","journal-title":"Mgmt Sci."},{"key":"10.1016\/0305-0548(91)90034-O_BIB5","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1287\/opre.26.1.3","article-title":"Performance guarantees for scheduling algorithms","volume":"26","author":"Garey","year":"1978","journal-title":"Ops Res."},{"key":"10.1016\/0305-0548(91)90034-O_BIB6","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1016\/0166-218X(85)90009-5","article-title":"Analysis of a linear programming heuristic for scheduling unrelated parallel machines","volume":"10","author":"Potts","year":"1985","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/0305-0548(91)90034-O_BIB7","doi-asserted-by":"crossref","first-page":"280","DOI":"10.1145\/322003.322011","article-title":"Heuristic algorithms for scheduling independent tasks on nonidentical processes","volume":"24","author":"Ibarra","year":"1977","journal-title":"J. ACM"},{"key":"10.1016\/0305-0548(91)90034-O_BIB8","doi-asserted-by":"crossref","first-page":"721","DOI":"10.1145\/322276.322284","article-title":"Algorithms for scheduling tasks on unrelated processors","volume":"28","author":"Davis","year":"1981","journal-title":"J. ACM"},{"key":"10.1016\/0305-0548(91)90034-O_BIB9","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1016\/0167-6377(85)90043-4","article-title":"Worst case analysis of a scheduling algorithm","volume":"4","author":"Spinrad","year":"1985","journal-title":"Ops Res. Lett."},{"key":"10.1016\/0305-0548(91)90034-O_BIB10","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1145\/321941.321951","article-title":"Exact and approximate algorithms for scheduling nonidentical processors","volume":"23","author":"Horowitz","year":"1976","journal-title":"J. ACM"},{"key":"10.1016\/0305-0548(91)90034-O_BIB11","first-page":"191","article-title":"A polynomial algorithm in linear programming","volume":"20","author":"Khachian","year":"1979","journal-title":"Soviet Math. Dokl."},{"key":"10.1016\/0305-0548(91)90034-O_BIB12","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1007\/BF02579150","article-title":"A new polynomial-time algorithm for linear programming","volume":"4","author":"Karmarkar","year":"1984","journal-title":"Combinatorica"},{"key":"10.1016\/0305-0548(91)90034-O_BIB13","series-title":"Combinatorial Optimization: Networks and Matroids","author":"Lawler","year":"1976"},{"key":"10.1016\/0305-0548(91)90034-O_BIB14","series-title":"Fortran Codes for Mathematical Programming","author":"Land","year":"1973"},{"key":"10.1016\/0305-0548(91)90034-O_BIB15","series-title":"Simulated Annealing: Theory and Applications","author":"Van Laarhoven","year":"1987"},{"key":"10.1016\/0305-0548(91)90034-O_BIB16","doi-asserted-by":"crossref","first-page":"533","DOI":"10.1016\/0305-0548(86)90048-1","article-title":"Future path for integer programming and links to artificial intelligence","volume":"13","author":"Glover","year":"1986","journal-title":"Computers Ops Res."}],"container-title":["Computers & Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030505489190034O?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030505489190034O?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,18]],"date-time":"2019-03-18T17:21:22Z","timestamp":1552929682000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/030505489190034O"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,1]]},"references-count":16,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1991,1]]}},"alternative-id":["030505489190034O"],"URL":"https:\/\/doi.org\/10.1016\/0305-0548(91)90034-o","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[1991,1]]}}}