On-line load balancing made simple: Greedy strikes back

Azar, 1994, Online load balancing, Theoretical Computer Science, 130, 73, 10.1016/0304-3975(94)90153-8 Y. Azar, L. Epstein, On-line load balancing of temporary tasks on identical machines, in: Proc. 5th Israeli Symposium on Theory of Computing and Systems, 1997, pp. 119–125 Azar, 1997, Online load balancing of temporary tasks, Journal of Algorithms, 22, 93, 10.1006/jagm.1995.0799 S. Albers, Better bounds for on-line scheduling, in: Proc. 29th ACM Symp. on Theory of Computing, 1997, pp. 130–139 Azar, 1995, The competitiveness of online assignments, Journal of Algorithms, 18, 221, 10.1006/jagm.1995.1008 Azar, 1998, On-line load balancing Bar-Noy, 2001, On-line load balancing in a hierarchical server topology, SIAM Journal on Computing, 31, 527, 10.1137/S0097539798346135 Braess, 1968, Ueber ein paradoxon der verkehrsplanung, Unternehmensforschung, 12, 258 Crescenzi, 2004, On-line algorithms for the channel assignment problem in cellular networks, Discrete Applied Mathematics, 137, 237, 10.1016/S0166-218X(03)00341-X Graham, 1966, Bounds for certain multiprocessor anomalies, Bell System Technical Journal, 45, 1563, 10.1002/j.1538-7305.1966.tb01709.x Graham, 1969, Bounds on multiprocessor timing anomalies, SIAM Journal on Applied Mathematics, 17, 263, 10.1137/0117039 Tardòs, 1990, Approximation algorithms for scheduling unrelated parallel machines, Mathematical Programming, 46, 259, 10.1007/BF01585745 Murchland, 1970, Braess's paradox of traffic flow, Transportation Research, 4, 391, 10.1016/0041-1647(70)90196-6 Phillips, 1998, Online load balancing and network flow, Algorithmica, 21, 245, 10.1007/PL00009214 Ma, 1997, An improved lower bound for load balancing of tasks with unknown duration, Information Processing Letters, 62, 301, 10.1016/S0020-0190(97)00085-9