{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,2]],"date-time":"2026-04-02T19:34:09Z","timestamp":1775158449477,"version":"3.50.1"},"reference-count":12,"publisher":"Springer Science and Business Media LLC","issue":"1-4","license":[{"start":{"date-parts":[[2001,11,1]],"date-time":"2001-11-01T00:00:00Z","timestamp":1004572800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2001,11,1]],"date-time":"2001-11-01T00:00:00Z","timestamp":1004572800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Annals of Operations Research"],"published-print":{"date-parts":[[2001,11]]},"DOI":"10.1023\/a:1016094508744","type":"journal-article","created":{"date-parts":[[2002,12,29]],"date-time":"2002-12-29T01:59:24Z","timestamp":1041127164000},"page":"33-54","source":"Crossref","is-referenced-by-count":30,"title":["Minimizing Weighted Number of Early and Tardy Jobs with a Common Due Window Involving Location Penalty"],"prefix":"10.1007","volume":"108","author":[{"given":"W.K.","family":"Yeung","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ceyda","family":"O\u011fuz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"T.C. Edwin","family":"Cheng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"5087896_CR1","series-title":"Research Report","volume-title":"Single machine scheduling with tight windows","author":"F.D. Anger","year":"1986","unstructured":"F.D. Anger, C.Y. Lee and L.A. Martin-Vega, Single machine scheduling with tight windows, Research Report No. 86-16, Industrial and Systems Engineering Department, University of Florida, Florida (1986)."},{"key":"5087896_CR2","doi-asserted-by":"crossref","first-page":"22","DOI":"10.1287\/opre.38.1.22","volume":"38","author":"K.S. Baker","year":"1990","unstructured":"K.S. Baker and G.D. Scudder, Sequencing with earliness and tardiness penalties: a review, Operations Research 38 (1990) 22\u201336.","journal-title":"Operations Research"},{"key":"5087896_CR3","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1016\/0305-0548(88)90001-9","volume":"15","author":"T.C.E. Cheng","year":"1988","unstructured":"T.C.E. Cheng, Optimal common due-date with limited completion time deviation, Computers and Operations Research 15 (1988) 91\u201396.","journal-title":"Computers and Operations Research"},{"key":"5087896_CR4","doi-asserted-by":"crossref","first-page":"156","DOI":"10.1016\/0377-2217(89)90100-8","volume":"38","author":"T.C.E. Cheng","year":"1989","unstructured":"T.C.E. Cheng and M.C. Gupta, Survey of scheduling research involving due date determination decisions, European Journal of Operational Research 38 (1989) 156\u2013166.","journal-title":"European Journal of Operational Research"},{"key":"5087896_CR5","doi-asserted-by":"crossref","first-page":"262","DOI":"10.1111\/j.1937-5956.1993.tb00102.x","volume":"2","author":"F.J. Kr\u00e4mer","year":"1993","unstructured":"F.J. Kr\u00e4mer and C.Y. Lee, Common due-window scheduling, Production and Operations Management Society 2 (1993) 262\u2013275.","journal-title":"Production and Operations Management Society"},{"key":"5087896_CR6","doi-asserted-by":"crossref","first-page":"769","DOI":"10.1016\/0305-0548(95)00078-X","volume":"23","author":"A. Lann","year":"1996","unstructured":"A. Lann and G. Mosheiov, Single machine scheduling to minimize the number of early and tardy jobs, Computers and Operations Research 23 (1996) 769\u2013781.","journal-title":"Computers and Operations Research"},{"key":"5087896_CR7","series-title":"Research Report","volume-title":"Earliness-tardiness scheduling problems with constant size of due date window","author":"C.Y. Lee","year":"1991","unstructured":"C.Y. Lee, Earliness-tardiness scheduling problems with constant size of due date window, Research Report No. 91-17, Industrial and Systems Engineering Department, University of Florida, Florida (1991)."},{"key":"5087896_CR8","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1016\/0377-2217(95)00181-6","volume":"93","author":"S.D. Liman","year":"1996","unstructured":"S.D. Liman, S.S. Panwalkar and S. Thongmee, Determination of common due window location in a single machine scheduling problem, European Journal of Operational Research 93 (1996) 68\u201374.","journal-title":"European Journal of Operational Research"},{"key":"5087896_CR9","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1016\/0167-6377(94)90078-7","volume":"15","author":"S.D. Liman","year":"1994","unstructured":"S.D. Liman and S. Ramaswamy, Earliness-tardiness scheduling problems with a common delivery window, Operations Research Letters 15 (1994) 195\u2013203.","journal-title":"Operations Research Letters"},{"key":"5087896_CR10","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1016\/0305-0483(84)90011-2","volume":"12","author":"T. Sen","year":"1984","unstructured":"T. Sen and S.K. Gupta, A state-of-art survey of static scheduling research involving due dates, OMEGA 12 (1984) 63\u201376.","journal-title":"OMEGA"},{"key":"5087896_CR11","doi-asserted-by":"crossref","first-page":"424","DOI":"10.1057\/jors.1996.41","volume":"47","author":"J.A. Ventura","year":"1996","unstructured":"J.A. Ventura and M.X. Weng, Single machine scheduling with a common delivery window, Journal of the Operational Society 47 (1996) 424\u2013434.","journal-title":"Journal of the Operational Society"},{"key":"5087896_CR12","doi-asserted-by":"crossref","first-page":"194","DOI":"10.1111\/j.1937-5956.1996.tb00393.x","volume":"5","author":"M.X. Weng","year":"1996","unstructured":"M.X.Weng and J.A. Ventura, A note on common due window scheduling, Production and Operations Management 5 (1996) 194\u2013200.","journal-title":"Production and Operations Management"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1016094508744.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1016094508744\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1016094508744.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,18]],"date-time":"2025-05-18T14:06:10Z","timestamp":1747577170000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1016094508744"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,11]]},"references-count":12,"journal-issue":{"issue":"1-4","published-print":{"date-parts":[[2001,11]]}},"alternative-id":["5087896"],"URL":"https:\/\/doi.org\/10.1023\/a:1016094508744","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2001,11]]}}}