{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,19]],"date-time":"2026-02-19T06:00:00Z","timestamp":1771480800934,"version":"3.50.1"},"reference-count":20,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1997,9,1]],"date-time":"1997-09-01T00:00:00Z","timestamp":873072000000},"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":["Operations Research Letters"],"published-print":{"date-parts":[[1997,9]]},"DOI":"10.1016\/s0167-6377(97)00010-2","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:14:29Z","timestamp":1027638869000},"page":"69-76","source":"Crossref","is-referenced-by-count":49,"title":["Single machine scheduling with discretely controllable processing times"],"prefix":"10.1016","volume":"21","author":[{"given":"Zhi-Long","family":"Chen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qing","family":"Lu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guochun","family":"Tang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0167-6377(97)00010-2_BIB1","series-title":"Network Flows: Theory, Algorithms, and Applications","author":"Ahuja","year":"1993"},{"key":"10.1016\/S0167-6377(97)00010-2_BIB2","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1016\/0377-2217(93)90245-I","article-title":"Two parallel machine sequencing problems involving controllable job processing times","volume":"70","author":"Alidaee","year":"1993","journal-title":"European J. Oper. Res."},{"key":"10.1016\/S0167-6377(97)00010-2_BIB3","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":"Oper. Res."},{"key":"10.1016\/S0167-6377(97)00010-2_BIB4","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1080\/07408179608966263","article-title":"Parallel machine scheduling with controllable processing times","volume":"28","author":"Cheng","year":"1996","journal-title":"IIE Trans."},{"key":"10.1016\/S0167-6377(97)00010-2_BIB5","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1016\/S0167-6377(96)00035-1","article-title":"Single-machine scheduling with trade-off between number of tardy Jobs and resource allocation","volume":"19","author":"Cheng","year":"1996","journal-title":"Oper. Res. Lett."},{"key":"10.1016\/S0167-6377(97)00010-2_BIB6","unstructured":"T.C.E. Cheng, Z.-L. Chen, C.-L. Li and B.M.T. Lin, Scheduling to minimize the total compression and late costs, in submission."},{"key":"10.1016\/S0167-6377(97)00010-2_BIB7","doi-asserted-by":"crossref","first-page":"504","DOI":"10.1287\/opre.42.3.504","article-title":"Flow shop scheduling with resource flexibility","volume":"42","author":"Daniels","year":"1994","journal-title":"Oper. Res."},{"key":"10.1016\/S0167-6377(97)00010-2_BIB8","series-title":"Computers and Intractability: A Guide to the Theory of NP-Hardness","author":"Garey","year":"1978"},{"key":"10.1016\/S0167-6377(97)00010-2_BIB9","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":"Ann. Discrete Math."},{"key":"10.1016\/S0167-6377(97)00010-2_BIB10","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 common due date","volume":"39","author":"Hall","year":"1991","journal-title":"Oper. Res."},{"key":"10.1016\/S0167-6377(97)00010-2_BIB11","series-title":"Reducibility among Combinatorial Algorithms, Complexity of Computer Computations","author":"Karp","year":"1972"},{"key":"10.1016\/S0167-6377(97)00010-2_BIB12","doi-asserted-by":"crossref","first-page":"334","DOI":"10.1287\/mnsc.15.1.102","article-title":"An n job, one-machine sequencing algorithm for minimizing the number of late jobs","volume":"15","author":"Moore","year":"1968","journal-title":"Management Science"},{"key":"10.1016\/S0167-6377(97)00010-2_BIB13","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":"25","author":"Nowicki","year":"1990","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0167-6377(97)00010-2_BIB14","doi-asserted-by":"crossref","first-page":"298","DOI":"10.1016\/0377-2217(92)90144-X","article-title":"Single-machine sequencing with controllable processing times","volume":"59","author":"Panwalkar","year":"1992","journal-title":"European J. Oper. Res."},{"key":"10.1016\/S0167-6377(97)00010-2_BIB15","doi-asserted-by":"crossref","first-page":"391","DOI":"10.1287\/opre.30.2.391","article-title":"Common due date assignment to minimize total penalty cost for the one-machine scheduling problem","volume":"30","author":"Panwalkar","year":"1982","journal-title":"Oper. Res."},{"key":"10.1016\/S0167-6377(97)00010-2_BIB16","doi-asserted-by":"crossref","first-page":"234","DOI":"10.1287\/opre.42.2.234","article-title":"Scheduling multiple variable-speed machines","volume":"42","author":"Trick","year":"1994","journal-title":"Oper. Res."},{"key":"10.1016\/S0167-6377(97)00010-2_BIB17","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1016\/S0377-2217(82)80008-8","article-title":"A bicriterion approach to time\/cost trade-offs in sequencing","volume":"11","author":"Van Wassenhove","year":"1982","journal-title":"European J. Oper. Res."},{"key":"10.1016\/S0167-6377(97)00010-2_BIB18","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."},{"key":"10.1016\/S0167-6377(97)00010-2_BIB19","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\/S0167-6377(97)00010-2_BIB20","doi-asserted-by":"crossref","first-page":"519","DOI":"10.1016\/0167-6377(91)90071-V","article-title":"Scheduling jobs on a single machine with release dates, delivery times and controllable processing times: worst-case analysis","volume":"10","author":"Zdrzalka","year":"1991","journal-title":"Oper. Res. Lett."}],"container-title":["Operations Research Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167637797000102?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167637797000102?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,18]],"date-time":"2019-04-18T08:54:11Z","timestamp":1555577651000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0167637797000102"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,9]]},"references-count":20,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1997,9]]}},"alternative-id":["S0167637797000102"],"URL":"https:\/\/doi.org\/10.1016\/s0167-6377(97)00010-2","relation":{},"ISSN":["0167-6377"],"issn-type":[{"value":"0167-6377","type":"print"}],"subject":[],"published":{"date-parts":[[1997,9]]}}}