Publisher
Springer Science and Business Media LLC
Subject
General Mathematics,Software
Reference22 articles.
1. Afrati, F., Bampis, E., Chekuri, C., Karger, D., Kenyon, C., Khanna, S., Milis, I., Queyranne, M., Skutella, M., Stein, C., Sviridenko, M.: Approximation schemes for minimizing average weighted completion time with release dates. In: FOCS ’99, pp. 32–44 (1999)
2. Afrati, F., Milis, I.: Designing PTASs for min-sum scheduling problems. Discret. Appl. Math. 154, 622–639 (2006)
3. Bruno, J., Coffman Jr., E.G., Sethi, R.: Scheduling independent tasks to reduce mean finishing time. Commun. ACM 17, 382–387 (1974)
4. Chekuri, C., Khanna, S.: A PTAS for minimizing weighted completion time on uniformly related machines. In: ICALP. Lecture Notes in Computer Science, vol. 2076, pp. 848–861 (2001)
5. Goemans, M.: Improved approximation algorithms for scheduling with release dates. In: Proceedings of 8th Symposium on Discrete Algorithms, pp. 591–598. New Orleans, Louisiana, USA (1997)
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献