{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,30]],"date-time":"2026-04-30T09:06:43Z","timestamp":1777540003895,"version":"3.51.4"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783031160806","type":"print"},{"value":"9783031160813","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.springer.com\/tdm"},{"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.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-16081-3_5","type":"book-chapter","created":{"date-parts":[[2022,9,17]],"date-time":"2022-09-17T22:02:24Z","timestamp":1663452144000},"page":"46-54","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Online Early Work Maximization Problem on\u00a0Two Hierarchical Machines with\u00a0Buffer or\u00a0Rearrangements"],"prefix":"10.1007","author":[{"given":"Man","family":"Xiao","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xihua","family":"Bai","sequence":"additional","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,9,18]]},"reference":[{"issue":"4","key":"5_CR1","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":"5_CR2","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":"6","key":"5_CR3","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(6), 729\u2013736 (2016)","journal-title":"J. Sched."},{"key":"5_CR4","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1016\/j.ipl.2012.12.007","volume":"113","author":"X Chen","year":"2013","unstructured":"Chen, X., Xu, Z., Dosa, G., Han, X., Jiang, H.: Semi-online hierarchical scheduling problems with buffer or rearrangements. Inf. Process. Lett. 113, 127\u2013131 (2013)","journal-title":"Inf. Process. Lett."},{"key":"5_CR5","doi-asserted-by":"crossref","unstructured":"Dai, B., Li, J., Li, W.: Semi-online hierarchical scheduling for bag-of-tasks on two machines. In: Proceedings of the 2018 2nd International Conference on Computer Science and Artificial Intelligence, pp. 609\u2013614 (2018)","DOI":"10.1145\/3297156.3297222"},{"issue":"3\u20134","key":"5_CR6","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.V.: Max-min online allocations with a reordering buffer. SIAM J. Discret. Math. 25(3\u20134), 1230\u20131250 (2011)","journal-title":"SIAM J. Discret. Math."},{"key":"5_CR7","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"},{"issue":"05","key":"5_CR8","doi-asserted-by":"publisher","first-page":"1250029","DOI":"10.1142\/S0217595912500297","volume":"29","author":"W Li","year":"2012","unstructured":"Li, W., Li, J., Zhang, T.: Two approximation schemes for scheduling on parallel machines under a grade of service provision. Asia-Pacific J. Oper. Res. 29(05), 1250029 (2012)","journal-title":"Asia-Pacific J. Oper. Res."},{"key":"5_CR9","doi-asserted-by":"publisher","unstructured":"Li, W.: Improved approximation schemes for early work scheduling on identical parallel machines with a common due date. J. Oper. Res. Soc. Chin. (2022). https:\/\/doi.org\/10.1007\/s40305-022-00402-y","DOI":"10.1007\/s40305-022-00402-y"},{"key":"5_CR10","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. Theoret. Comput. Sci. 607, 75\u201382 (2015)","journal-title":"Theoret. Comput. Sci."},{"issue":"6","key":"5_CR11","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.Y., 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":"5_CR12","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":"5_CR13","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. Theoret. Comput. Sci. 531(6), 37\u201346 (2014)","journal-title":"Theoret. Comput. Sci."},{"issue":"1","key":"5_CR14","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.F.: 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":"5_CR15","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":"5_CR16","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":"5_CR17","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":"5_CR18","doi-asserted-by":"publisher","first-page":"781","DOI":"10.1007\/s10878-013-9627-7","volume":"29","author":"A Zhang","year":"2013","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 (2013). https:\/\/doi.org\/10.1007\/s10878-013-9627-7","journal-title":"J. Comb. Optim."}],"container-title":["Lecture Notes in Computer Science","Algorithmic Aspects in Information and Management"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-16081-3_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,17]],"date-time":"2022-09-17T22:02:57Z","timestamp":1663452177000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-16081-3_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031160806","9783031160813"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-16081-3_5","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":"18 September 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"AAIM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Algorithmic Applications in Management","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 August 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 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":"aaim2022","order":10,"name":"conference_id","label":"Conference ID","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":"Springer Nature EquinOCS","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"59","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":"41","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":"69% - 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":"2","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)"}}]}}