Author:
Angel Eric,Bampis Evripidis,Kononov Alexander
Subject
General Computer Science,Theoretical Computer Science
Reference22 articles.
1. E. Angel, E. Bampis, A. Kononov, A FPTAS for approximating the unrelated parallel machines scheduling problem with costs, in: Proc. European Symp. on Algorithms (ESA) 2001, Springer, Berlin, 2001, pp. 194–205.
2. J.A. Aslam, A. Rasala, C. Stein, N.E. Young, Improved bicriteria existence theorems for scheduling, in: SODA 1999, Baltimore, Maryland, USA, pp. 846–847.
3. Scheduling a batching machine;Brucker;J. Scheduling,1998
4. Scheduling independents tasks to reduce mean finishing time;Bruno;Comm. of the ACM,1974
5. B. Chen, C.N. Potts, G.J. Woeginger, A review of machine scheduling: complexity, algorithms and approximability, Report Woe-29, TU Graz, 1998.
Cited by
34 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献