Author:
Albers Susanne,Hellwig Matthias
Funder
Deutsche Forschungsgemeinschaft
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computer Science Applications,General Computer Science
Reference40 articles.
1. Albers, S.: Better bounds for online scheduling. SIAM J. Comput. 29, 459–473 (1999)
2. Albers, S., Hellwig, M.: On the value of job migration in online makespan minimization. In: Proceedings of the 20th Annual European Symposium on Algorithms, Springer LNCS 7501, pp. 84–95 (2012)
3. Angelelli, E., Nagy, A.B., Speranza, M.G., Tuza, Z.: The on-line multiprocessor scheduling problem with known sum of the tasks. J. Sched. 7, 421–428 (2004)
4. Angelelli, E., Speranza, M.G., Tuza, Z.: Semi-on-line scheduling on two parallel processors with an upper bound on the items. Algorithmica 37, 243–262 (2003)
5. Angelelli, E., Speranza, M.G., Tuza, Z.: New bounds and algorithms for on-line scheduling: two identical processors, known sum and upper bound on the tasks. Discrete Math. Theor. Comput. Sci. 8, 1–16 (2006)
Cited by
16 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献