{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,16]],"date-time":"2026-01-16T07:13:19Z","timestamp":1768547599741,"version":"3.49.0"},"reference-count":10,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2023,6,22]],"date-time":"2023-06-22T00:00:00Z","timestamp":1687392000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,6,22]],"date-time":"2023-06-22T00:00:00Z","timestamp":1687392000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100003977","name":"Israel Science Foundation","doi-asserted-by":"publisher","award":["2505\/19"],"award-info":[{"award-number":["2505\/19"]}],"id":[{"id":"10.13039\/501100003977","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2023,7]]},"DOI":"10.1007\/s10878-023-01040-7","type":"journal-article","created":{"date-parts":[[2023,6,22]],"date-time":"2023-06-22T09:10:33Z","timestamp":1687425033000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["A note on lot scheduling on a single machine to minimize maximum weighted tardiness"],"prefix":"10.1007","volume":"45","author":[{"given":"Gur","family":"Mosheiov","sequence":"first","affiliation":[]},{"given":"Assaf","family":"Sarig","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,6,22]]},"reference":[{"key":"1040_CR1","first-page":"1","volume":"1","author":"Y Chen","year":"2020","unstructured":"Chen Y, Cheng Y, Zhang G (2020) Single machine lot scheduling with non-uniform lot capacities and processing times. J Combinat Opt 1:1\u20139","journal-title":"J Combinat Opt"},{"key":"1040_CR2","doi-asserted-by":"publisher","first-page":"718","DOI":"10.1016\/j.ipl.2014.06.016","volume":"114","author":"Y-T Hou","year":"2014","unstructured":"Hou Y-T, Yang D-L, Kuo W-H (2014) Lot scheduling on a single machine. Inf Process Lett 114:718\u2013722","journal-title":"Inf Process Lett"},{"issue":"5","key":"1040_CR3","doi-asserted-by":"publisher","first-page":"544","DOI":"10.1287\/mnsc.19.5.544","volume":"19","author":"EL Lawler","year":"1973","unstructured":"Lawler EL (1973) Optimal sequencing of a single machine subject to precedence constraints. Manage Sci 19(5):544\u2013546","journal-title":"Manage Sci"},{"key":"1040_CR4","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1080\/0305215X.2020.1722119","volume":"53","author":"B Mor","year":"2021","unstructured":"Mor B (2021) Single-machine lot scheduling with variable lot processing times. Eng Optim 53:321\u2013334","journal-title":"Eng Optim"},{"key":"1040_CR5","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s10878-021-00732-2","volume":"42","author":"B Mor","year":"2021","unstructured":"Mor B, Mosheiov G (2021) A note on the single machine CON and CONW problems with lot scheduling. J Combinat Opt 42:1\u201312","journal-title":"J Combinat Opt"},{"key":"1040_CR6","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2020.106009","volume":"164","author":"B Mor","year":"2020","unstructured":"Mor B, Mosheiov G, Shapira D (2020) Lot scheduling on a single machine to minimize the (weighted) number of tardy orders. Inf Process Lett 164:106009","journal-title":"Inf Process Lett"},{"issue":"1","key":"1040_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10878-020-00651-8","volume":"41","author":"B Mor","year":"2021","unstructured":"Mor B, Mosheiov G, Shapira D (2021) Single machine lot scheduling with optional job-rejection. J Comb Optim 41(1):1\u201311","journal-title":"J Comb Optim"},{"key":"1040_CR8","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1016\/j.cor.2016.10.004","volume":"79","author":"DL Yang","year":"2017","unstructured":"Yang DL, Hou YT, Kuo WH (2017) A note on a single-machine lot scheduling problem with indivisible orders. Comput Oper Res 79:34\u201338","journal-title":"Comput Oper Res"},{"key":"1040_CR9","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1016\/j.ipl.2018.10.002","volume":"142","author":"E Zhang","year":"2019","unstructured":"Zhang E, Liu M, Zheng F, Xu Y (2019) Single machine lot scheduling to minimize the total weighted (discounted) completion time. Inf Process Lett 142:46\u201351","journal-title":"Inf Process Lett"},{"issue":"13","key":"1040_CR10","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1016\/j.ifacol.2019.11.115","volume":"52","author":"F Zheng","year":"2019","unstructured":"Zheng F, Jin K (2019) An improved heuristic for single machine lot scheduling problem. IFAC-PapersOnLine 52(13):217\u2013222","journal-title":"IFAC-PapersOnLine"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-023-01040-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10878-023-01040-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-023-01040-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,22]],"date-time":"2023-07-22T04:10:45Z","timestamp":1689999045000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10878-023-01040-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,6,22]]},"references-count":10,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2023,7]]}},"alternative-id":["1040"],"URL":"https:\/\/doi.org\/10.1007\/s10878-023-01040-7","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,6,22]]},"assertion":[{"value":"3 May 2023","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 June 2023","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have no relevant financial or non-financial interests to disclose.The authors have no conflicts of interest to declare that are relevant to the content of this article. 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. The authors have no financial or proprietary interests in any material discussed in this article.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"128"}}