{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,10]],"date-time":"2026-06-10T11:59:00Z","timestamp":1781092740952,"version":"3.54.1"},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2025,7,3]],"date-time":"2025-07-03T00:00:00Z","timestamp":1751500800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,7,3]],"date-time":"2025-07-03T00:00:00Z","timestamp":1751500800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["72271051"],"award-info":[{"award-number":["72271051"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"Natural Science Foundation of China","doi-asserted-by":"crossref","award":["72071144"],"award-info":[{"award-number":["72071144"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001809","name":"Natural Science Foundation of China","doi-asserted-by":"crossref","award":["71832001"],"award-info":[{"award-number":["71832001"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001809","name":"Natural Science Foundation of China","doi-asserted-by":"crossref","award":["72021002"],"award-info":[{"award-number":["72021002"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100012226","name":"Fundamental Research Funds for the Central Universities","doi-asserted-by":"publisher","award":["2232018H-07"],"award-info":[{"award-number":["2232018H-07"]}],"id":[{"id":"10.13039\/501100012226","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":[[2025,8]]},"DOI":"10.1007\/s10878-025-01327-x","type":"journal-article","created":{"date-parts":[[2025,7,3]],"date-time":"2025-07-03T04:39:18Z","timestamp":1751517558000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Single machine lot scheduling to minimize maximum weighted completion time"],"prefix":"10.1007","volume":"50","author":[{"given":"Feifeng","family":"Zheng","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Na","family":"Li","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3190-5008","authenticated-orcid":false,"given":"Ming","family":"Liu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yinfeng","family":"Xu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2025,7,3]]},"reference":[{"issue":"6","key":"1327_CR1","doi-asserted-by":"publisher","first-page":"1850048","DOI":"10.1142\/S0217595918500483","volume":"35","author":"X Chai","year":"2018","unstructured":"Chai X, Lu LF, Li WH, Zhang LQ (2018) On best-possible online algorithms for single machine scheduling to minimize the maximum weighted completion time. Asia-Pacific J. Oper. Res. 35(6):1850048","journal-title":"Asia-Pacific J. Oper. Res."},{"issue":"5","key":"1327_CR2","doi-asserted-by":"publisher","first-page":"1359","DOI":"10.1007\/s10878-020-00654-5","volume":"43","author":"Y Chen","year":"2022","unstructured":"Chen Y, Cheng YX, Zhang GQ (2022) On single machine lot scheduling with non-uniform lot capacities and processing times. J. Comb. Optim. 43(5):1359\u20131367","journal-title":"J. Comb. Optim."},{"key":"1327_CR3","doi-asserted-by":"crossref","unstructured":"Elidrissi A, Benmansour R, Zufferey N, Benbrahim M, Duvivier D (2023) Minimization of maximum lateness on parallel machines with a single server and job release dates. 4OR. 22:351-385","DOI":"10.1007\/s10288-023-00547-3"},{"issue":"4","key":"1327_CR4","first-page":"121","volume":"11","author":"Q Feng","year":"2007","unstructured":"Feng Q, Yuan JJ (2007) On the NP-hardness of multicriteria scheduling on two families of jobs. OR Trans. 11(4):121\u2013126","journal-title":"OR Trans."},{"key":"1327_CR5","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1016\/S0167-5060(08)70356-X","volume":"5","author":"RL Graham","year":"1979","unstructured":"Graham RL, Lawler EL, Lenstra JK, Kan AR (1979) On optimization and approximation in deterministic sequencing and scheduling: a survey. Ann. Discrete Math. 5:287\u2013326","journal-title":"Ann. Discrete Math."},{"issue":"1","key":"1327_CR6","doi-asserted-by":"publisher","first-page":"2350005","DOI":"10.1142\/S0217595923500057","volume":"41","author":"SN Guo","year":"2023","unstructured":"Guo SN, Chen YN, Mao YP, Zhang XY (2023) On online single-processor scheduling with an unexpected breakdown. Asia-Pacific J. Oper. Res. 41(1):2350005","journal-title":"Asia-Pacific J. Oper. Res."},{"issue":"12","key":"1327_CR7","doi-asserted-by":"publisher","first-page":"718","DOI":"10.1016\/j.ipl.2014.06.016","volume":"114","author":"YT Hou","year":"2014","unstructured":"Hou YT, Yang DL, Kuo WH (2014) On lot scheduling on a single machine. Inf. Process. Lett. 114(12):718\u2013722","journal-title":"Inf. Process. Lett."},{"key":"1327_CR8","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/BF01762111","volume":"3","author":"AR Karlin","year":"1988","unstructured":"Karlin AR, Manasse MS, Rudolph L, Sleator DD (1988) On competitive snoopy caching. Algorithmica. 3:79\u2013119","journal-title":"Algorithmica."},{"issue":"5","key":"1327_CR9","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":"1327_CR10","doi-asserted-by":"publisher","first-page":"478","DOI":"10.1016\/j.ins.2021.12.122","volume":"589","author":"M Li","year":"2022","unstructured":"Li M, Wang GG (2022) On a review of the green shop scheduling problem. Inform. Sciences. 589:478\u2013496","journal-title":"Inform. Sciences."},{"issue":"4","key":"1327_CR11","doi-asserted-by":"publisher","first-page":"1550030","DOI":"10.1142\/S021759591550030X","volume":"32","author":"WJ Li","year":"2015","unstructured":"Li WJ (2015) On a best possible online algorithm for parallel-machine scheduling to minimize the maximum weighted completion time. Asia-Pacific J. Oper. Res. 32(4):1550030","journal-title":"Asia-Pacific J. Oper. Res."},{"issue":"3","key":"1327_CR12","doi-asserted-by":"publisher","first-page":"591","DOI":"10.1007\/s11590-022-01889-3","volume":"17","author":"WJ Li","year":"2023","unstructured":"Li WJ, Liu HL (2023) On online NDP-constraint scheduling of jobs with delivery times or weights. Optim. Lett. 17(3):591\u2013612","journal-title":"Optim. Lett."},{"issue":"5","key":"1327_CR13","doi-asserted-by":"publisher","first-page":"2350040","DOI":"10.1142\/S0217595923500409","volume":"41","author":"M Liu","year":"2023","unstructured":"Liu M, Liu ZZ, Zheng FF (2023) On mathematical models and optimal algorithms for lot scheduling considering job splitting and due dates in green logistics. Asia-Pacific J. Oper. Res. 41(5):2350040","journal-title":"Asia-Pacific J. Oper. Res."},{"key":"1327_CR14","first-page":"96","volume":"2021","author":"LF Lu","year":"2021","unstructured":"Lu LF, Zhang LQ, Ou JW (2021) On single machine scheduling with rejection to minimize the weighted makespan. AAIM 2021:96\u2013110","journal-title":"AAIM"},{"key":"1327_CR15","doi-asserted-by":"crossref","unstructured":"Min Y, Choi BC, Park MJ, Kim KM (2023) A parallel-machine scheduling problem with an antithetical property to maximize total weighted early work. 4OR. 21(3):421-437","DOI":"10.1007\/s10288-022-00517-1"},{"issue":"2","key":"1327_CR16","first-page":"321","volume":"53","author":"B Mor","year":"2021","unstructured":"Mor B (2021) On single-machine lot scheduling with variable lot processing times. Optim. Lett. 53(2):321\u2013334","journal-title":"Optim. Lett."},{"key":"1327_CR17","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) On 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":"1327_CR18","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) On single machine lot scheduling with optional job-rejection. J. Comb. Optim. 41(1):1\u201311","journal-title":"J. Comb. Optim."},{"issue":"2","key":"1327_CR19","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1007\/s10878-021-00709-1","volume":"42","author":"B Mor","year":"2021","unstructured":"Mor B, Mosheiov G (2021) On the single machine CON and CONW problems with lot scheduling. J. Comb. Optim. 42(2):327\u2013338","journal-title":"J. Comb. Optim."},{"issue":"5","key":"1327_CR20","doi-asserted-by":"publisher","first-page":"128","DOI":"10.1007\/s10878-023-01040-7","volume":"45","author":"G Mosheiov","year":"2023","unstructured":"Mosheiov G, Sarig A (2023) On lot scheduling on a single machine to minimize maximum weighted tardiness. J. Comb. Optim. 45(5):128","journal-title":"J. Comb. Optim."},{"issue":"1","key":"1327_CR21","first-page":"12","volume":"23","author":"B Nurit","year":"2023","unstructured":"Nurit B, Mor B, Schlissel Y, Shapira D (2023) On lot scheduling involving completion time problems on identical parallel machines. Oper Res-ger. 23(1):12","journal-title":"Oper Res-ger."},{"key":"1327_CR22","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1007\/978-981-19-8152-4_17","volume-title":"National Conference of Theoretical Computer Science","author":"R Sun","year":"2022","unstructured":"Sun R (2022) On the parameterized tractability of single machine scheduling with rejection to minimize the weighted makespan. National Conference of Theoretical Computer Science. Singapore, Springer Nature Singapore, pp 236\u2013247"},{"key":"1327_CR23","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) On a single-machine lot scheduling problem with indivisible orders. Com. Oper. Res. 79:34\u201338","journal-title":"Com. Oper. Res."},{"key":"1327_CR24","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 FF, Xu YF (2019) On 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":"1327_CR25","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1016\/j.ifacol.2019.11.115","volume":"52","author":"FF Zheng","year":"2019","unstructured":"Zheng FF, Jin KY (2019) On an improved heuristic for the 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-025-01327-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10878-025-01327-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-025-01327-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,7]],"date-time":"2025-09-07T00:53:50Z","timestamp":1757206430000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10878-025-01327-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,7,3]]},"references-count":25,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2025,8]]}},"alternative-id":["1327"],"URL":"https:\/\/doi.org\/10.1007\/s10878-025-01327-x","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,7,3]]},"assertion":[{"value":"7 June 2025","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 July 2025","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"No potential conflict of interest was reported by the authors.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflicts of Interest"}}],"article-number":"1"}}