{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,17]],"date-time":"2026-01-17T03:33:18Z","timestamp":1768620798062,"version":"3.49.0"},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2024,12,4]],"date-time":"2024-12-04T00:00:00Z","timestamp":1733270400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,12,4]],"date-time":"2024-12-04T00:00:00Z","timestamp":1733270400000},"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":["12271491"],"award-info":[{"award-number":["12271491"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12471305"],"award-info":[{"award-number":["12471305"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12071442"],"award-info":[{"award-number":["12071442"]}],"id":[{"id":"10.13039\/501100001809","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,1]]},"DOI":"10.1007\/s10878-024-01242-7","type":"journal-article","created":{"date-parts":[[2024,12,4]],"date-time":"2024-12-04T19:31:36Z","timestamp":1733340696000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Online scheduling on an unbounded parallel-batch machine to minimize the weighted makespan"],"prefix":"10.1007","volume":"49","author":[{"given":"Han","family":"Zhang","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2561-5613","authenticated-orcid":false,"given":"Lingfa","family":"Lu","sequence":"additional","affiliation":[]},{"given":"Jinjiang","family":"Yuan","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,12,4]]},"reference":[{"issue":"6","key":"1242_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) 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"},{"key":"1242_CR2","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1023\/A:1027316504440","volume":"7","author":"XT Deng","year":"2003","unstructured":"Deng XT, Poon CK, Zhang YZ (2003) Approximation algorithms in batch processing. J Comb Optim 7:247\u2013257","journal-title":"J Comb Optim"},{"key":"1242_CR3","first-page":"121","volume":"11","author":"Q Feng","year":"2007","unstructured":"Feng Q, Yuan JJ (2007) NP-hardness of a multicriteria scheduling on two families of jobs. OR Trans 11:121\u2013126","journal-title":"OR Trans"},{"key":"1242_CR4","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1016\/j.orl.2007.07.001","volume":"36","author":"RY Fu","year":"2008","unstructured":"Fu RY, Tian J, Yuan JJ, He C (2008) On-line scheduling on a batch machine to minimize makespan with limited restarts. Oper Res Lett 36:255\u2013258","journal-title":"Oper Res Lett"},{"issue":"1\u20133","key":"1242_CR5","doi-asserted-by":"publisher","first-page":"196","DOI":"10.1016\/j.tcs.2006.12.040","volume":"374","author":"RY Fu","year":"2007","unstructured":"Fu RY, Tian J, Yuan JJ, Lin YX (2007) Online scheduling in a parallel batch processing system to minimize makespan using restarts. Theor Comput Sci 374(1\u20133):196\u2013202","journal-title":"Theor Comput Sci"},{"key":"1242_CR6","doi-asserted-by":"publisher","first-page":"764","DOI":"10.1287\/opre.40.4.764","volume":"40","author":"CY Lee","year":"1992","unstructured":"Lee CY, Uzsoy R, Martin-Vega LA (1992) Efficient algorithms for scheduling semi-conductor burn-in operations. Oper Res 40:764\u2013775","journal-title":"Oper Res"},{"issue":"3","key":"1242_CR7","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1007\/s40305-017-0179-x","volume":"6","author":"WH Li","year":"2018","unstructured":"Li WH, Chai X (2018) Online scheduling on bounded batch machines to minimize the maximum weighted completion time. J Oper Res Soc Chin 6(3):455\u2013465","journal-title":"J Oper Res Soc Chin"},{"issue":"4","key":"1242_CR8","doi-asserted-by":"publisher","first-page":"1550030","DOI":"10.1142\/S021759591550030X","volume":"32","author":"WJ Li","year":"2015","unstructured":"Li WJ (2015) A best possible online algorithm for the 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":"1","key":"1242_CR9","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/s10951-009-0154-4","volume":"15","author":"PH Liu","year":"2012","unstructured":"Liu PH, Lu XW, Fang Y (2012) A best possible deterministic on-line algorithm for minimizing makespan on parallel batch machines. J Sched 15(1):77\u201381","journal-title":"J Sched"},{"key":"1242_CR10","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1016\/j.ejor.2015.01.003","volume":"244","author":"D Oron","year":"2015","unstructured":"Oron D, Shabtay D, Steiner G (2015) Single machine scheduling with two competing agents and equal job processing times. Euro J Oper Res 244:86\u201399","journal-title":"Euro J Oper Res"},{"issue":"21","key":"1242_CR11","doi-asserted-by":"publisher","first-page":"1211","DOI":"10.1016\/j.ipl.2009.08.008","volume":"109","author":"J Tian","year":"2009","unstructured":"Tian J, Cheng TCE, Ng CT, Yuan JJ (2009) Online scheduling on unbounded parallel-batch machines to minimize the makespan. Inf Process Lett 109(21):1211\u20131215","journal-title":"Inf Process Lett"},{"issue":"6","key":"1242_CR12","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1002\/1099-1425(200011\/12)3:6<333::AID-JOS53>3.0.CO;2-8","volume":"3","author":"M van den Akker","year":"2000","unstructured":"van den Akker M, Hoogeveen H, Vakhania N (2000) Restarts can help in the on-line minimization of the maximum delivery time on a single machine. J Sched 3(6):333\u2013341","journal-title":"J Sched"},{"key":"1242_CR13","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1007\/s10951-010-0172-2","volume":"14","author":"JJ Yuan","year":"2011","unstructured":"Yuan JJ, Fu RY, Ng CT, Cheng TCE (2011) A best possible online algorithm for unbounded parallel-batch scheduling with restarts to minimize makespan. J Sched 14:361\u2013369","journal-title":"J Sched"},{"key":"1242_CR14","doi-asserted-by":"publisher","first-page":"860","DOI":"10.1016\/j.ejor.2019.07.072","volume":"280","author":"JJ Yuan","year":"2020","unstructured":"Yuan JJ, Ng CT, Cheng TCE (2020) Scheduling with release dates and preemption to minimize multiple max-form objective functions. Euro J Oper Res 280:860\u2013875","journal-title":"Euro J Oper Res"},{"key":"1242_CR15","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1002\/nav.5","volume":"48","author":"GC Zhang","year":"2001","unstructured":"Zhang GC, Cai XQ, Wong CK (2001) Online algorithms for minimizing makespan on batch processing machines. Naval Res Logist 48:241\u2013258","journal-title":"Naval Res Logist"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-024-01242-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10878-024-01242-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-024-01242-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,24]],"date-time":"2025-01-24T19:04:03Z","timestamp":1737745443000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10878-024-01242-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,12,4]]},"references-count":15,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2025,1]]}},"alternative-id":["1242"],"URL":"https:\/\/doi.org\/10.1007\/s10878-024-01242-7","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,12,4]]},"assertion":[{"value":"12 November 2024","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 December 2024","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 report no Conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"6"}}