{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,11]],"date-time":"2026-06-11T19:08:40Z","timestamp":1781204920423,"version":"3.54.1"},"reference-count":16,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1997,5,1]],"date-time":"1997-05-01T00:00:00Z","timestamp":862444800000},"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":5921,"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":[[1997,5]]},"DOI":"10.1016\/s0166-218x(96)00087-x","type":"journal-article","created":{"date-parts":[[2003,4,7]],"date-time":"2003-04-07T17:19:33Z","timestamp":1049735973000},"page":"169-188","source":"Crossref","is-referenced-by-count":68,"title":["Exact and approximation algorithms for makespan minimization on unrelated parallel machines"],"prefix":"10.1016","volume":"75","author":[{"given":"Silvano","family":"Martello","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Fran\u00e7ois","family":"Soumis","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Paolo","family":"Toth","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/S0166-218X(96)00087-X_BIB1","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\/S0166-218X(96)00087-X_BIB2","doi-asserted-by":"crossref","first-page":"586","DOI":"10.1111\/j.1540-5915.1980.tb01163.x","article-title":"Scheduling to minimize makespan on unequal parallel processors","volume":"11","author":"De","year":"1980","journal-title":"Decision Sci."},{"key":"10.1016\/S0166-218X(96)00087-X_BIB3","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1287\/opre.37.2.319","article-title":"An additive bounding procedure for combinatorial optimization problems","volume":"37","author":"Fischetti","year":"1989","journal-title":"Oper. Res."},{"key":"10.1016\/S0166-218X(96)00087-X_BIB4","series-title":"Computers and intractability: A Guide to the theory of NP-completeness","author":"Garey","year":"1979"},{"key":"10.1016\/S0166-218X(96)00087-X_BIB5","doi-asserted-by":"crossref","first-page":"82","DOI":"10.1007\/BFb0120690","article-title":"Lagrangian relaxation and its uses in integer programming","volume":"2","author":"Geoffrion","year":"1974","journal-title":"Math. Prog. Study"},{"key":"10.1016\/S0166-218X(96)00087-X_BIB6","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1016\/0305-0548(91)90034-O","article-title":"Heuristics for scheduling unrelated parallel machines","volume":"18","author":"Hariri","year":"1991","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/S0166-218X(96)00087-X_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\/S0166-218X(96)00087-X_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\/S0166-218X(96)00087-X_BIB9","doi-asserted-by":"crossref","first-page":"612","DOI":"10.1145\/322092.322101","article-title":"On preemptive scheduling of unrelated parallel processors by linear programming","volume":"25","author":"Lawler","year":"1978","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/S0166-218X(96)00087-X_BIB10","article-title":"Sequencing and scheduling: Algorithms and complexity","volume":"Vol. 4","author":"Lawler","year":"1993"},{"key":"10.1016\/S0166-218X(96)00087-X_BIB11","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":"Math. Programming"},{"key":"10.1016\/S0166-218X(96)00087-X_BIB12","series-title":"Knapsack Problems: Algorithms and Computer Implementations","author":"Martello","year":"1990"},{"key":"10.1016\/S0166-218X(96)00087-X_BIB13","doi-asserted-by":"crossref","first-page":"621","DOI":"10.1016\/0377-2217(93)E0271-X","article-title":"The bottleneck generalized assignment problem","volume":"83","author":"Martello","year":"1995","journal-title":"European J. Oper. Res."},{"key":"10.1016\/S0166-218X(96)00087-X_BIB14","series-title":"Duality based relaxations for makespan minimization for unrelated parallel machines","author":"Palekar","year":"1991"},{"key":"10.1016\/S0166-218X(96)00087-X_BIB15","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\/S0166-218X(96)00087-X_BIB16","doi-asserted-by":"crossref","first-page":"192","DOI":"10.1287\/ijoc.5.2.192","article-title":"Duality-based algorithms for scheduling unrelated parallel machines","volume":"5","author":"van de Velde","year":"1993","journal-title":"ORSA J. Comput."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X9600087X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X9600087X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,24]],"date-time":"2019-04-24T18:28:54Z","timestamp":1556130534000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X9600087X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,5]]},"references-count":16,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1997,5]]}},"alternative-id":["S0166218X9600087X"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(96)00087-x","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1997,5]]}}}