{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,20]],"date-time":"2026-05-20T22:30:22Z","timestamp":1779316222848,"version":"3.51.4"},"reference-count":19,"publisher":"Elsevier BV","issue":"8","license":[{"start":{"date-parts":[[2003,7,1]],"date-time":"2003-07-01T00:00:00Z","timestamp":1057017600000},"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":["Computers & Operations Research"],"published-print":{"date-parts":[[2003,7]]},"DOI":"10.1016\/s0305-0548(02)00066-7","type":"journal-article","created":{"date-parts":[[2003,2,17]],"date-time":"2003-02-17T18:07:53Z","timestamp":1045505273000},"page":"1173-1185","source":"Crossref","is-referenced-by-count":62,"title":["Single machine scheduling with a variable common due date and resource-dependent processing times"],"prefix":"10.1016","volume":"30","author":[{"given":"C.T.Daniel","family":"Ng","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"T.C.Edwin","family":"Cheng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mikhail Y.","family":"Kovalyov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S.S.","family":"Lam","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0305-0548(02)00066-7_BIB1","doi-asserted-by":"crossref","first-page":"391","DOI":"10.1287\/opre.30.2.391","article-title":"Common due date assignment to minimize total penalty for the one machine scheduling problem","volume":"30","author":"Panwalkar","year":"1982","journal-title":"Operations Research"},{"key":"10.1016\/S0305-0548(02)00066-7_BIB2","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1080\/03052159008941168","article-title":"Common due-date assignment and scheduling for a single processor to minimize the number of tardy jobs","volume":"16","author":"Cheng","year":"1990","journal-title":"Engineering Optimization"},{"key":"10.1016\/S0305-0548(02)00066-7_BIB3","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1016\/0007-6813(78)90032-0","article-title":"Reflecting corporate strategy in manufacturing decisions","volume":"21","author":"Wheelwright","year":"1978","journal-title":"Business Horizons"},{"key":"10.1016\/S0305-0548(02)00066-7_BIB4","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1016\/0360-8352(83)90029-3","article-title":"Due date selection procedures for job-shop simulation","volume":"7","author":"Smith","year":"1983","journal-title":"Computers and Industrial Engineering"},{"key":"10.1016\/S0305-0548(02)00066-7_BIB5","doi-asserted-by":"crossref","first-page":"685","DOI":"10.1080\/00207548408942488","article-title":"A framework for the study of due-date management in job shops","volume":"22","author":"Ragatz","year":"1984","journal-title":"International Journal of Production Research"},{"key":"10.1016\/S0305-0548(02)00066-7_BIB6","doi-asserted-by":"crossref","first-page":"156","DOI":"10.1016\/0377-2217(89)90100-8","article-title":"Survey of scheduling research involving due-date determination decisions","volume":"38","author":"Cheng","year":"1989","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0305-0548(02)00066-7_BIB7","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":"Operations Research"},{"key":"10.1016\/S0305-0548(02)00066-7_BIB8","series-title":"Analysis and design of hierarchical control systems with special reference to steel plant operations","author":"Williams","year":"1985"},{"key":"10.1016\/S0305-0548(02)00066-7_BIB9","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":"Operations Research"},{"key":"10.1016\/S0305-0548(02)00066-7_BIB10","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 Transactions"},{"key":"10.1016\/S0305-0548(02)00066-7_BIB11","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1016\/S0377-2217(82)80008-8","article-title":"A bicriterion approach to time\/cost tradeoffs in sequencing","volume":"11","author":"Van Wassenhove","year":"1982","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0305-0548(02)00066-7_BIB12","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 Applied Mathematics"},{"key":"10.1016\/S0305-0548(02)00066-7_BIB13","doi-asserted-by":"crossref","first-page":"745","DOI":"10.1016\/0005-1098(86)90014-2","article-title":"Time-optimal control in a single machine problem with resource constraints","volume":"22","author":"Janiak","year":"1986","journal-title":"Automatica"},{"key":"10.1016\/S0305-0548(02)00066-7_BIB14","series-title":"Scheduling computer and manufacturing processes","author":"Blazewicz","year":"1996"},{"key":"10.1016\/S0305-0548(02)00066-7_BIB15","unstructured":"Janiak A, Portmann M-C. Minimization of the maximum lateness in single machine scheduling with release dates and additional resources. Proceedings of the International Conference on Industrial Engineering and Production Management, Lyon, France, October 20\u201324, 1997, Book I. pp. 283\u201392."},{"key":"10.1016\/S0305-0548(02)00066-7_BIB16","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1016\/S0167-6377(97)00010-2","article-title":"Single machine scheduling with discretely controllable processing times","volume":"21","author":"Chen","year":"1997","journal-title":"Operations Research Letters"},{"key":"10.1016\/S0305-0548(02)00066-7_BIB17","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1016\/0925-5273(95)00194-8","article-title":"Due-date assignment and single machine scheduling with compressible processing times","volume":"43","author":"Cheng","year":"1996","journal-title":"International Journal of Production Economics"},{"key":"10.1016\/S0305-0548(02)00066-7_BIB18","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1016\/S0925-5273(00)00040-2","article-title":"Common due date assignment for scheduling on a single machine with jointly reducible processing times","volume":"69","author":"Biskup","year":"2001","journal-title":"International Journal of Production Economics"},{"key":"10.1016\/S0305-0548(02)00066-7_BIB19","series-title":"Topics in algebra","author":"Herstein","year":"1975"}],"container-title":["Computers & Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054802000667?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054802000667?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,9]],"date-time":"2019-04-09T03:21:11Z","timestamp":1554780071000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0305054802000667"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,7]]},"references-count":19,"journal-issue":{"issue":"8","published-print":{"date-parts":[[2003,7]]}},"alternative-id":["S0305054802000667"],"URL":"https:\/\/doi.org\/10.1016\/s0305-0548(02)00066-7","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[2003,7]]}}}