Off-line temporary tasks assignment

Theoretical Computer Science - Tập 287 - Trang 419-428 - 2002
Yossi Azar1, Oded Regev1, Jiřı́ Sgall2, Gerhard J. Woeginger3
1Department of Computer Science, Tel-Aviv University, Tel-Aviv 69978, Israel
2Mathematical Inst., AS CR, Žitná 25, CZ-11567 Praha 1, Czech Republic
3Inst. für Mathematik, TU Graz, Steyrergasse 30, A-8010 Graz, Austria

Tài liệu tham khảo

Azar, 1998, On-line load balancing, 178 Y. Azar, L. Epstein, On-line load balancing of temporary tasks on identical machines, Proceedings of the 5th Israeli Symposium on Theory of Computing and Systems, 1997, pp. 119–125. Borodin, 1998 Garey, 1979 Graham, 1966, Bounds for certain multiprocessor anomalies, Bell Syst. Tech. J., 45, 1563, 10.1002/j.1538-7305.1966.tb01709.x Graham, 1969, Bounds on multiprocessing timing anomalies, SIAM J. Appl. Math., 17, 263, 10.1137/0117039 Hochbaum, 1987, Using dual approximation algorithms for scheduling problems: theoretical and practical results, J. ACM, 34, 144, 10.1145/7531.7535 Horowitz, 1976, Exact and approximate algorithms for scheduling non-identical processors, J. ACM, 23, 317, 10.1145/321941.321951 Karp, 1972, Reducibility among combinatorial problems Lenstra, 1990, Approximation algorithms for scheduling unrelated parallel machines, Math. Program., 46, 259, 10.1007/BF01585745 Sahni, 1976, Algorithms for scheduling independent tasks, J. Assoc. Comput. Mach., 23, 116, 10.1145/321921.321934