{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T07:10:09Z","timestamp":1759648209879,"version":"build-2065373602"},"reference-count":13,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1997,2,1]],"date-time":"1997-02-01T00:00:00Z","timestamp":854755200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1997,2,1]],"date-time":"1997-02-01T00:00:00Z","timestamp":854755200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Computers & Operations Research"],"published-print":{"date-parts":[[1997,2]]},"DOI":"10.1016\/s0305-0548(96)00037-8","type":"journal-article","created":{"date-parts":[[2003,4,4]],"date-time":"2003-04-04T19:18:15Z","timestamp":1049483895000},"page":"147-152","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":6,"title":["Single machine scheduling to minimize weighted earliness subject to maximum tardiness"],"prefix":"10.1016","volume":"24","author":[{"given":"Chen","family":"Tsiushuang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qi","family":"Xiangtong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tu","family":"Fengsheng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0305-0548(96)00037-8_BIB1","doi-asserted-by":"crossref","first-page":"22","DOI":"10.1287\/opre.38.1.22","article-title":"Sequencing with earliness and tardiness penalties: A review","volume":"38","author":"Baker","year":"1990","journal-title":"Opns. Res."},{"key":"10.1016\/S0305-0548(96)00037-8_BIB2","doi-asserted-by":"crossref","first-page":"595","DOI":"10.1016\/0305-0483(89)90063-7","article-title":"A framework for single machine multiple objective sequencing research","volume":"17","author":"Fry","year":"1989","journal-title":"Omega"},{"key":"10.1016\/S0305-0548(96)00037-8_BIB3","doi-asserted-by":"crossref","first-page":"836","DOI":"10.1287\/opre.39.5.836","article-title":"Earliness-tardiness scheduling problems, I: weighted deviation of completion times about a common due date","volume":"39","author":"Hall","year":"1991","journal-title":"Opns. Res."},{"key":"10.1016\/S0305-0548(96)00037-8_BIB4","doi-asserted-by":"crossref","first-page":"847","DOI":"10.1287\/opre.39.5.847","article-title":"Earliness-tardiness scheduling problems, II: deviation of completion times about a restrictive common due date","volume":"39","author":"Hall","year":"1991","journal-title":"Opns. Res."},{"key":"10.1016\/S0305-0548(96)00037-8_BIB5","doi-asserted-by":"crossref","first-page":"258","DOI":"10.1016\/0377-2217(93)90181-L","article-title":"Scheduling with monotonous earliness and tardiness penalties","volume":"64","author":"Kahlbacher","year":"1993","journal-title":"Eur. J. Opnl. Res."},{"key":"10.1016\/S0305-0548(96)00037-8_BIB6","doi-asserted-by":"crossref","first-page":"128","DOI":"10.1057\/jors.1995.14","article-title":"A note on the V-shaped property in one-machine scheduling","volume":"46","author":"Alidaee","year":"1995","journal-title":"J. Opnl. Res. Soc."},{"key":"10.1016\/S0305-0548(96)00037-8_BIB7","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1016\/0305-0548(90)90033-4","article-title":"Single machine scheduling to minimize mean absolute lateness: A heuristic solution","volume":"17","author":"Fry","year":"1990","journal-title":"Comp. Opns. Res."},{"key":"10.1016\/S0305-0548(96)00037-8_BIB8","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1016\/0167-6377(94)90078-7","article-title":"Earliness tardiness scheduling problems with a common delivery window","volume":"15","author":"Liman","year":"1994","journal-title":"Opns. Res. Let."},{"key":"10.1016\/S0305-0548(96)00037-8_BIB9","first-page":"144","article-title":"Scheduling problems with non-regular penalty functions\u2014a review","volume":"25","author":"Raghavachari","year":"1988","journal-title":"Opsearch"},{"article-title":"Single machine scheduling to minimize earliness subject to deadlines","year":"1986","author":"Ahmadi","key":"10.1016\/S0305-0548(96)00037-8_BIB10"},{"article-title":"Just-in-time scheduling in single machine systems","year":"1986","author":"Ahmadi","key":"10.1016\/S0305-0548(96)00037-8_BIB11"},{"key":"10.1016\/S0305-0548(96)00037-8_BIB12","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1016\/0377-2217(88)90356-6","article-title":"Single machine scheduling to minimize weighted earliness subject to no tardy jobs","volume":"34","author":"Chand","year":"1988","journal-title":"Eur. J. Opnl. Res."},{"key":"10.1016\/S0305-0548(96)00037-8_BIB13","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":"Nav. Res. Logist. Q."}],"container-title":["Computers & Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054896000378?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054896000378?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T06:50:36Z","timestamp":1759647036000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0305054896000378"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,2]]},"references-count":13,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1997,2]]}},"alternative-id":["S0305054896000378"],"URL":"https:\/\/doi.org\/10.1016\/s0305-0548(96)00037-8","relation":{},"ISSN":["0305-0548"],"issn-type":[{"type":"print","value":"0305-0548"}],"subject":[],"published":{"date-parts":[[1997,2]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Single machine scheduling to minimize weighted earliness subject to maximum tardiness","name":"articletitle","label":"Article Title"},{"value":"Computers & Operations Research","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/S0305-0548(96)00037-8","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1997 Published by Elsevier Ltd.","name":"copyright","label":"Copyright"}]}}