Author:
Fishkin Aleksei V.,Jansen Klaus,Mastrolilli Monaldo
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computer Science Applications,General Computer Science
Reference24 articles.
1. Amoura, A., Bampis, E., Kenyon, C., Manoussakis, Y.: Scheduling independent multiprocessor tasks. Algorithmica 32, 247–261 (2002)
2. Chen, J., Miranda, A.: A polynomial time approximation scheme for general multiprocessor job scheduling. SIAM J. Comput. 31, 1–17 (2001)
3. Garey, M.R., Johnson, D.S.: Computers and Intractability; a Guide to the Theory of NP-Completeness. Freeman, New York (1979)
4. Goldberg, L., Paterson, M., Srinivasan, A., Sweedyk, E.: Better approximation guarantees for job-shop scheduling. SIAM J. Discrete Math. 14(1), 67–92 (2001)
5. Grigoriadis, M.D., Khachiyan, L.G.: Coordination complexity of parallel price-directive decomposition. Math. Oper. Res. 21, 321–340 (1996)
Cited by
12 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献