{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T18:30:11Z","timestamp":1743013811303,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":25,"publisher":"Springer Nature Singapore","isbn-type":[{"type":"print","value":"9789811981517"},{"type":"electronic","value":"9789811981524"}],"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-981-19-8152-4_15","type":"book-chapter","created":{"date-parts":[[2022,12,9]],"date-time":"2022-12-09T16:04:02Z","timestamp":1670601842000},"page":"209-215","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Modified List Scheduling Algorithm for\u00a0the\u00a0Online Hierarchical Load Balancing Problem with\u00a0Bounded Processing Times"],"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":[[2022,12,10]]},"reference":[{"key":"15_CR1","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1016\/j.tcs.2012.07.005","volume":"457","author":"Q Cao","year":"2012","unstructured":"Cao, Q., Cheng, T.C.E., Wan, G., Li, Y.: Several semi-online scheduling problems on two identical machines with combined information. Theor. Comput. Sci. 457, 35\u201344 (2012)","journal-title":"Theor. Comput. Sci."},{"key":"15_CR2","doi-asserted-by":"publisher","first-page":"3731","DOI":"10.1016\/j.tcs.2011.03.032","volume":"412","author":"Q Cao","year":"2011","unstructured":"Cao, Q., Liu, Z., Cheng, T.C.E.: Semi-online scheduling with known partial information about job sizes on two identical machines. Theor. Comput. Sci. 412, 3731\u20133737 (2011)","journal-title":"Theor. Comput. Sci."},{"issue":"4","key":"15_CR3","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1007\/s10878-007-9078-0","volume":"15","author":"O Chassid","year":"2008","unstructured":"Chassid, O., Epstein, L.: The hierarchical model for load balancing on two machines. J. Comb. Optim. 15(4), 305\u2013314 (2008)","journal-title":"J. Comb. Optim."},{"issue":"5\u20136","key":"15_CR4","doi-asserted-by":"publisher","first-page":"873","DOI":"10.1080\/00207160.2014.922682","volume":"92","author":"X Chen","year":"2015","unstructured":"Chen, X., Ding, N., Dosa, G., Han, X., Jiang, H.: Online hierarchical scheduling on two machines with known total size of low-hierarchy jobs. Int. J. Comput. Math. 92(5\u20136), 873\u2013881 (2015)","journal-title":"Int. J. Comput. Math."},{"issue":"3\u20134","key":"15_CR5","doi-asserted-by":"publisher","first-page":"1230","DOI":"10.1137\/100794006","volume":"25","author":"L Epstein","year":"2011","unstructured":"Epstein, L., Levin, A., Stee, R.: Max-min online allocations with a reordering buffer. SIAM J. Disc. Math. 25(3\u20134), 1230\u20131250 (2011)","journal-title":"SIAM J. Disc. Math."},{"key":"15_CR6","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)","journal-title":"J. Zhejiang Univ. Sci. A."},{"key":"15_CR7","doi-asserted-by":"publisher","first-page":"138","DOI":"10.1007\/s10878-009-9231-z","volume":"21","author":"M Liu","year":"2011","unstructured":"Liu, M., Chu, C., Xu, Y., Zheng, F.: Semi-online scheduling on 2 machines under a grade of service provision with bounded processing times. J. Comb. Optim. 21, 138\u2013149 (2011)","journal-title":"J. Comb. Optim."},{"key":"15_CR8","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/j.tcs.2015.03.050","volume":"607","author":"T Luo","year":"2015","unstructured":"Luo, T., Xu, Y.: Semi-online hierarchical load balancing problem with bounded processing times. Theor. Comput. Sci. 607, 75\u201382 (2015)","journal-title":"Theor. Comput. Sci."},{"issue":"6","key":"15_CR9","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."},{"key":"15_CR10","series-title":"Communications in Computer and Information Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-981-13-2712-4_1","volume-title":"Theoretical Computer Science","author":"G Wu","year":"2018","unstructured":"Wu, G., Li, W.: Semi-online machine covering on two hierarchical machines with discrete processing times. In: Li, L., Lu, P., He, K. (eds.) NCTCS 2018. CCIS, vol. 882, pp. 1\u20137. Springer, Singapore (2018). https:\/\/doi.org\/10.1007\/978-981-13-2712-4_1"},{"issue":"6","key":"15_CR11","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1016\/j.tcs.2014.02.015","volume":"531","author":"Y Wu","year":"2014","unstructured":"Wu, Y., Cheng, T.C.E., Ji, M.: Optimal algorithms for semi-online machine covering on two hierarchical machines. Theor. Comput. Sci. 531(6), 37\u201346 (2014)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"15_CR12","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1016\/j.ijpe.2011.07.021","volume":"135","author":"Y Wu","year":"2012","unstructured":"Wu, Y., Ji, M., Yang, Q.: Optimal semi-online scheduling algorithms on two parallel identical machines under a grade of service provision. Int. J. Prod. Econ. 135(1), 367\u2013371 (2012)","journal-title":"Int. J. Prod. Econ."},{"key":"15_CR13","series-title":"Communications in Computer and Information Science","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/978-981-15-0105-0_7","volume-title":"Theoretical Computer Science","author":"M Xiao","year":"2019","unstructured":"Xiao, M., Wu, G., Li, W.: Semi-online machine covering on two hierarchical machines with known total size of low-hierarchy jobs. In: Sun, X., He, K., Chen, X. (eds.) NCTCS 2019. CCIS, vol. 1069, pp. 95\u2013108. Springer, Singapore (2019). https:\/\/doi.org\/10.1007\/978-981-15-0105-0_7"},{"issue":"4","key":"15_CR14","doi-asserted-by":"publisher","first-page":"781","DOI":"10.1007\/s10878-013-9627-7","volume":"29","author":"A Zhang","year":"2015","unstructured":"Zhang, A., Jiang, Y., Fan, L., Hu, J.: Optimal online algorithms on two hierarchical machines with tightly-grouped processing times. J. Comb. Optim. 29(4), 781\u2013795 (2015)","journal-title":"J. Comb. Optim."},{"key":"15_CR15","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"},{"key":"15_CR16","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.Q., Sterna, M., Chalamon, I., B\u0142a\u017cewicz, J.: Semi-online scheduling on two identical machines with a common due date to maximize total early work. Disc. Appl. Math. 290, 71\u201378 (2021)","journal-title":"Disc. Appl. Math."},{"issue":"6","key":"15_CR17","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., B\u0142a\u017cewicz, J.: Scheduling on parallel identical machines with late work criterion: offline and online cases. J. Schedul. 19(6), 729\u2013736 (2016)","journal-title":"J. Schedul."},{"key":"15_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"},{"issue":"12","key":"15_CR19","doi-asserted-by":"publisher","first-page":"2055","DOI":"10.1016\/S0305-0548(03)00164-3","volume":"31","author":"HC Hwang","year":"2004","unstructured":"Hwang, H.C., Chang, S.Y., Lee, K.: Parallel machine scheduling under a grade of service provision. Comput. Oper. Res. 31(12), 2055\u20132061 (2004)","journal-title":"Comput. Oper. Res."},{"key":"15_CR20","doi-asserted-by":"crossref","unstructured":"Li, W., Li, J., Zhang, T.: Two approximation schemes for scheduling on parallel machines under a grade of service provision. Asia-Pac. J. Oper. Res. 29(5), Article 1250029 (2012)","DOI":"10.1142\/S0217595912500297"},{"issue":"4","key":"15_CR21","doi-asserted-by":"publisher","first-page":"328","DOI":"10.1002\/nav.20286","volume":"55","author":"J Ou","year":"2008","unstructured":"Ou, J., Leung, J.Y.T., Li, C.: Scheduling parallel machines with inclusive processing set restrictions. Naval Res. Logist. 55(4), 328\u2013338 (2008)","journal-title":"Naval Res. Logist."},{"issue":"3","key":"15_CR22","first-page":"355","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. Disc. Math. Algor. Appl. 1(3), 355\u2013368 (2009)","journal-title":"Disc. Math. Algor. Appl."},{"issue":"6","key":"15_CR23","first-page":"1126","volume":"44","author":"S Zhao","year":"2022","unstructured":"Zhao, S., Xiao, M., Li, W.: Semi-online algorithms for hierarchical scheduling on three machines with reassignment. Comput. Eng. Sci. 44(6), 1126\u20131132 (2022)","journal-title":"Comput. Eng. Sci."},{"key":"15_CR24","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1007\/BF02669690","volume":"17","author":"Y He","year":"2001","unstructured":"He, Y.: Semi-on-line scheduling problems for maximizing the minimum machine completion time. Acta Mathematicae Applicatae Sinica 17, 107\u2013113 (2001)","journal-title":"Acta Mathematicae Applicatae Sinica"},{"key":"15_CR25","doi-asserted-by":"publisher","unstructured":"Xiao, M., Bai, X., Li, W.: Online early work maximization problem on two hierarchical machines with buffer or rearrangements. In: Ni, Q., Wu, W. (eds) Algorithmic Aspects in Information and Management. AAIM 2022. Lecture Notes in Computer Science, vol. 13513. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-16081-3_5","DOI":"10.1007\/978-3-031-16081-3_5"}],"container-title":["Communications in Computer and Information Science","Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-19-8152-4_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,9]],"date-time":"2022-12-09T16:15:01Z","timestamp":1670602501000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-19-8152-4_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9789811981517","9789811981524"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-981-19-8152-4_15","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"10 December 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"NCTCS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"National Conference of Theoretical Computer Science","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Changchun","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":"29 July 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31 July 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"40","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"nctcs2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/conf.ccf.org.cn\/TCS2022","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"https:\/\/conf.ccf.org.cn\/TCS2022","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"58","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":"13","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":"6","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":"22% - 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":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}