{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T12:33:31Z","timestamp":1759667611870},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2011,9,1]],"date-time":"2011-09-01T00:00:00Z","timestamp":1314835200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2012,11]]},"DOI":"10.1007\/s10878-011-9410-6","type":"journal-article","created":{"date-parts":[[2011,8,31]],"date-time":"2011-08-31T23:47:53Z","timestamp":1314834473000},"page":"593-612","source":"Crossref","is-referenced-by-count":10,"title":["Online scheduling on uniform machines with two hierarchies"],"prefix":"10.1007","volume":"24","author":[{"given":"Li-ying","family":"Hou","sequence":"first","affiliation":[]},{"given":"Liying","family":"Kang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2011,9,1]]},"reference":[{"key":"9410_CR1","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) On-line load balancing in a hierarchical server topology. SIAM J Comput 31:527\u2013549","journal-title":"SIAM J Comput"},{"key":"9410_CR2","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1007\/s10878-007-9078-0","volume":"15","author":"O Chassid","year":"2008","unstructured":"Chassid O, Epstein L (2008) The hierarchical model for load balancing on two machines. J Comb Optim 15:305\u2013314","journal-title":"J Comb Optim"},{"key":"9410_CR3","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1137\/0209007","volume":"9","author":"Y Cho","year":"1980","unstructured":"Cho Y, Sahni S (1980) Bounds for list schedules on uniform processors. SIAM J Comput 9:91\u2013103","journal-title":"SIAM J Comput"},{"key":"9410_CR4","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1016\/S0166-218X(03)00341-X","volume":"137","author":"P Crescenzi","year":"2004","unstructured":"Crescenzi P, Gambosi G, Penna P (2004) On-line algorithms for the channel assignment problem in cellular networks. Discrete Appl Math 137:237\u2013266","journal-title":"Discrete Appl Math"},{"key":"9410_CR5","doi-asserted-by":"crossref","first-page":"602","DOI":"10.1016\/j.ic.2007.11.004","volume":"206","author":"G Dosa","year":"2008","unstructured":"Dosa G, Epstein L (2008) Preemptive scheduling on a small number of hierarchical machines. Inf Comput 206:602\u2013619","journal-title":"Inf Comput"},{"key":"9410_CR6","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":"9410_CR7","author":"F Han","year":"2011","unstructured":"Han F, Tan ZY, Yang Y (2011) On the optimality of list scheduling for online uniform machines scheduling. Optim Lett doi: 10.1007\/s11590-011-0335-x","journal-title":"Optim Lett"},{"key":"9410_CR8","doi-asserted-by":"crossref","first-page":"2055","DOI":"10.1016\/S0305-0548(03)00164-3","volume":"31","author":"H Hwang","year":"2004","unstructured":"Hwang H, 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":"9410_CR9","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1007\/s10878-007-9095-z","volume":"16","author":"YW Jiang","year":"2008","unstructured":"Jiang YW (2008) Online scheduling on parallel machines with two GoS levels. J Comb Optim 16:28\u201338","journal-title":"J Comb Optim"},{"issue":"3","key":"9410_CR10","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1631\/jzus.2006.A0309","volume":"7","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 7(3):309\u2013314","journal-title":"J Zhejiang Univ Sci"},{"key":"9410_CR11","doi-asserted-by":"crossref","first-page":"414","DOI":"10.1137\/S0097539799527969","volume":"27","author":"RH Li","year":"1998","unstructured":"Li RH, Shi LJ (1998) An online algorithm for some uniform professor scheduling. SIAM J Comput 27:414\u2013422","journal-title":"SIAM J Comput"},{"key":"9410_CR12","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1007\/s10951-010-0177-x","volume":"14","author":"A Musitelli","year":"2011","unstructured":"Musitelli A, Nicoletti JM (2011) Competitive ratio of list scheduling on uniform machines and randomized heuristics. J Sched 14:89\u2013101","journal-title":"J Sched"},{"key":"9410_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":"9410_CR14","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1007\/s10878-008-9195-4","volume":"20","author":"ZY Tan","year":"2008","unstructured":"Tan ZY, Zhang A (2008) A note on hierarchical scheduling on two uniform machines. J Comb Optim 20:85\u201395","journal-title":"J Comb Optim"},{"key":"9410_CR15","doi-asserted-by":"crossref","first-page":"3597","DOI":"10.1016\/j.tcs.2009.04.007","volume":"410","author":"A Zhang","year":"2009","unstructured":"Zhang A, Jiang YW, Tan ZY (2009) Online parallel machines scheduling with two hierarchies. Theor Comput Sci 410:3597\u20133605","journal-title":"Theor Comput Sci"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-011-9410-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-011-9410-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-011-9410-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T00:23:15Z","timestamp":1559262195000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-011-9410-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,9,1]]},"references-count":15,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2012,11]]}},"alternative-id":["9410"],"URL":"https:\/\/doi.org\/10.1007\/s10878-011-9410-6","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,9,1]]}}}