{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,4]],"date-time":"2026-06-04T02:06:15Z","timestamp":1780538775982,"version":"3.54.1"},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2023,10,1]],"date-time":"2023-10-01T00:00:00Z","timestamp":1696118400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,10,1]],"date-time":"2023-10-01T00:00:00Z","timestamp":1696118400000},"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":["12071417"],"award-info":[{"award-number":["12071417"]}],"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":[[2023,10]]},"DOI":"10.1007\/s10878-023-01086-7","type":"journal-article","created":{"date-parts":[[2023,10,15]],"date-time":"2023-10-15T08:01:40Z","timestamp":1697356900000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Semi-online early work maximization problems on two hierarchical uniform machines with partial information of processing time"],"prefix":"10.1007","volume":"46","author":[{"given":"Man","family":"Xiao","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xiaoqiao","family":"Liu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3094-4347","authenticated-orcid":false,"given":"Weidong","family":"Li","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2023,10,15]]},"reference":[{"issue":"6","key":"1086_CR1","doi-asserted-by":"publisher","first-page":"729","DOI":"10.1007\/s10951-015-0464-7","volume":"19","author":"X Chen","year":"2016","unstructured":"Chen X, Sterna M, Han X, Blazewicz J (2016) Scheduling on parallel identical machines with late work criterion: offline and online cases. J Sched 19(6):729\u2013736","journal-title":"J Sched"},{"key":"1086_CR2","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1016\/j.dam.2020.05.023","volume":"290","author":"X Chen","year":"2021","unstructured":"Chen X, Kovalev S, Liu Y, Sterna M, Chalamon I, Blazewicz J (2021) Semi-online scheduling on two identical machines with a common due date to maximize total early work. Discret Appl Math 290:71\u201378","journal-title":"Discret Appl Math"},{"issue":"4","key":"1086_CR3","doi-asserted-by":"publisher","first-page":"458","DOI":"10.1007\/s10878-009-9265-2","volume":"21","author":"G Dosa","year":"2011","unstructured":"Dosa G, Speranza MG, Tuza Z (2011) Two uniform machines with nearly equal speeds: unified approach to known sum and known optimum in semi-online scheduling. J Comb Optim 21(4):458\u2013480","journal-title":"J Comb Optim"},{"issue":"4","key":"1086_CR4","doi-asserted-by":"publisher","first-page":"1107","DOI":"10.1007\/s10100-018-0536-9","volume":"27","author":"G Dosa","year":"2019","unstructured":"Dosa G, Fugenschuh A, Tan Z, Tuza Z, Wesek K (2019) Tight lower bounds for semi-online scheduling on two uniform machines with known optimum. CEJOR 27(4):1107\u20131130","journal-title":"CEJOR"},{"key":"1086_CR5","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2021.105646","volume":"139","author":"D Dwibedy","year":"2022","unstructured":"Dwibedy D, Mohanty R (2022) Semi-online scheduling: a survey. Comput Oper Res 139:105646","journal-title":"Comput Oper Res"},{"key":"1086_CR6","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1002\/jos.60","volume":"4","author":"L Epstein","year":"2001","unstructured":"Epstein L, Noga J, Seiden S, Sgall J, Woeginger G (2001) Randomized on-line scheduling on two uniform machines. J Sched 4:71\u201392","journal-title":"J Sched"},{"issue":"2","key":"1086_CR7","first-page":"107","volume":"9","author":"U Faigle","year":"1989","unstructured":"Faigle U, Kern W, Turan G (1989) On the performance of on-line algorithms for partition problems. Acta Cybern 9(2):107\u2013119","journal-title":"Acta Cybern"},{"issue":"5","key":"1086_CR8","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1016\/S0167-6377(98)00005-4","volume":"21","author":"H Kellerer","year":"1997","unstructured":"Kellerer H, Kotov V, Speranza MG, Tuza Z (1997) Semi on-line algorithms for the partition problem. Oper Res Lett 21(5):235\u2013242","journal-title":"Oper Res Lett"},{"issue":"9","key":"1086_CR9","doi-asserted-by":"publisher","first-page":"1183","DOI":"10.1360\/SSM-2020-0061","volume":"50","author":"L Lin","year":"2020","unstructured":"Lin L, Tan Z (2020) Online scheduling on parallel machines: a survey. Sci Sin Math 50(9):1183\u20131200","journal-title":"Sci Sin Math"},{"key":"1086_CR10","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1016\/j.tcs.2013.04.013","volume":"489\u2013490","author":"X Lu","year":"2013","unstructured":"Lu X, Liu Z (2013) Semi-online scheduling problems on two uniform machines under a grade of service provision. Theor Comput Sci 489\u2013490:58\u201366","journal-title":"Theor Comput Sci"},{"key":"1086_CR11","volume":"2","author":"T Luo","year":"2014","unstructured":"Luo T, Xu Y (2014) Semi-online scheduling on two machines with GoS levels and partial information of processing time. Sci World J 2:576234","journal-title":"Sci World J"},{"key":"1086_CR12","doi-asserted-by":"publisher","first-page":"776","DOI":"10.1016\/j.tcs.2008.11.018","volume":"410","author":"CT Ng","year":"2009","unstructured":"Ng CT, Tan Z, He Y, Cheng TCE (2009) Two semi-online scheduling problems on two uniform machines. Theor Comput Sci 410:776\u2013792","journal-title":"Theor Comput Sci"},{"issue":"6","key":"1086_CR13","doi-asserted-by":"publisher","first-page":"692","DOI":"10.1016\/j.orl.2005.11.004","volume":"34","author":"J Park","year":"2006","unstructured":"Park J, Chang SY, Lee K (2006) Online and semi-online scheduling of two machines under a grade of service provision. Oper Res Lett 34(6):692\u2013696","journal-title":"Oper Res Lett"},{"key":"1086_CR14","doi-asserted-by":"publisher","DOI":"10.1016\/j.omega.2021.102453","volume":"104","author":"M Sterna","year":"2021","unstructured":"Sterna M (2021) Late and early work scheduling: a survey. Omega 104:102453","journal-title":"Omega"},{"key":"1086_CR15","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/s10878-008-9195-4","volume":"20","author":"Z Tan","year":"2010","unstructured":"Tan Z, Zhang A (2010) A note on hierarchical scheduling on two uniform machines. J Comb Optim 20:85\u201395","journal-title":"J Comb Optim"},{"key":"1086_CR16","doi-asserted-by":"crossref","unstructured":"Xiao M, Liu X, Li W (2021) Semi-online early work maximization problem on two hierarchical machines with partial information of processing time. In: Proceeding of the 15th international conference on algorithmic aspects in information and management, pp 146\u2013156","DOI":"10.1007\/978-3-030-93176-6_13"},{"key":"1086_CR17","doi-asserted-by":"crossref","unstructured":"Xiao M, Bai X, Li W (2022a) Online early work maximization problem on two hierarchical machines with buffer or rearrangements. In: Proceeding of the 16th international conference on algorithmic aspects in information and management, pp 46\u201354","DOI":"10.1007\/978-3-031-16081-3_5"},{"key":"1086_CR18","unstructured":"Xiao M, Liu X, Li W, Chen X, Sterna M, Blazewicz J (2022b) Online and semi-online scheduling on two hierarchical machines with a common due date to maximize the total early work. arXiv:2209.08704"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-023-01086-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10878-023-01086-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-01086-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,25]],"date-time":"2023-10-25T08:15:10Z","timestamp":1698221710000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10878-023-01086-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,10]]},"references-count":18,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2023,10]]}},"alternative-id":["1086"],"URL":"https:\/\/doi.org\/10.1007\/s10878-023-01086-7","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,10]]},"assertion":[{"value":"8 September 2023","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 October 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 not disclosed any competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"21"}}