{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,24]],"date-time":"2025-08-24T01:14:31Z","timestamp":1755998071821},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2011,3,10]],"date-time":"2011-03-10T00:00:00Z","timestamp":1299715200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Sched"],"published-print":{"date-parts":[[2013,2]]},"DOI":"10.1007\/s10951-011-0226-0","type":"journal-article","created":{"date-parts":[[2011,3,9]],"date-time":"2011-03-09T19:42:48Z","timestamp":1299699768000},"page":"117-127","source":"Crossref","is-referenced-by-count":2,"title":["Fair online load balancing"],"prefix":"10.1007","volume":"16","author":[{"given":"Niv","family":"Buchbinder","sequence":"first","affiliation":[]},{"given":"Joseph","family":"Naor","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2011,3,10]]},"reference":[{"key":"226_CR1","first-page":"278","volume-title":"First International workshop on QoS routing (WQoSR)","author":"M. Allalouf","year":"2004","unstructured":"Allalouf, M., & Shavitt, Y. (2004). Maximum flow routing with weighted max-min fairness. In First International workshop on QoS routing (WQoSR) (pp. 278\u2013287)."},{"key":"226_CR2","first-page":"846","volume-title":"Proceedings of the 10th ACM-SIAM symposium on discrete algorithms","author":"J. A. Aslam","year":"1999","unstructured":"Aslam, J. A., Rasala, A., Stein, C., & Young, N. (1999). Improved bicriteria existence theorems for scheduling. In Proceedings of the 10th ACM-SIAM symposium on discrete algorithms (pp. 846\u2013847)."},{"issue":"3","key":"226_CR3","doi-asserted-by":"crossref","first-page":"486","DOI":"10.1145\/258128.258201","volume":"44","author":"J. Aspnes","year":"1997","unstructured":"Aspnes, J., Azar, Y., Fiat, A., Plotkin, S., & Waarts, O. (1997). On-line routing of virtual circuits with applications to load balancing and machine scheduling. Journal of the ACM, 44(3), 486\u2013504.","journal-title":"Journal of the ACM"},{"key":"226_CR4","doi-asserted-by":"crossref","first-page":"178","DOI":"10.1007\/BFb0029569","volume-title":"Online algorithms: The state of the art","author":"Y. Azar","year":"1998","unstructured":"Azar, Y. (1998). On-line load balancing. In Online algorithms: The state of the art (Vol.\u00a08, pp.\u00a0178\u2013195)."},{"key":"226_CR5","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1006\/jagm.1995.1008","volume":"18","author":"Y. Azar","year":"1995","unstructured":"Azar, Y., Naor, J., & Rom, R. (1995). The competitiveness of on-line assignments. Journal of Algorithms, 18, 221\u2013237.","journal-title":"Journal of Algorithms"},{"issue":"2","key":"226_CR6","doi-asserted-by":"crossref","first-page":"120","DOI":"10.1016\/j.jalgor.2004.02.003","volume":"52","author":"Y. Azar","year":"2004","unstructured":"Azar, Y., Epstein, L., Richter, Y., & Woeginger, G. (2004). All-norm approximation algorithms. Journal of Algorithms, 52(2), 120\u2013133.","journal-title":"Journal of Algorithms"},{"key":"226_CR7","volume-title":"Data networks","author":"D. Bertsekas","year":"1987","unstructured":"Bertsekas, D., & Gallager, R. (1987). Data networks. New York: Prentice-Hall."},{"key":"226_CR8","unstructured":"Buchbinder, N., & Naor, J. (2006). A primal-dual approach to online routing and packing (Manuscript)."},{"issue":"4","key":"226_CR9","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1007\/s00453-005-1177-7","volume":"44","author":"A. Goel","year":"2006","unstructured":"Goel, A., & Meyerson, A. (2006). Simultaneous optimization via approximate majorization for concave profits or convex costs. Algorithmica, 44(4), 301\u2013323.","journal-title":"Algorithmica"},{"issue":"1","key":"226_CR10","doi-asserted-by":"crossref","first-page":"62","DOI":"10.1006\/jcss.2001.1755","volume":"63","author":"A. Goel","year":"2001","unstructured":"Goel, A., Meyerson, A., & Plotkin, S. (2001). Combining fairness with throughput: Online routing with multiple objectives. Journal of Computer and System Sciences, 63(1), 62\u201379.","journal-title":"Journal of Computer and System Sciences"},{"issue":"2","key":"226_CR11","doi-asserted-by":"crossref","first-page":"338","DOI":"10.1145\/1103963.1103970","volume":"1","author":"A. Goel","year":"2005","unstructured":"Goel, A., Meyerson, A., & Plotkin, S.\u00a0A. (2005). Approximate majorization and fair online load balancing. ACM Transactions on Algorithms, 1(2), 338\u2013349.","journal-title":"ACM Transactions on Algorithms"},{"issue":"7","key":"226_CR12","doi-asserted-by":"crossref","first-page":"954","DOI":"10.1109\/TCOM.1981.1095081","volume":"29","author":"J. M. Jaffe","year":"1981","unstructured":"Jaffe, J. M. (1981). Bottleneck flow control. IEEE Transactions on Communications, 29(7), 954\u2013962.","journal-title":"IEEE Transactions on Communications"},{"issue":"1","key":"226_CR13","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1006\/jcss.2001.1752","volume":"63","author":"J. Kleinberg","year":"2001","unstructured":"Kleinberg, J., Rabani, Y. & Tardos, E., (2001). Fairness in routing and load balancing. Journal of Computer and System Sciences, 63(1), 2\u201320.","journal-title":"Journal of Computer and System Sciences"},{"issue":"3","key":"226_CR14","doi-asserted-by":"crossref","first-page":"657","DOI":"10.1137\/S0097539703434966","volume":"36","author":"A. Kumar","year":"2006","unstructured":"Kumar, A., & Kleinberg, J. M. (2006). Fairness measures for resource allocation. SIAM Journal on Computing, 36(3), 657\u2013680.","journal-title":"SIAM Journal on Computing"},{"key":"226_CR15","unstructured":"Lain, R. K., Chiu, D.-M., & Howe, W. (1984). A quantitative measure of fairness and discrimination for resource allocation in shared systems (DEC res. rep. TR-301)."},{"key":"226_CR16","first-page":"145","volume":"58","author":"J. E. Littlewood","year":"1929","unstructured":"Littlewood, J. E., Hardy, G. H., & P\u2019olya, G. (1929). Some simple inequalities satisfied by convex functions. Messenger Math, 58, 145\u2013152.","journal-title":"Messenger Math"},{"key":"226_CR17","volume-title":"Mathematics in science and engineering","author":"A. W. Marshal","year":"1979","unstructured":"Marshal, A. W., & Olkin, I. (1979). Inequalities: Theory of majorization and its applications. In Mathematics in science and engineering (Vol. 143). New York: Academic Press."},{"issue":"3","key":"226_CR18","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1016\/S0167-6377(97)00025-4","volume":"21","author":"C. Stein","year":"1997","unstructured":"Stein, C., & Wein, J. (1997). On the existence of schedules that are near-optimal for both makespan and total weighted completion time. Operations Research Letters, 21(3), 115\u2013122.","journal-title":"Operations Research Letters"}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-011-0226-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10951-011-0226-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-011-0226-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,2]],"date-time":"2019-06-02T09:39:45Z","timestamp":1559468385000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10951-011-0226-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,3,10]]},"references-count":18,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2013,2]]}},"alternative-id":["226"],"URL":"https:\/\/doi.org\/10.1007\/s10951-011-0226-0","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"value":"1094-6136","type":"print"},{"value":"1099-1425","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,3,10]]}}}