{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,23]],"date-time":"2026-08-23T16:07:08Z","timestamp":1787501228348,"version":"build-2736575974"},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540662518","type":"print"},{"value":"9783540484813","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1999]]},"DOI":"10.1007\/3-540-48481-7_8","type":"book-chapter","created":{"date-parts":[[2007,10,27]],"date-time":"2007-10-27T19:49:40Z","timestamp":1193514580000},"page":"77-88","source":"Crossref","is-referenced-by-count":5,"title":["On-Line Load Balancing in a Hierarchical Server Topology"],"prefix":"10.1007","author":[{"given":"Amotz","family":"Bar-Noy","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ari","family":"Freund","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Joseph","family":"Naor","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2003,1,14]]},"reference":[{"key":"8_CR1","doi-asserted-by":"crossref","unstructured":"S. Albers. Better bounds for online scheduling. Proc. 29th ACM Symp. on Theory of Computing, pp. 130\u2013139, 1997.","DOI":"10.1145\/258533.258566"},{"key":"8_CR2","doi-asserted-by":"publisher","first-page":"486","DOI":"10.1145\/258128.258201","volume":"44","author":"J. Aspnes","year":"1997","unstructured":"J. Aspnes, Y. Azar, A. Fiat, S. Plotkin, and O. Waartz. On-line machine scheduling with applications to load balancing and virtual circuit routing. Journal of the ACM, 44:486\u2013504, 1997.","journal-title":"Journal of the ACM"},{"key":"8_CR3","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"178","DOI":"10.1007\/BFb0029569","volume-title":"On-line Algorithms: The State of the Art","author":"Y. Azar","year":"1998","unstructured":"Y. Azar. On-line load balancing. On-line Algorithms: The State of the Art, Eds. A. Fiat and G. Woeginger, LNCS 1442, pp. 178\u2013195, Springer, 1998."},{"key":"8_CR4","doi-asserted-by":"crossref","unstructured":"Y. Azar, A. Broder, and A. Karlin. On-line load balancing. Proc. 33rd IEEE Symp. on Foundations of Computer Science, pp. 218\u2013225, 1992.","DOI":"10.1109\/SFCS.1992.267770"},{"key":"8_CR5","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1006\/jagm.1995.0799","volume":"22","author":"Y. Azar","year":"1997","unstructured":"Y. Azar, B. Kalyanasundaram, S. Plotkin, K. Pruhs, and O. Waarts. On-line load balancing of temporary tasks. Journal of Algorithms, Vol. 22, pp. 93\u2013110, 1997.","journal-title":"Journal of Algorithms"},{"key":"8_CR6","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1006\/jagm.1995.1008","volume":"18","author":"Y. Azar","year":"1995","unstructured":"Y. Azar, J. Naor, and R. Rom. The competitiveness of on-line assignments. Journal of Algorithms, Vol. 18, pp. 221\u2013237, 1995.","journal-title":"Journal of Algorithms"},{"key":"8_CR7","doi-asserted-by":"crossref","unstructured":"Y. Bartal, A. Fiat, H. Karloff, and R. Vohra. Newalgorithms for an ancient scheduling problem. Proc. 24th ACM Symp. on Theory of Computing, pp. 51\u201358, 1992.","DOI":"10.1145\/129712.129718"},{"key":"8_CR8","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1016\/0020-0190(94)00026-3","volume":"50","author":"Y. Bartal","year":"1994","unstructured":"Y. Bartal, H. J. Karloff, and Y. Rabani. A Better Lower Bound for On-line Scheduling. Information Processing Letters, 50:113\u2013116, 1994.","journal-title":"Information Processing Letters"},{"key":"8_CR9","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"116","DOI":"10.1007\/3-540-63307-3_52","volume-title":"5th International Workshop on Algorithms and Data Structures\u2019 97","author":"P. Berman","year":"1997","unstructured":"P. Berman, M. Charikar, and M. Karpinski. On-line load balancing for related machines. 5th International Workshop on Algorithms and Data Structures\u2019 97, LNCS 1272, pp. 116\u2013125, Springer, 1997."},{"key":"8_CR10","doi-asserted-by":"crossref","first-page":"1563","DOI":"10.1002\/j.1538-7305.1966.tb01709.x","volume":"45","author":"R. Graham","year":"1966","unstructured":"R. Graham. Bounds for certain multiprocessor anomalies. Bell System Technical Journal, Vol. 45, pp. 1563\u20131581, 1966.","journal-title":"Bell System Technical Journal"},{"key":"8_CR11","unstructured":"D. R. Karger, S. J. Phillips, and E. Torng. A better algorithm for an ancient scheduling problem. Proc. 5th ACM-SIAM Symp. on Discrete Algorithms, pp. 132\u2013140, 1994."},{"key":"8_CR12","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"196","DOI":"10.1007\/BFb0029570","volume-title":"On-line Algorithms: The State of the Art","author":"J. Sgall","year":"1998","unstructured":"J. Sgall. On-line scheduling. On-line Algorithms: The State of the Art, Eds. A. Fiat and G. Woeginger, LNCS 1442, pp. 196\u2013231, Springer, 1998."}],"container-title":["Lecture Notes in Computer Science","Algorithms - ESA\u2019 99"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-48481-7_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T22:20:47Z","timestamp":1556922047000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-48481-7_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540662518","9783540484813"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/3-540-48481-7_8","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[1999]]}}}