{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,25]],"date-time":"2026-04-25T11:08:06Z","timestamp":1777115286664,"version":"3.51.4"},"reference-count":12,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1992,5,1]],"date-time":"1992-05-01T00:00:00Z","timestamp":704678400000},"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":7747,"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":[[1992,5]]},"DOI":"10.1016\/0166-218x(92)90255-9","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:43:01Z","timestamp":1027654981000},"page":"213-231","source":"Crossref","is-referenced-by-count":88,"title":["Scheduling with release dates on a single machine to minimize total weighted completion time"],"prefix":"10.1016","volume":"36","author":[{"given":"H.","family":"Belouadah","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M.E.","family":"Posner","sequence":"additional","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)90255-9_BIB1","series-title":"M. Sc. Thesis","article-title":"Scheduling, to minimize total cost","author":"Belouadah","year":"1985"},{"key":"10.1016\/0166-218X(92)90255-9_BIB2","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1002\/nav.3800290114","article-title":"Scheduling of a single machine to minimize total weighted completion time subject to release dates","volume":"29","author":"Bianco","year":"1982","journal-title":"Naval Res. Logist. Quart."},{"key":"10.1016\/0166-218X(92)90255-9_BIB3","doi-asserted-by":"crossref","first-page":"42","DOI":"10.1016\/S0377-2217(82)80007-6","article-title":"The one-machine sequencing problem","volume":"11","author":"Carlier","year":"1982","journal-title":"European J. Oper. Res."},{"key":"10.1016\/0166-218X(92)90255-9_BIB4","doi-asserted-by":"crossref","first-page":"537","DOI":"10.1002\/nav.3800260315","article-title":"On n\/1\/F\u0304 dynamic deterministic systems","volume":"26","author":"Chandra","year":"1979","journal-title":"Naval Res. Logist. Quart."},{"key":"10.1016\/0166-218X(92)90255-9_BIB5","doi-asserted-by":"crossref","first-page":"192","DOI":"10.1137\/0210014","article-title":"Sequencing jobs with unequal ready times to minimize mean flow time","volume":"10","author":"Dessouky","year":"1981","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0166-218X(92)90255-9_BIB6","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1016\/0166-218X(90)90104-K","article-title":"Formulating the single machine sequencing problem with release dates as a mixed integer program","volume":"26","author":"Dyer","year":"1990","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/0166-218X(92)90255-9_BIB7","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)90255-9_BIB8","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)90255-9_BIB9","first-page":"343","article-title":"Complexity of machine scheduling problems","volume":"1","author":"Lenstra","year":"1977"},{"key":"10.1016\/0166-218X(92)90255-9_BIB10","doi-asserted-by":"crossref","first-page":"562","DOI":"10.1287\/opre.33.3.562","article-title":"Minimizing weighted completion times with deadlines","volume":"33","author":"Posner","year":"1985","journal-title":"Oper. Res."},{"key":"10.1016\/0166-218X(92)90255-9_BIB11","series-title":"Report R.77-24","article-title":"On a job scheduling problem with different ready times: some properties and a new algorithm to determine the optimal solution","author":"Rinaldi","year":"1977"},{"key":"10.1016\/0166-218X(92)90255-9_BIB12","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:0166218X92902559?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X92902559?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T06:23:10Z","timestamp":1555136590000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166218X92902559"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,5]]},"references-count":12,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1992,5]]}},"alternative-id":["0166218X92902559"],"URL":"https:\/\/doi.org\/10.1016\/0166-218x(92)90255-9","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1992,5]]}}}