{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T21:58:58Z","timestamp":1777499938572,"version":"3.51.4"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783031207952","type":"print"},{"value":"9783031207969","type":"electronic"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"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":[[2022]]},"DOI":"10.1007\/978-3-031-20796-9_8","type":"book-chapter","created":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T05:12:32Z","timestamp":1672549952000},"page":"99-109","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Online Early Work Maximization on\u00a0Three Hierarchical Machines with\u00a0a\u00a0Common Due Date"],"prefix":"10.1007","author":[{"given":"Man","family":"Xiao","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Weidong","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,1,1]]},"reference":[{"key":"8_CR1","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/s10951-007-0023-y","volume":"10","author":"E Angelelli","year":"2007","unstructured":"Angelelli, E., Speranza, M., Tuza, Z.: Semi on-line scheduling on three processors with known sum of the tasks. J. Sched. 10, 263\u2013269 (2007). https:\/\/doi.org\/10.1007\/s10951-007-0023-y","journal-title":"J. Sched."},{"key":"8_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.tcs.2012.03.031","volume":"443","author":"S Albers","year":"2012","unstructured":"Albers, S., Hellwig, M.: Semi-online scheduling revisited. Theor. Comput. Sci. 443, 1\u20139 (2012)","journal-title":"Theor. Comput. Sci."},{"key":"8_CR3","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/S0304-3975(00)00258-9","volume":"168","author":"Y Azar","year":"2001","unstructured":"Azar, Y., Regev, O.: On-line bin-stretching. Theor. Comput. Sci. 168, 17\u201341 (2001)","journal-title":"Theor. Comput. Sci."},{"issue":"6","key":"8_CR4","doi-asserted-by":"publisher","first-page":"601","DOI":"10.1007\/s10951-016-0504-y","volume":"20","author":"M B\u00f6hm","year":"2017","unstructured":"B\u00f6hm, M., Sgall, J., van Stee, R., Vesel\u00fd, P.: Online bin stretching with three bins. J. Sched. 20(6), 601\u2013621 (2017). https:\/\/doi.org\/10.1007\/s10951-016-0504-y","journal-title":"J. Sched."},{"key":"8_CR5","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: offline and online cases. J. Sched. 19, 729\u2013736 (2016). https:\/\/doi.org\/10.1007\/s10951-015-0464-7","journal-title":"J. Sched."},{"key":"8_CR6","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. Discrete Appl. Math. 290, 71\u201378 (2021)","journal-title":"Discrete Appl. Math."},{"issue":"2","key":"8_CR7","first-page":"107","volume":"9","author":"U Faigle","year":"1989","unstructured":"Faigle, U., Kern, W., Turan, G.: On the performance of on-line algorithms for partition problems. Acta Cybernet. 9(2), 107\u2013119 (1989)","journal-title":"Acta Cybernet."},{"key":"8_CR8","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1002\/1099-1425(200011\/12)3:6<343::AID-JOS54>3.0.CO;2-2","volume":"3","author":"R Fleischer","year":"2000","unstructured":"Fleischer, R., Wahl, M.: On-line scheduling revisited. J. Sched. 3, 343\u2013353 (2000)","journal-title":"J. Sched."},{"key":"8_CR9","unstructured":"Gormley, T., Reingold, N., Torng, E., Westbrook, J.: Generating adversaries for request-answer games. In: Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 564\u2013565. SIAM, Philadelphia (2000)"},{"key":"8_CR10","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1007\/s006070050020","volume":"62","author":"Y He","year":"1999","unstructured":"He, Y., Zhang, G.: Semi on-line scheduling on two identical machines. Computing 62, 179\u2013187 (1999). https:\/\/doi.org\/10.1007\/s006070050020","journal-title":"Computing"},{"key":"8_CR11","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1631\/jzus.2006.A0309","volume":"7","author":"Y Jiang","year":"2006","unstructured":"Jiang, Y., He, Y., Tang, C.: Optimal online algorithms for scheduling on two identical machines under a grade of service. J. Zhejiang Univ., Sci., A 7, 309\u2013314 (2006). https:\/\/doi.org\/10.1631\/jzus.2006.A0309","journal-title":"J. Zhejiang Univ., Sci., A"},{"issue":"6","key":"8_CR12","doi-asserted-by":"publisher","first-page":"623","DOI":"10.1007\/s10951-015-0430-4","volume":"18","author":"H Kellerer","year":"2015","unstructured":"Kellerer, H., Kotov, V., Gabay, M.: An efficient algorithm for semi-online multiprocessor scheduling with given total processing time. J. Sched. 18(6), 623\u2013630 (2015). https:\/\/doi.org\/10.1007\/s10951-015-0430-4","journal-title":"J. Sched."},{"issue":"5","key":"8_CR13","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, M., Tuza, Z.: Semi on-line algorithms for the partition problem. Oper. Res. Lett. 21(5), 235\u2013242 (1997)","journal-title":"Oper. Res. Lett."},{"key":"8_CR14","doi-asserted-by":"publisher","first-page":"461","DOI":"10.1007\/s10951-013-0329-x","volume":"16","author":"K Lee","year":"2013","unstructured":"Lee, K., Lim, K.: Semi-online scheduling problems on a small number of machines. J. Sched. 16, 461\u2013477 (2013). https:\/\/doi.org\/10.1007\/s10951-013-0329-x","journal-title":"J. Sched."},{"issue":"6","key":"8_CR15","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, S., Lee, K.: Online and semi-online scheduling of two machines under a grade of service provision. Oper. Res. Lett. 34(6), 692\u2013696 (2006)","journal-title":"Oper. Res. Lett."},{"issue":"15\u201316","key":"8_CR16","doi-asserted-by":"publisher","first-page":"102453","DOI":"10.1016\/j.omega.2021.102453","volume":"104","author":"M Sterna","year":"2021","unstructured":"Sterna, M.: Late and early work scheduling: a survey. Omega 104(15\u201316), 102453 (2021)","journal-title":"Omega"},{"key":"8_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1007\/978-3-642-14355-7_27","volume-title":"Algorithmic Aspects in Information and Management","author":"Y Wu","year":"2010","unstructured":"Wu, Y., Yang, Q.: Optimal semi-online scheduling algorithms on two parallel identical machines under a grade of service provision. In: Chen, B. (ed.) AAIM 2010. LNCS, vol. 6124, pp. 261\u2013270. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-14355-7_27"},{"key":"8_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1007\/978-3-030-93176-6_13","volume-title":"Algorithmic Aspects in Information and Management","author":"M Xiao","year":"2021","unstructured":"Xiao, M., Liu, X., Li, W.: Semi-online early work maximization problem on\u00a0two hierarchical machines with\u00a0partial information of\u00a0processing time. In: Wu, W., Du, H. (eds.) AAIM 2021. LNCS, vol. 13153, pp. 146\u2013156. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-93176-6_13"},{"key":"8_CR19","doi-asserted-by":"publisher","first-page":"3597","DOI":"10.1016\/j.tcs.2009.04.007","volume":"410","author":"A Zhang","year":"2009","unstructured":"Zhang, A., Jiang, Y., Tan, Z.: Online parallel machines scheduling with two hierarchies. Theor. Comput. Sci. 410, 3597\u20133605 (2009)","journal-title":"Theor. Comput. Sci."},{"key":"8_CR20","series-title":"Communications in Computer and Information Science","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1007\/978-981-16-1877-2_4","volume-title":"Theoretical Computer Science","author":"M Xiao","year":"2021","unstructured":"Xiao, M., Ding, L., Zhao, S., Li, W.: Semi-online algorithms for hierarchical scheduling on three parallel machines with a buffer size of 1. In: He, K., Zhong, C., Cai, Z., Yin, Y. (eds.) NCTCS 2020. CCIS, vol. 1352, pp. 47\u201356. Springer, Singapore (2021). https:\/\/doi.org\/10.1007\/978-981-16-1877-2_4"}],"container-title":["Lecture Notes in Computer Science","Frontiers of Algorithmic Wisdom"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-20796-9_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T05:47:52Z","timestamp":1672552072000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-20796-9_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031207952","9783031207969"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-20796-9_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"1 January 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"IJTCS-FAW","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Frontiers in Algorithmics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Hong Kong","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":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 August 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 August 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"faw2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/conference.cs.cityu.edu.hk\/ijtcs2022\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EquinOCS","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"25","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"19","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"76% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}