{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,7]],"date-time":"2026-02-07T21:25:36Z","timestamp":1770499536740,"version":"3.49.0"},"reference-count":7,"publisher":"Elsevier BV","issue":"14","license":[{"start":{"date-parts":[[2002,12,1]],"date-time":"2002-12-01T00:00:00Z","timestamp":1038700800000},"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":[[2002,12]]},"DOI":"10.1016\/s0305-0548(01)00067-3","type":"journal-article","created":{"date-parts":[[2002,9,17]],"date-time":"2002-09-17T17:00:52Z","timestamp":1032282052000},"page":"1957-1967","source":"Crossref","is-referenced-by-count":27,"title":["Common due date assignment and scheduling with ready times"],"prefix":"10.1016","volume":"29","author":[{"given":"T.C.E.","family":"Cheng","sequence":"first","affiliation":[]},{"given":"Z.-L.","family":"Chen","sequence":"additional","affiliation":[]},{"given":"N.V.","family":"Shakhlevich","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0305-0548(01)00067-3_BIB1","doi-asserted-by":"crossref","first-page":"391","DOI":"10.1287\/opre.30.2.391","article-title":"Common due date assignments 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(01)00067-3_BIB2","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":"Annals of Discrete Mathematics"},{"key":"10.1016\/S0305-0548(01)00067-3_BIB3","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1016\/S0167-5060(08)70743-X","article-title":"Complexity of machine scheduling problems","volume":"1","author":"Lenstra","year":"1977","journal-title":"Annals of Discrete Mathematics"},{"key":"10.1016\/S0305-0548(01)00067-3_BIB4","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1007\/BF01585872","article-title":"Minimizing average completion time in the presence of release dates","volume":"82","author":"Phillips","year":"1998","journal-title":"Mathematical Programming"},{"key":"10.1016\/S0305-0548(01)00067-3_BIB5","series-title":"Introduction to sequencing and scheduling.","author":"Baker","year":"1974"},{"key":"10.1016\/S0305-0548(01)00067-3_BIB6","doi-asserted-by":"crossref","first-page":"56","DOI":"10.1002\/nav.3800030106","article-title":"Various optimizers for single-stage production","volume":"3","author":"Smith","year":"1956","journal-title":"Naval Research Logistics Quarterly"},{"key":"10.1016\/S0305-0548(01)00067-3_BIB7","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1016\/0167-6377(95)00023-D","article-title":"Minimizing total completion time and maximum cost simultaneously is solvable in polynomial time","volume":"17","author":"Hoogeveen","year":"1995","journal-title":"Operations Research Letters"}],"container-title":["Computers & Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054801000673?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054801000673?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,9]],"date-time":"2019-04-09T16:25:46Z","timestamp":1554827146000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0305054801000673"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,12]]},"references-count":7,"journal-issue":{"issue":"14","published-print":{"date-parts":[[2002,12]]}},"alternative-id":["S0305054801000673"],"URL":"https:\/\/doi.org\/10.1016\/s0305-0548(01)00067-3","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[2002,12]]}}}