{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,25]],"date-time":"2026-03-25T06:00:16Z","timestamp":1774418416498,"version":"3.50.1"},"reference-count":15,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2001,2,1]],"date-time":"2001-02-01T00:00:00Z","timestamp":980985600000},"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":[[2001,2]]},"DOI":"10.1016\/s0305-0548(99)00097-0","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T14:22:55Z","timestamp":1027606975000},"page":"157-175","source":"Crossref","is-referenced-by-count":43,"title":["Single-machine scheduling with a common due window"],"prefix":"10.1016","volume":"28","author":[{"given":"W.K.","family":"Yeung","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ceyda","family":"Oguz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"T.C.Edwin","family":"Cheng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0305-0548(99)00097-0_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":"Operations Research"},{"key":"10.1016\/S0305-0548(99)00097-0_BIB2","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1016\/0305-0548(91)90098-C","article-title":"Minimizing weighted number of tardy jobs and weighted earliness\u2013tardiness penalties about a common due date","volume":"18","author":"Lee","year":"1991","journal-title":"Computers and Operations Research"},{"key":"10.1016\/S0305-0548(99)00097-0_BIB3","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1016\/0167-6377(94)90078-7","article-title":"Earliness\u2013tardiness scheduling problems with a common delivery window","volume":"15","author":"Liman","year":"1994","journal-title":"Operations Research Letters"},{"key":"10.1016\/S0305-0548(99)00097-0_BIB4","doi-asserted-by":"crossref","first-page":"769","DOI":"10.1016\/0305-0548(95)00078-X","article-title":"Single machine scheduling to minimize the number of early and tardy jobs","volume":"23","author":"Lann","year":"1996","journal-title":"Computers and Operations Research"},{"key":"10.1016\/S0305-0548(99)00097-0_BIB5","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(99)00097-0_BIB6","unstructured":"Anger FD, Lee CY, Martin-Vega LA. Single machine scheduling with tight windows. Research Report No. 86-16, Industrial and Systems Engineering Department, University of Florida, USA, 1986."},{"key":"10.1016\/S0305-0548(99)00097-0_BIB7","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1016\/0305-0548(88)90001-9","article-title":"Optimal common due-date with limited completion time deviation","volume":"15","author":"Cheng","year":"1988","journal-title":"Computers and Operations Research"},{"key":"10.1016\/S0305-0548(99)00097-0_BIB8","unstructured":"Lee CY. Earliness\u2013tardiness scheduling problems with constant size of due date window. Research Report No. 91\u201317, Industrial and Systems Engineering Department, University of Florida, USA, 1991."},{"key":"10.1016\/S0305-0548(99)00097-0_BIB9","doi-asserted-by":"crossref","first-page":"262","DOI":"10.1111\/j.1937-5956.1993.tb00102.x","article-title":"Common due-window scheduling","volume":"2","author":"Kr\u00e4mer","year":"1993","journal-title":"Production and Operations Management Society"},{"key":"10.1016\/S0305-0548(99)00097-0_BIB10","doi-asserted-by":"crossref","first-page":"194","DOI":"10.1111\/j.1937-5956.1996.tb00393.x","article-title":"A note on common due window scheduling","volume":"5","author":"Weng","year":"1996","journal-title":"Production and Operations Management"},{"key":"10.1016\/S0305-0548(99)00097-0_BIB11","doi-asserted-by":"crossref","first-page":"424","DOI":"10.1057\/jors.1996.41","article-title":"Single machine scheduling with a common delivery window","volume":"47","author":"Ventura","year":"1996","journal-title":"Journal of the Operational Research Society"},{"key":"10.1016\/S0305-0548(99)00097-0_BIB12","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1016\/0377-2217(95)00181-6","article-title":"Determination of common due window location in a single machine scheduling problem","volume":"93","author":"Liman","year":"1996","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0305-0548(99)00097-0_BIB13","unstructured":"Yeung WK, Oguz C, Cheng TCE. Single machine scheduling to minimize weighted number of early and tardy jobs with common due window, 1999, submitted for publication."},{"key":"10.1016\/S0305-0548(99)00097-0_BIB14","doi-asserted-by":"crossref","unstructured":"Karp RM. Reducibility among combinatorial problems. In: Miller RE, Thatcher JW, editors. Complexity of computer computations. New York: Plenum Press, 1972.p. 85\u2013103.","DOI":"10.1007\/978-1-4684-2001-2_9"},{"key":"10.1016\/S0305-0548(99)00097-0_BIB15","doi-asserted-by":"crossref","first-page":"847","DOI":"10.1287\/opre.39.5.847","article-title":"Earliness and tardiness problems II: deviation of completion times about a restrictive common due date","volume":"39","author":"Hall","year":"1991","journal-title":"Operations Research"}],"container-title":["Computers & Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054899000970?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054899000970?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,28]],"date-time":"2019-04-28T10:51:10Z","timestamp":1556448670000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0305054899000970"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,2]]},"references-count":15,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2001,2]]}},"alternative-id":["S0305054899000970"],"URL":"https:\/\/doi.org\/10.1016\/s0305-0548(99)00097-0","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[2001,2]]}}}