{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,25]],"date-time":"2026-02-25T00:32:32Z","timestamp":1771979552434,"version":"3.50.1"},"reference-count":20,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1994,2,1]],"date-time":"1994-02-01T00:00:00Z","timestamp":760060800000},"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":[[1994,2]]},"DOI":"10.1016\/0305-0548(94)90053-1","type":"journal-article","created":{"date-parts":[[2003,6,30]],"date-time":"2003-06-30T12:15:45Z","timestamp":1056975345000},"page":"205-210","source":"Crossref","is-referenced-by-count":49,"title":["A composite heuristic for the identical parallel machine scheduling problem with minimum makespan objective"],"prefix":"10.1016","volume":"21","author":[{"given":"Paulo M.","family":"Fran\u00e7a","sequence":"first","affiliation":[]},{"given":"Michel","family":"Gendreau","sequence":"additional","affiliation":[]},{"given":"Gilbert","family":"Laporte","sequence":"additional","affiliation":[]},{"given":"Felipe M.","family":"M\u00fcller","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0305-0548(94)90053-1_BIB1","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/S0167-5060(08)70356-X","article-title":"Optimization and approximation in deterministic sequencing and scheduling: a survey","volume":"5","author":"Graham","year":"1979","journal-title":"Annals discr. Math."},{"key":"10.1016\/0305-0548(94)90053-1_BIB2","article-title":"Sequencing and scheduling: algorithms and complexity","author":"Lawler","year":"1989"},{"key":"10.1016\/0305-0548(94)90053-1_BIB3","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1016\/0377-2217(90)90215-W","article-title":"A state-of-the-art review of parallel-machine scheduling research","volume":"47","author":"Cheng","year":"1990","journal-title":"Eur. J. Opl Res."},{"key":"10.1016\/0305-0548(94)90053-1_BIB4","doi-asserted-by":"crossref","first-page":"499","DOI":"10.1145\/322077.322090","article-title":"Strong NP-completeness results: motivation, examples and implications","volume":"25","author":"Garey","year":"1978","journal-title":"J. assoc. comput. Mach."},{"key":"10.1016\/0305-0548(94)90053-1_BIB5","first-page":"1","article-title":"Selected topics in scheduling theory","volume":"31","author":"Blazewicz","year":"1987","journal-title":"Annals discr. Math."},{"key":"10.1016\/0305-0548(94)90053-1_BIB6","article-title":"Optimal scheduling of tasks on identical parallel processors","author":"Dell'Amico","year":"1990"},{"key":"10.1016\/0305-0548(94)90053-1_BIB7","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1002\/nav.3800220113","article-title":"Scheduling with earliest start and due date constraints on multiple machines","volume":"22","author":"Bratley","year":"1975","journal-title":"Naval Res. Logist. Q."},{"key":"10.1016\/0305-0548(94)90053-1_BIB8","doi-asserted-by":"crossref","first-page":"416","DOI":"10.1137\/0117039","article-title":"Bounds on multiprocessing timing anomalies","volume":"17","author":"Graham","year":"1969","journal-title":"SIAM J. appl. Math."},{"key":"10.1016\/0305-0548(94)90053-1_BIB9","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1137\/0207001","article-title":"An application of bin-packing to multiprocessor scheduling","volume":"7","author":"Coffman","year":"1978","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0305-0548(94)90053-1_BIB10","doi-asserted-by":"crossref","first-page":"554","DOI":"10.1137\/0216037","article-title":"Tighter bounds for LPT scheduling on uniform processors","volume":"16","author":"Friesen","year":"1987","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0305-0548(94)90053-1_BIB11","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1016\/0196-6774(86)90037-4","article-title":"Evaluation of a MULTIFIT-based scheduling algorithm","volume":"7","author":"Friesen","year":"1986","journal-title":"J. Algorith."},{"key":"10.1016\/0305-0548(94)90053-1_BIB12","doi-asserted-by":"crossref","first-page":"116","DOI":"10.1145\/321921.321934","article-title":"Algorithms for scheduling independent tasks","volume":"23","author":"Sanhi","year":"1976","journal-title":"J. assoc. comput Mach."},{"key":"10.1016\/0305-0548(94)90053-1_BIB13","doi-asserted-by":"crossref","first-page":"144","DOI":"10.1145\/7531.7535","article-title":"Using dual approximation algorithms for scheduling problems: theoretical and practical results","volume":"34","author":"Hochbaum","year":"1987","journal-title":"J. assoc. comput. Mach."},{"key":"10.1016\/0305-0548(94)90053-1_BIB14","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1016\/0020-0190(89)90223-8","article-title":"Bin-packing with restricted piece sizes","volume":"31","author":"Leung","year":"1989","journal-title":"Inform. Process. Letters"},{"key":"10.1016\/0305-0548(94)90053-1_BIB15","doi-asserted-by":"crossref","first-page":"312","DOI":"10.1007\/BF01930985","article-title":"A linear time approximation algorithm for multiprocessor scheduling","volume":"19","author":"Finn","year":"1979","journal-title":"BIT"},{"key":"10.1016\/0305-0548(94)90053-1_BIB16","series-title":"Algorithm Design for Computer System Design","first-page":"49","article-title":"Approximation algorithms for bin-packing\u2014an updated survey","author":"Coffman","year":"1984"},{"key":"10.1016\/0305-0548(94)90053-1_BIB17","doi-asserted-by":"crossref","first-page":"282","DOI":"10.1007\/BF01934441","article-title":"Improved 01 interchange scheduling","volume":"22","author":"Langston","year":"1982","journal-title":"BIT"},{"key":"10.1016\/0305-0548(94)90053-1_BIB18","doi-asserted-by":"crossref","first-page":"170","DOI":"10.1137\/0213013","article-title":"Tighter bounds for the MULTIFIT processor scheduling","volume":"13","author":"Friesen","year":"1984","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0305-0548(94)90053-1_BIB19","series-title":"Knapsack Problems","author":"Martello","year":"1990"},{"key":"10.1016\/0305-0548(94)90053-1_BIB20","article-title":"The PFORT verifier","author":"Ryder","year":"1981"}],"container-title":["Computers & Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0305054894900531?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0305054894900531?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,18]],"date-time":"2019-03-18T13:26:02Z","timestamp":1552915562000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0305054894900531"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,2]]},"references-count":20,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1994,2]]}},"alternative-id":["0305054894900531"],"URL":"https:\/\/doi.org\/10.1016\/0305-0548(94)90053-1","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[1994,2]]}}}