{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T12:28:34Z","timestamp":1759667314627},"reference-count":13,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2013,5,15]],"date-time":"2013-05-15T00:00:00Z","timestamp":1368576000000},"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":[[2015,5]]},"DOI":"10.1007\/s10878-013-9627-7","type":"journal-article","created":{"date-parts":[[2013,5,14]],"date-time":"2013-05-14T12:40:04Z","timestamp":1368535204000},"page":"781-795","source":"Crossref","is-referenced-by-count":18,"title":["Optimal online algorithms on two hierarchical machines with tightly-grouped processing times"],"prefix":"10.1007","volume":"29","author":[{"given":"An","family":"Zhang","sequence":"first","affiliation":[]},{"given":"Yiwei","family":"Jiang","sequence":"additional","affiliation":[]},{"given":"Lidan","family":"Fan","sequence":"additional","affiliation":[]},{"given":"Jueliang","family":"Hu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2013,5,15]]},"reference":[{"key":"9627_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 Journal on Computing. 31:527\u2013549","journal-title":"SIAM Journal on Computing."},{"issue":"4","key":"9627_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. Journal of Combinatorial Optimization. 15(4):305\u2013314","journal-title":"Journal of Combinatorial Optimization."},{"key":"9627_CR3","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 Applied Mathematics. 137:237\u2013266","journal-title":"Discrete Applied Mathematics."},{"issue":"5","key":"9627_CR4","doi-asserted-by":"crossref","first-page":"602","DOI":"10.1016\/j.ic.2007.11.004","volume":"206","author":"G D\u00f3sa","year":"2008","unstructured":"D\u00f3sa G, Epstein L (2008) Preemptive scheduling on a small number of hierarchical machines. Information and Computation. 206(5):602\u2013619","journal-title":"Information and Computation."},{"key":"9627_CR5","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1007\/s006070050020","volume":"62","author":"Y He","year":"1999","unstructured":"He Y, Zhang G (1999) Semi on-line scheduling on two identical machines. Computing. 62:179\u2013187","journal-title":"Computing."},{"key":"9627_CR6","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1007\/s10878-007-9095-z","volume":"16","author":"Y Jiang","year":"2008","unstructured":"Jiang Y (2008) Online scheduling on parallel machines with two GoS levels. Journal of Combinatorial Optimization. 16:28\u201338","journal-title":"Journal of Combinatorial Optimization."},{"key":"9627_CR7","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1631\/jzus.2006.A0309","volume":"7A","author":"Y Jiang","year":"2006","unstructured":"Jiang Y, He Y, Tang C (2006) Optimal online algorithms for scheduling on two identical machines under a grade of service. Journal of Zhejiang University Science. 7A:309\u2013314","journal-title":"Journal of Zhejiang University Science."},{"key":"9627_CR8","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 C, Xu Y, Zheng F (2011) Semi-online scheduling on 2 machines under a grade of service provision with bounded processing times. Journal of Combinatorial Optimization. 21:138\u2013149","journal-title":"Journal of Combinatorial Optimization."},{"key":"9627_CR9","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 S, Lee K (2006) Online and semi-online scheduling of two machines under a grade of service provision. Operations Research Letters. 34:692\u2013696","journal-title":"Operations Research Letters."},{"key":"9627_CR10","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1007\/s10878-008-9195-4","volume":"20","author":"Z Tan","year":"2010","unstructured":"Tan Z, Zhang A (2010) A note on hierarchical scheduling on two uniform machines. Journal of Combinatorial Optimization. 20:85\u201395","journal-title":"Journal of Combinatorial Optimization."},{"key":"9627_CR11","doi-asserted-by":"crossref","first-page":"246","DOI":"10.1016\/j.tcs.2009.08.014","volume":"412","author":"Z Tan","year":"2011","unstructured":"Tan Z, Zhang A (2011) Online hierarchical scheduling: An approach using mathematical programming. Theoretical Computer Science. 412:246\u2013256","journal-title":"Theoretical Computer Science."},{"key":"9627_CR12","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. International Journal of Production Economics. 135:367\u2013371","journal-title":"International Journal of Production Economics."},{"key":"9627_CR13","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 Y, Tan Z (2009) Online parallel machines scheduling with two hierarchies. Theoretical Computer Science. 410:3597\u20133605","journal-title":"Theoretical Computer Science."}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-013-9627-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-013-9627-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-013-9627-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T04:23:21Z","timestamp":1559276601000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-013-9627-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,5,15]]},"references-count":13,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2015,5]]}},"alternative-id":["9627"],"URL":"https:\/\/doi.org\/10.1007\/s10878-013-9627-7","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,5,15]]}}}