{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,10]],"date-time":"2024-09-10T18:36:22Z","timestamp":1725993382569},"publisher-location":"Singapore","reference-count":11,"publisher":"Springer Singapore","isbn-type":[{"type":"print","value":"9789811327117"},{"type":"electronic","value":"9789811327124"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"tdm","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":[[2018]]},"DOI":"10.1007\/978-981-13-2712-4_1","type":"book-chapter","created":{"date-parts":[[2018,9,25]],"date-time":"2018-09-25T11:37:15Z","timestamp":1537875435000},"page":"1-7","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Semi-online Machine Covering on Two Hierarchical Machines with Discrete Processing Times"],"prefix":"10.1007","author":[{"given":"Gangxiong","family":"Wu","sequence":"first","affiliation":[]},{"given":"Weidong","family":"Li","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,9,26]]},"reference":[{"issue":"4","key":"1_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":"12","key":"1_CR2","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."},{"issue":"3","key":"1_CR3","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 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."},{"issue":"3","key":"1_CR4","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. Discret. Math. Algorithms Appl. 1(3), 355\u2013368 (2009)","journal-title":"Discret. Math. Algorithms Appl."},{"key":"1_CR5","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":"05","key":"1_CR6","doi-asserted-by":"publisher","first-page":"1250029","DOI":"10.1142\/S0217595912500297","volume":"29","author":"WEIDONG 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(5), Article No. 1250029 (2012)","journal-title":"Asia-Pacific Journal of Operational Research"},{"issue":"4","key":"1_CR7","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":"6","key":"1_CR8","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":"1_CR9","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 algorithm for semi-online machine covering on two hierarchical machines. Theor. Comput. Sci. 531, 37\u201346 (2014)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"1_CR10","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":"4","key":"1_CR11","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."}],"container-title":["Communications in Computer and Information Science","Theoretical Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-13-2712-4_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,9,25]],"date-time":"2018-09-25T11:37:18Z","timestamp":1537875438000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-981-13-2712-4_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9789811327117","9789811327124"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-981-13-2712-4_1","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"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":"Shanghai","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":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 October 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 October 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"36","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"nctcs2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/itcs.shufe.edu.cn\/nctcs2018\/index.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}