{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,7]],"date-time":"2025-10-07T14:29:49Z","timestamp":1759847389545},"reference-count":5,"publisher":"Elsevier BV","issue":"6","license":[{"start":{"date-parts":[[2001,9,1]],"date-time":"2001-09-01T00:00:00Z","timestamp":999302400000},"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":["Information Processing Letters"],"published-print":{"date-parts":[[2001,9]]},"DOI":"10.1016\/s0020-0190(01)00143-0","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T21:08:51Z","timestamp":1027631331000},"page":"273-280","source":"Crossref","is-referenced-by-count":31,"title":["Single machine scheduling to minimize total compression plus weighted flow cost is NP-hard"],"prefix":"10.1016","volume":"79","author":[{"given":"Guohua","family":"Wan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Benjamin P.-C.","family":"Yen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chung-Lun","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0020-0190(01)00143-0_BIB001","doi-asserted-by":"crossref","first-page":"330","DOI":"10.1287\/moor.13.2.330","article-title":"One processor scheduling with symmetric earliness and tardiness penalties","volume":"13","author":"Garey","year":"1988","journal-title":"Math. Oper. Res."},{"key":"10.1016\/S0020-0190(01)00143-0_BIB002","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1016\/0166-218X(90)90105-L","article-title":"A survey of results for sequencing problems with controllable processing times","volume":"26","author":"Nowicki","year":"1990","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0020-0190(01)00143-0_BIB003","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. Quarterly"},{"key":"10.1016\/S0020-0190(01)00143-0_BIB004","doi-asserted-by":"crossref","first-page":"258","DOI":"10.1080\/05695558008974515","article-title":"Two single machine sequencing problems involving controllable job processing times","volume":"12","author":"Vickson","year":"1980","journal-title":"AIIE Trans."},{"key":"10.1016\/S0020-0190(01)00143-0_BIB005","doi-asserted-by":"crossref","first-page":"1155","DOI":"10.1287\/opre.28.5.1155","article-title":"Choosing the job sequence and processing times to minimize total processing plus flow cost on a single machine","volume":"28","author":"Vickson","year":"1980","journal-title":"Oper. Res."}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019001001430?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019001001430?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,20]],"date-time":"2019-04-20T17:26:40Z","timestamp":1555781200000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020019001001430"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,9]]},"references-count":5,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2001,9]]}},"alternative-id":["S0020019001001430"],"URL":"https:\/\/doi.org\/10.1016\/s0020-0190(01)00143-0","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[2001,9]]}}}