{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T19:53:39Z","timestamp":1757620419518,"version":"3.44.0"},"publisher-location":"Singapore","reference-count":22,"publisher":"Springer Nature Singapore","isbn-type":[{"type":"print","value":"9789819502141"},{"type":"electronic","value":"9789819502158"}],"license":[{"start":{"date-parts":[[2025,8,1]],"date-time":"2025-08-01T00:00:00Z","timestamp":1754006400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,8,1]],"date-time":"2025-08-01T00:00:00Z","timestamp":1754006400000},"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":[],"published-print":{"date-parts":[[2026]]},"DOI":"10.1007\/978-981-95-0215-8_26","type":"book-chapter","created":{"date-parts":[[2025,7,31]],"date-time":"2025-07-31T16:25:23Z","timestamp":1753979123000},"page":"346-357","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Online Budget Allocation Maximization Problem on\u00a0Two Uniform Machines with\u00a0a\u00a0Common Due Date"],"prefix":"10.1007","author":[{"given":"Yaru","family":"Yang","sequence":"first","affiliation":[]},{"given":"Honglin","family":"Ding","sequence":"additional","affiliation":[]},{"given":"Wentao","family":"He","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,8,1]]},"reference":[{"key":"26_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.: Scheduling on parallel identical machines with late work criterion: off-line and online cases. J. Sched. 19, 729\u2013736 (2016)","journal-title":"J. Sched."},{"key":"26_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.: Semi-online scheduling on two identical machines with a common due date to maximize total early work. Discret. Appl. Math. 290, 71\u201378 (2021)","journal-title":"Discret. Appl. Math."},{"key":"26_CR3","doi-asserted-by":"publisher","first-page":"927","DOI":"10.1007\/s10957-017-1147-7","volume":"174","author":"M Sterna","year":"2017","unstructured":"Sterna, M., Czerniachowska, K.: Polynomial time approximation scheme for two parallel machines scheduling with a common due date to maximize early work. J. Optim. Theory Appl. 174, 927\u2013944 (2017)","journal-title":"J. Optim. Theory Appl."},{"key":"26_CR4","doi-asserted-by":"publisher","first-page":"106449","DOI":"10.1016\/j.cie.2020.106449","volume":"144","author":"X Chen","year":"2020","unstructured":"Chen, X., Wang, W., Xie, P., Zhang, X., Sterna, M., Blazewicz, J.: Exact and heuristic algorithms for scheduling on two identical machines with early work maximization. Comput. Ind. Eng. 144, 106449 (2020)","journal-title":"Comput. Ind. Eng."},{"key":"26_CR5","doi-asserted-by":"publisher","first-page":"107091","DOI":"10.1016\/j.cie.2020.107091","volume":"153","author":"Y Jiang","year":"2021","unstructured":"Jiang, Y., Guan, L., Zhang, K., Liu, C., Cheng, T., Ji, M.: A note on scheduling on two identical machines with early work maximization. Comput. Ind. Eng. 153, 107091 (2021)","journal-title":"Comput. Ind. Eng."},{"issue":"1","key":"26_CR6","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/j.ejor.2019.12.003","volume":"284","author":"X Chen","year":"2020","unstructured":"Chen, X., Liang, Y., Sterna, M., Wang, W., Blazewicz, J.: Fully polynomial time approximation scheme to maximize early work on parallel machines with common due date. Eur. J. Oper. Res. 284(1), 67\u201374 (2020)","journal-title":"Eur. J. Oper. Res."},{"key":"26_CR7","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1007\/s40305-022-00402-y","volume":"12","author":"W Li","year":"2024","unstructured":"Li, W.: Improved approximation schemes for early work scheduling on identical parallel machines with a common due date. J. Oper. Res. Soc. China 12, 341\u2013350 (2024)","journal-title":"J. Oper. Res. Soc. China"},{"key":"26_CR8","doi-asserted-by":"crossref","unstructured":"Xiao, M., Liu, X., Li, W., Chen, X., Sterna, M., Blazewicz, J.: Online and semi-online scheduling on two hierarchical machines with a common due date to maximize the total early work. Int. J. Appl. Math. Comput. Sci. 34(2), (2024)","DOI":"10.61822\/amcs-2024-0018"},{"key":"26_CR9","doi-asserted-by":"crossref","unstructured":"Xiao, M., Bai, X., Li, W.: Online early work maximization problem on two hierarchical machines with buffer or rearrangements. In: International Conference on Algorithmic Applications in Management, pp. 46\u201354 (2022)","DOI":"10.1007\/978-3-031-16081-3_5"},{"key":"26_CR10","unstructured":"Wei, Q., Wu, Y., Cheng, T. C. E., Sun, F., Jiang, Y.: Online hierarchical parallel-machine scheduling in shared manufacturing to minimize the total completion time. J. Oper. Res. Soc. 1\u201323 (2022)"},{"issue":"3","key":"26_CR11","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1142\/S1793830909000282","volume":"1","author":"J Li","year":"2009","unstructured":"Li, J., Li, W., Li, J.: Polynomial approximation schemes for the max-min allocation problem under a grade of service provision. Discrete Math. Algorithms Appl. 1(3), 355\u2013368 (2009)","journal-title":"Discrete Math. Algorithms Appl."},{"key":"26_CR12","doi-asserted-by":"publisher","first-page":"454","DOI":"10.1002\/nav.22237","volume":"72","author":"W Li","year":"2025","unstructured":"Li, W., Ou, J.: Approximation schemes for parallel machine scheduling to maximize total weighted early work with a common due date. Nav. Res. Logist. 72, 454\u2013464 (2025)","journal-title":"Nav. Res. Logist."},{"key":"26_CR13","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1016\/j.dam.2025.02.015","volume":"367","author":"W Li","year":"2025","unstructured":"Li, W., Yang, Y., Xiao, M., Chen, X., Sterna, M., Blazewicz, J.: Scheduling with a discounted profit criterion on identical machines. Discret. Appl. Math. 367, 195\u2013209 (2025)","journal-title":"Discret. Appl. Math."},{"issue":"2","key":"26_CR14","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.: Randomized on-line scheduling on two uniform machines. J. Sched. 4(2), 71\u201392 (2001)","journal-title":"J. Sched."},{"issue":"8\u201310","key":"26_CR15","doi-asserted-by":"publisher","first-page":"776","DOI":"10.1016\/j.tcs.2008.11.018","volume":"410","author":"CT Ng","year":"2009","unstructured":"Ng, C.T., Tan, Z., He, Y., Cheng, T.E.: Two semi-online scheduling problems on two uniform machines. Theoret. Comput. Sci. 410(8\u201310), 776\u2013792 (2009)","journal-title":"Theoret. Comput. Sci."},{"key":"26_CR16","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, M.G., Tuza, Z.: Two uniform machines with nearly equal speeds: unified approach to known sum and known optimum in semi-online scheduling. J. Comb. Optim. 21, 458\u2013480 (2011)","journal-title":"J. Comb. Optim."},{"key":"26_CR17","doi-asserted-by":"publisher","first-page":"1107","DOI":"10.1007\/s10100-018-0536-9","volume":"27","author":"G D\u00f3sa","year":"2019","unstructured":"D\u00f3sa, G., F\u00fcgenschuh, A., Tan, Z., Tuza, Z., W\u0119sek, K.: Tight lower bounds for semi-online scheduling on two uniform machines with known optimum. CEJOR 27, 1107\u20131130 (2019)","journal-title":"CEJOR"},{"key":"26_CR18","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1016\/j.tcs.2013.04.013","volume":"489","author":"X Lu","year":"2013","unstructured":"Lu, X., Liu, Z.: Semi-online scheduling problems on two uniform machines under a grade of service provision. Theoret. Comput. Sci. 489, 58\u201366 (2013)","journal-title":"Theoret. Comput. Sci."},{"issue":"1","key":"26_CR19","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.: A note on hierarchical scheduling on two uniform machines. J. Comb. Optim. 20(1), 85\u201395 (2010)","journal-title":"J. Comb. Optim."},{"key":"26_CR20","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/s10878-023-01086-7","volume":"46","author":"M Xiao","year":"2023","unstructured":"Xiao, M., Liu, X., Li, W.: Semi-online early work maximization problems on two hierarchical uniform machines with partial information of processing time. J. Comb. Optim. 46, 21 (2023)","journal-title":"J. Comb. Optim."},{"issue":"9","key":"26_CR21","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.: Online scheduling on parallel machines: a survey. Scientia Sinica Mathematica 50(9), 1183\u20131200 (2020)","journal-title":"Scientia Sinica Mathematica"},{"key":"26_CR22","doi-asserted-by":"publisher","first-page":"105646","DOI":"10.1016\/j.cor.2021.105646","volume":"139","author":"D Dwibedy","year":"2022","unstructured":"Dwibedy, D., Mohanty, R.: Semi-online scheduling: a survey. Comput. Oper. Res. 139, 105646 (2022)","journal-title":"Comput. Oper. Res."}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-95-0215-8_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,8]],"date-time":"2025-09-08T09:11:20Z","timestamp":1757322680000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-95-0215-8_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,8,1]]},"ISBN":["9789819502141","9789819502158"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-981-95-0215-8_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2025,8,1]]},"assertion":[{"value":"1 August 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COCOON","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Computing and Combinatorics Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Chengdu","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 August 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 August 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cocoon0","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/tcsuestc.com\/cocoon2025\/index.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}