{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T12:26:21Z","timestamp":1759667181459,"version":"3.37.3"},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2016,11,25]],"date-time":"2016-11-25T00:00:00Z","timestamp":1480032000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["NSFC(11671368)"],"award-info":[{"award-number":["NSFC(11671368)"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100006407","name":"Natural Science Foundation of Henan Province","doi-asserted-by":"publisher","award":["NSF-Henan(15IRTSTHN006)"],"award-info":[{"award-number":["NSF-Henan(15IRTSTHN006)"]}],"id":[{"id":"10.13039\/501100006407","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["4OR-Q J Oper Res"],"published-print":{"date-parts":[[2017,9]]},"DOI":"10.1007\/s10288-016-0334-y","type":"journal-article","created":{"date-parts":[[2016,11,25]],"date-time":"2016-11-25T08:40:49Z","timestamp":1480063249000},"page":"265-276","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Semi-online hierarchical scheduling for \n                $$l_p$$\n                \n                    \n                                    \n                        \n                            l\n                            p\n                        \n                    \n                \n            -norm load balancing with buffer or rearrangements"],"prefix":"10.1007","volume":"15","author":[{"given":"Xianglai","family":"Qi","sequence":"first","affiliation":[]},{"given":"Jinjiang","family":"Yuan","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,11,25]]},"reference":[{"key":"334_CR1","doi-asserted-by":"crossref","first-page":"422","DOI":"10.1007\/s004530010051","volume":"29","author":"A Avidor","year":"2001","unstructured":"Avidor A, Azar Y, Sgall J (2001) Ancient and new algorithms for load balancing in the \n                        $$l_p$$\n                        \n                            \n                                            \n                                \n                                    l\n                                    p\n                                \n                            \n                        \n                     norm. Algorithmica 29:422\u2013441","journal-title":"Algorithmica"},{"key":"334_CR2","doi-asserted-by":"crossref","first-page":"527","DOI":"10.1137\/S0097539798346135","volume":"31","author":"A Bar-Noy","year":"2001","unstructured":"Bar-Noy A, Freund A, Naor J (2001) Online load balancing in a hierarchical server topology. SIAM J Comput 31:527\u2013549","journal-title":"SIAM J Comput"},{"key":"334_CR3","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1137\/0204021","volume":"4","author":"AK Chandra","year":"1975","unstructured":"Chandra AK, Wong CK (1975) Worst-case analysis of a placement algorithm related to storage allocation. SIAM J Comput 4:249\u2013263","journal-title":"SIAM J Comput"},{"key":"334_CR4","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1016\/j.ipl.2012.12.007","volume":"113","author":"X Chen","year":"2013","unstructured":"Chen X, Xu ZZ, D\u00f3sa G, Han X, Jiang H (2013) Semi-online hierarchical scheduling problems with buffer or rearrangements. Inf Process Lett 113:127\u2013131","journal-title":"Inf Process Lett"},{"key":"334_CR5","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/S0167-5060(08)70356-X","volume":"5","author":"RL Graham","year":"1979","unstructured":"Graham RL, Lawler EL, Lenstra JK, Rinnooy Kan AHG (1979) Optimization and approximation in deterministic sequencing and scheduling: a survey. Ann Discrete Math 5:287\u2013326","journal-title":"Ann Discrete Math"},{"key":"334_CR6","doi-asserted-by":"crossref","first-page":"2055","DOI":"10.1016\/S0305-0548(03)00164-3","volume":"31","author":"HC Hwang","year":"2004","unstructured":"Hwang HC, Chang SY, Lee K (2004) Parallel machine scheduling under a grade of service provision. Comput Oper Res 31:2055\u20132061","journal-title":"Comput Oper Res"},{"key":"334_CR7","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1631\/jzus.2006.A0309","volume":"7A","author":"YW Jiang","year":"2006","unstructured":"Jiang YW, He Y, Tang CM (2006) Optimal online algorithms for scheduling on two identical machines under a grade of service. J Zhejiang Univ Sci 7A:309\u2013314","journal-title":"J Zhejiang Univ Sci"},{"key":"334_CR8","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1016\/S0167-6377(98)00005-4","volume":"21","author":"H Kellerer","year":"1997","unstructured":"Kellerer H, Kotov V, Speranza MG, Tuza Z (1997) Semi on-line algorithms for the partition problem. Oper Res Lett 21:235\u2013242","journal-title":"Oper Res Lett"},{"key":"334_CR9","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1007\/s10479-012-1271-6","volume":"204","author":"K Lee","year":"2013","unstructured":"Lee K, Leung JY-T, Pinedo ML (2013) Makespan minimization in online scheduling with machine eligibility. Ann Oper Res 204:189\u2013222","journal-title":"Ann Oper Res"},{"key":"334_CR10","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1016\/j.ijpe.2008.09.003","volume":"116","author":"JY-T Leung","year":"2008","unstructured":"Leung JY-T, Li C-L (2008) Scheduling with processing set restrictions: a survey. Int J Prod Econ 116:251\u2013262","journal-title":"Int J Prod Econ"},{"key":"334_CR11","doi-asserted-by":"crossref","first-page":"138","DOI":"10.1007\/s10878-009-9231-z","volume":"21","author":"M Liu","year":"2011","unstructured":"Liu M, Chu CB, Xu YF, Zheng FF (2011) Semi-online scheduling on two machines under a grade of service provision with bounded processing times. J Comb Optim 21:138\u2013149","journal-title":"J Comb Optim"},{"key":"334_CR12","doi-asserted-by":"crossref","first-page":"62","DOI":"10.1016\/j.tcs.2013.11.026","volume":"521","author":"TB Luo","year":"2014","unstructured":"Luo TB, Xu YF, Luo L, He CZ (2014) Semi-online scheduling with two GoS levels and unit processing time. Theor Comput Sci 521:62\u201372","journal-title":"Theor Comput Sci"},{"key":"334_CR13","doi-asserted-by":"crossref","first-page":"692","DOI":"10.1016\/j.orl.2005.11.004","volume":"34","author":"J Park","year":"2006","unstructured":"Park J, Chang SY, Lee K (2006) Online and semi-online scheduling of two machines under a grade of service provision. Oper Res Lett 34:692\u2013696","journal-title":"Oper Res Lett"},{"key":"334_CR14","unstructured":"Qi XL, Yuan JJ (2016) Online and semi-online hierarchical scheduling for \n                        $$l_p$$\n                        \n                            \n                                            \n                                \n                                    l\n                                    p\n                                \n                            \n                        \n                    -norm load balancing on two identical machines (submitted)"},{"key":"334_CR15","doi-asserted-by":"crossref","first-page":"246","DOI":"10.1016\/j.tcs.2009.08.014","volume":"412","author":"ZY Tan","year":"2011","unstructured":"Tan ZY, Zhang A (2011) Online hierarchical scheduling: an approach using mathematical programming. Theor Comput Sci 412:246\u2013256","journal-title":"Theor Comput Sci"},{"key":"334_CR16","doi-asserted-by":"crossref","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 (2012) Optimal semi-online scheduling algorithms on two parallel identical machines under a grade of service provision. Int J Prod Econ 135:367\u2013371","journal-title":"Int J Prod Econ"},{"key":"334_CR17","unstructured":"Zhang A (2009) A study of online hierarchical scheduling and some related problems. Ph.D thesis, Zhejiang University"},{"key":"334_CR18","doi-asserted-by":"crossref","first-page":"781","DOI":"10.1007\/s10878-013-9627-7","volume":"29","author":"A Zhang","year":"2015","unstructured":"Zhang A, Jiang YW, Fan LD, Hu JL (2015) Optimal online algorithms on two hierarchical machines with tightly-grouped processing times. J Comb Optim 29:781\u2013795","journal-title":"J Comb Optim"}],"container-title":["4OR"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10288-016-0334-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10288-016-0334-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10288-016-0334-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,9,2]],"date-time":"2017-09-02T04:55:52Z","timestamp":1504328152000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10288-016-0334-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,11,25]]},"references-count":18,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2017,9]]}},"alternative-id":["334"],"URL":"https:\/\/doi.org\/10.1007\/s10288-016-0334-y","relation":{},"ISSN":["1619-4500","1614-2411"],"issn-type":[{"type":"print","value":"1619-4500"},{"type":"electronic","value":"1614-2411"}],"subject":[],"published":{"date-parts":[[2016,11,25]]}}}