{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,16]],"date-time":"2026-01-16T12:55:27Z","timestamp":1768568127058,"version":"3.49.0"},"reference-count":20,"publisher":"Elsevier BV","issue":"3","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\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":7106,"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":[[1994,2]]},"DOI":"10.1016\/0166-218x(92)00176-m","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:02:11Z","timestamp":1027652531000},"page":"201-218","source":"Crossref","is-referenced-by-count":44,"title":["Scheduling identical parallel machines to minimize total weighted completion time"],"prefix":"10.1016","volume":"48","author":[{"given":"H.","family":"Belouadah","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"C.N.","family":"Potts","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0166-218X(92)00176-M_BIB1","doi-asserted-by":"crossref","first-page":"793","DOI":"10.1002\/nav.3800200417","article-title":"Scheduling with parallel processors and linear delay costs","volume":"20","author":"Baker","year":"1973","journal-title":"Naval Res. Logist. Quart."},{"key":"10.1016\/0166-218X(92)00176-M_BIB2","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1080\/05695557708975117","article-title":"An improved algorithm for scheduling jobs on identical machines","volume":"9","author":"Barnes","year":"1977","journal-title":"AIIE Trans."},{"key":"10.1016\/0166-218X(92)00176-M_BIB3","doi-asserted-by":"crossref","first-page":"382","DOI":"10.1145\/361011.361064","article-title":"Scheduling independent tasks to reduce mean finishing time","volume":"17","author":"Bruno","year":"1974","journal-title":"Comm. ACM"},{"key":"10.1016\/0166-218X(92)00176-M_BIB4","doi-asserted-by":"crossref","first-page":"262","DOI":"10.1016\/0377-2217(87)90240-2","article-title":"Project scheduling with resource constraints: a branch and bound approach","volume":"29","author":"Christofides","year":"1987","journal-title":"European J. Oper. Res."},{"key":"10.1016\/0166-218X(92)00176-M_BIB5","series-title":"Theory of Scheduling","author":"Conway","year":"1967"},{"key":"10.1016\/0166-218X(92)00176-M_BIB6","doi-asserted-by":"crossref","first-page":"268","DOI":"10.1287\/mnsc.11.2.268","article-title":"Bounds for the optimal scheduling of n jobs on m processors","volume":"11","author":"Eastman","year":"1964","journal-title":"Management Sci."},{"key":"10.1016\/0166-218X(92)00176-M_BIB7","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1080\/05695557408974926","article-title":"Scheduling jobs on a number of identical machines","volume":"6","author":"Elmaghraby","year":"1974","journal-title":"AIIE Trans."},{"key":"10.1016\/0166-218X(92)00176-M_BIB8","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1007\/BF01580393","article-title":"A dual algorithm for the one-machine scheduling problem","volume":"11","author":"Fisher","year":"1976","journal-title":"Math. Programming"},{"key":"10.1016\/0166-218X(92)00176-M_BIB9","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1287\/mnsc.27.1.1","article-title":"The Lagrangian relaxation method for integer programming problems","volume":"27","author":"Fisher","year":"1981","journal-title":"Management Sci."},{"key":"10.1016\/0166-218X(92)00176-M_BIB10","doi-asserted-by":"crossref","first-page":"82","DOI":"10.1007\/BFb0120690","article-title":"Lagrangean relaxation for integer programming","volume":"2","author":"Geoffrion","year":"1974","journal-title":"Math. Programming Stud."},{"key":"10.1016\/0166-218X(92)00176-M_BIB11","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1016\/0166-218X(83)90019-7","article-title":"An algorithm for single machine sequencing with release dates to minimize total weighted completion time","volume":"5","author":"Hariri","year":"1983","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/0166-218X(92)00176-M_BIB12","doi-asserted-by":"crossref","first-page":"62","DOI":"10.1007\/BF01580223","article-title":"Validation of subgradient optimization","volume":"6","author":"Held","year":"1974","journal-title":"Math. Programming"},{"key":"10.1016\/0166-218X(92)00176-M_BIB13","doi-asserted-by":"crossref","first-page":"1119","DOI":"10.1137\/0215081","article-title":"Worst case bound of an LRF schedule for the mean weighted flow-time problem","volume":"15","author":"Kawaguchi","year":"1986","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0166-218X(92)00176-M_BIB14","first-page":"75","article-title":"Sequencing jobs to minimize total weighted completion time subject to precedence constraints","volume":"2","author":"Lawler","year":"1978"},{"key":"10.1016\/0166-218X(92)00176-M_BIB15","doi-asserted-by":"crossref","first-page":"1300","DOI":"10.1287\/mnsc.31.10.1300","article-title":"A Lagrangean based branch and bound algorithm for single machine sequencing with precedence constraints to minimize total weighted completion time","volume":"31","author":"Potts","year":"1985","journal-title":"Management Sci."},{"key":"10.1016\/0166-218X(92)00176-M_BIB16","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1016\/0377-2217(83)90159-5","article-title":"An algorithm for single machine sequencing with deadlines to minimize total weighted completion time","volume":"12","author":"Potts","year":"1983","journal-title":"European J. Oper. Res."},{"key":"10.1016\/0166-218X(92)00176-M_BIB17","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1287\/opre.33.2.363","article-title":"A branch and bound algorithm for the total weighted tardiness problem","volume":"33","author":"Potts","year":"1985","journal-title":"Oper. Res."},{"key":"10.1016\/0166-218X(92)00176-M_BIB18","doi-asserted-by":"crossref","first-page":"116","DOI":"10.1145\/321921.321934","article-title":"Algorithms for scheduling independent tasks","volume":"23","author":"Sahni","year":"1976","journal-title":"J. ACM"},{"key":"10.1016\/0166-218X(92)00176-M_BIB19","doi-asserted-by":"crossref","first-page":"1183","DOI":"10.1080\/00207548808947934","article-title":"An improved branching scheme for the branch and bound procedure of scheduling n jobs on m parallel machines to minimize total weighted flowtime","volume":"26","author":"Sarin","year":"1988","journal-title":"Internat. J. Production Res."},{"key":"10.1016\/0166-218X(92)00176-M_BIB20","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1002\/nav.3800030106","article-title":"Various optimizers for single-stage production","volume":"3","author":"Smith","year":"1956","journal-title":"Naval Res. Logist. Quart."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X9200176M?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X9200176M?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T23:53:46Z","timestamp":1555199626000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166218X9200176M"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,2]]},"references-count":20,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1994,2]]}},"alternative-id":["0166218X9200176M"],"URL":"https:\/\/doi.org\/10.1016\/0166-218x(92)00176-m","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1994,2]]}}}