{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,8]],"date-time":"2026-05-08T16:06:26Z","timestamp":1778256386987,"version":"3.51.4"},"reference-count":13,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1985,2,1]],"date-time":"1985-02-01T00:00:00Z","timestamp":476064000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":10393,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[1985,2]]},"DOI":"10.1016\/0166-218x(85)90009-5","type":"journal-article","created":{"date-parts":[[2002,10,10]],"date-time":"2002-10-10T22:04:08Z","timestamp":1034287448000},"page":"155-164","source":"Crossref","is-referenced-by-count":133,"title":["Analysis of a linear programming heuristic for scheduling unrelated parallel machines"],"prefix":"10.1016","volume":"10","author":[{"given":"C.N.","family":"Potts","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0166-218X(85)90009-5_BIB1","doi-asserted-by":"crossref","first-page":"448","DOI":"10.1016\/S0022-0000(73)80033-9","article-title":"Time bounds for selection","volume":"7","author":"Blum","year":"1973","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0166-218X(85)90009-5_BIB2","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. Assoc. Comput. Mach."},{"key":"10.1016\/0166-218X(85)90009-5_BIB3","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":"Management Sci."},{"key":"10.1016\/0166-218X(85)90009-5_BIB4","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":"Oper. Res."},{"key":"10.1016\/0166-218X(85)90009-5_BIB5","unstructured":"T. Gonzalez, E.L. Lawler and S. Sahni, Optimal preemptive scheduling of two unrelated parallel processors in linear time, J. Assoc. Comput. Mach., to appear."},{"key":"10.1016\/0166-218X(85)90009-5_BIB6","series-title":"Linear Programming","author":"Hadley","year":"1962"},{"key":"10.1016\/0166-218X(85)90009-5_BIB7","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. Assoc. Comput. Mach."},{"key":"10.1016\/0166-218X(85)90009-5_BIB8","doi-asserted-by":"crossref","first-page":"280","DOI":"10.1145\/322003.322011","article-title":"Heuristic algorithms for scheduling independent tasks on nonidentical processors","volume":"24","author":"Ibarra","year":"1977","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0166-218X(85)90009-5_BIB9","series-title":"Complexity of Computer Computations","first-page":"85","article-title":"Reducibility among combinatorial problems","author":"Karp","year":"1972"},{"key":"10.1016\/0166-218X(85)90009-5_BIB10","first-page":"191","article-title":"A polynomial time algorithm in linear programming","volume":"20","author":"Khachian","year":"1979","journal-title":"Soviet Math. Dokl."},{"key":"10.1016\/0166-218X(85)90009-5_BIB11","doi-asserted-by":"crossref","first-page":"1436","DOI":"10.1287\/opre.28.6.1436","article-title":"Analysis of a heuristic for one machine sequencing with release dates and delivery times","volume":"28","author":"Potts","year":"1980","journal-title":"Oper. Res."},{"key":"10.1016\/0166-218X(85)90009-5_BIB12","series-title":"Report BW 150","article-title":"Analysis of heuristics for two-machine flow-shop sequencing subject to release dates","author":"Potts","year":"1981"},{"key":"10.1016\/0166-218X(85)90009-5_BIB13","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/S0022-0000(76)80029-3","article-title":"Finding the median","volume":"13","author":"Schonhage","year":"1976","journal-title":"J. Comput. Systems Sci."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X85900095?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X85900095?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T21:23:26Z","timestamp":1555190606000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166218X85900095"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1985,2]]},"references-count":13,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1985,2]]}},"alternative-id":["0166218X85900095"],"URL":"https:\/\/doi.org\/10.1016\/0166-218x(85)90009-5","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1985,2]]}}}