{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,13]],"date-time":"2025-12-13T18:06:07Z","timestamp":1765649167117,"version":"3.48.0"},"reference-count":8,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2025,9,16]],"date-time":"2025-09-16T00:00:00Z","timestamp":1757980800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,9,16]],"date-time":"2025-09-16T00:00:00Z","timestamp":1757980800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["4OR-Q J Oper Res"],"published-print":{"date-parts":[[2025,12]]},"DOI":"10.1007\/s10288-025-00597-9","type":"journal-article","created":{"date-parts":[[2025,9,16]],"date-time":"2025-09-16T10:28:50Z","timestamp":1758018530000},"page":"383-391","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Single machine scheduling to minimize weighted number of early jobs plus total weighted tardiness"],"prefix":"10.1007","volume":"23","author":[{"given":"Matan","family":"Atsmony","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9052-9375","authenticated-orcid":false,"given":"Gur","family":"Mosheiov","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,9,16]]},"reference":[{"key":"597_CR1","doi-asserted-by":"publisher","first-page":"109915","DOI":"10.1016\/j.cie.2024.109915","volume":"188","author":"M Atsmony","year":"2024","unstructured":"Atsmony M, Mosheiov G (2024) Common due-date assignment problems with fixed-plus-linear earliness and tardiness costs. Comput Ind Eng 188:109915","journal-title":"Comput Ind Eng"},{"key":"597_CR2","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1007\/s10878-013-9643-7","volume":"30","author":"I Kacem","year":"2015","unstructured":"Kacem I, Kellerer H, Lanuel Y (2015) Approximation algorithms for maximizing the weighted number of early jobs on a single machine with non-availability intervals. J Comb Optim 30:403\u2013412","journal-title":"J Comb Optim"},{"issue":"1","key":"597_CR3","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1287\/mnsc.16.1.77","volume":"16","author":"EL Lawler","year":"1969","unstructured":"Lawler EL, Moore JM (1969) A functional equation and its application to resource allocation and sequencing problems. Manage Sci 16(1):77\u201384","journal-title":"Manage Sci"},{"issue":"7","key":"597_CR4","doi-asserted-by":"publisher","first-page":"1681","DOI":"10.1007\/s11590-019-01462-5","volume":"14","author":"SS Li","year":"2020","unstructured":"Li SS, Chen RX (2020) Scheduling with common due date assignment to minimize generalized weighted earliness\u2013tardiness penalties. Optimization Letters 14(7):1681\u20131699","journal-title":"Optimization Letters"},{"issue":"5","key":"597_CR5","doi-asserted-by":"publisher","first-page":"1691","DOI":"10.1007\/s11590-013-0650-5","volume":"8","author":"W Li","year":"2014","unstructured":"Li W, Yuan J (2014) Improved online algorithms for the batch scheduling of equal-length jobs with incompatible families to maximize the weighted number of early jobs. Optimization Letters 8(5):1691\u20131706","journal-title":"Optimization Letters"},{"key":"597_CR6","doi-asserted-by":"crossref","unstructured":"Mosheiov G, Sarig A (2024) A note: minmax due-window assignment with fixed earliness-tardiness costs. J Industrial Manage Optim, 0\u20130","DOI":"10.3934\/jimo.2024064"},{"issue":"1","key":"597_CR7","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1016\/j.ejor.2006.05.036","volume":"181","author":"HM Soroush","year":"2007","unstructured":"Soroush HM (2007) Minimizing the weighted number of early and tardy jobs in a stochastic single machine scheduling problem. Eur J Oper Res 181(1):266\u2013287","journal-title":"Eur J Oper Res"},{"key":"597_CR8","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1023\/A:1016094508744","volume":"108","author":"WK Yeung","year":"2001","unstructured":"Yeung WK, O\u011fuz C, Cheng TE (2001) Minimizing weighted number of early and tardy jobs with a common due window involving location penalty. Ann Oper Res 108:33\u201354","journal-title":"Ann Oper Res"}],"container-title":["4OR"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10288-025-00597-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10288-025-00597-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10288-025-00597-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,13]],"date-time":"2025-12-13T18:03:35Z","timestamp":1765649015000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10288-025-00597-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,9,16]]},"references-count":8,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2025,12]]}},"alternative-id":["597"],"URL":"https:\/\/doi.org\/10.1007\/s10288-025-00597-9","relation":{},"ISSN":["1619-4500","1614-2411"],"issn-type":[{"type":"print","value":"1619-4500"},{"type":"electronic","value":"1614-2411"}],"subject":[],"published":{"date-parts":[[2025,9,16]]},"assertion":[{"value":"4 December 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 April 2025","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 August 2025","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 September 2025","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"The authors did not receive support from any organization for the submitted work.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have no relevant financial or non-financial interests to disclose.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have no competing interests to declare that are relevant to the content of this article.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"All authors certify that they have no affiliations with or involvement in any organization or entity with any financial interest or non-financial interest in the subject matter or materials discussed in this manuscript.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}}]}}