{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T03:12:30Z","timestamp":1743045150882,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":15,"publisher":"Springer Singapore","isbn-type":[{"type":"print","value":"9789811618765"},{"type":"electronic","value":"9789811618772"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-981-16-1877-2_4","type":"book-chapter","created":{"date-parts":[[2021,4,8]],"date-time":"2021-04-08T06:03:53Z","timestamp":1617861833000},"page":"47-56","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Semi-online Algorithms for Hierarchical Scheduling on Three Parallel Machines with a Buffer Size of 1"],"prefix":"10.1007","author":[{"given":"Man","family":"Xiao","sequence":"first","affiliation":[]},{"given":"Lu","family":"Ding","sequence":"additional","affiliation":[]},{"given":"Shu","family":"Zhao","sequence":"additional","affiliation":[]},{"given":"Weidong","family":"Li","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,4,9]]},"reference":[{"issue":"12","key":"4_CR1","doi-asserted-by":"publisher","first-page":"2055","DOI":"10.1016\/S0305-0548(03)00164-3","volume":"31","author":"H Hwang","year":"2004","unstructured":"Hwang, H., 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."},{"issue":"4","key":"4_CR2","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.L.: Scheduling parallel machines with inclusive processing set restrictions. Nav. Res. Logist. 55(4), 328\u2013338 (2008)","journal-title":"Nav. Res. Logist."},{"issue":"05","key":"4_CR3","doi-asserted-by":"publisher","first-page":"83","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 Pac. J. Oper. Res. 29(05), 83\u201394 (2012)","journal-title":"Asia Pac. J. Oper. Res."},{"issue":"6","key":"4_CR4","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."},{"issue":"3","key":"4_CR5","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(3), 309\u2013314 (2006)","journal-title":"J. Zhejiang Univ. Sci. A"},{"key":"4_CR6","unstructured":"Lim, K., Park, J., Chang, S.Y., Lee, K.: Online and semi-online scheduling of three machines under a GoS provision. In: Working Paper, Department of Industrial and Management Engineering, Pohang University of Science and Technology, Republic of Korea (2010)"},{"issue":"1","key":"4_CR7","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 algorithm 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."},{"issue":"38","key":"4_CR8","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. Theoret. Comput. Sci. 410(38), 3597\u20133605 (2009)","journal-title":"Theoret. Comput. Sci."},{"issue":"4","key":"4_CR9","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":"4_CR10","doi-asserted-by":"crossref","unstructured":"Englert, M., Ozmen, D., Westermann, M.: The power of reordering for online minimum makespan scheduling. In: 2008 49th Annual IEEE Symposium on Foundations of Computer Science, pp. 603\u2013612. IEEE (2008)","DOI":"10.1109\/FOCS.2008.46"},{"key":"4_CR11","doi-asserted-by":"crossref","unstructured":"Lan, Y., Chen, X., Ding, N., Han, X.: Online minimum makespan scheduling with a buffer. In: Proceedings of the Joint International Conference on Frontiers in Algorithmics and Algorithmic Aspects in Information and Management, pp. 161\u2013171 (2012)","DOI":"10.1007\/978-3-642-29700-7_15"},{"issue":"3","key":"4_CR12","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1016\/S0020-0190(97)00006-9","volume":"61","author":"G Zhang","year":"1997","unstructured":"Zhang, G.: A simple semi on-line algorithm for P2\/\/$$C_{max}$$ with a buffer. Inf. Process. Lett. 61(3), 145\u2013148 (1997)","journal-title":"Inf. Process. Lett."},{"issue":"4","key":"4_CR13","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(4), 127\u2013131 (2013)","journal-title":"Inf. Process. Lett."},{"issue":"03","key":"4_CR14","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(03), 355\u2013368 (2009)","journal-title":"Discrete Math. Algorithms Appl."},{"key":"4_CR15","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"}],"container-title":["Communications in Computer and Information Science","Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-16-1877-2_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,8]],"date-time":"2021-04-08T06:16:14Z","timestamp":1617862574000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-981-16-1877-2_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9789811618765","9789811618772"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-981-16-1877-2_4","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"9 April 2021","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":"Nanning","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":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 November 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 November 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"nctcs2020","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":"https:\/\/conf.ccf.org.cn\/TCS2020","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"28","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":"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":"46% - 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-5","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-5","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)"}}]}}