Author:
Jansen Klaus,Land Felix,Land Kati
Publisher
Springer Berlin Heidelberg
Reference32 articles.
1. Achugbue, J.O., Chin, F.Y.: Scheduling the open shop to minimize mean flow time. SIAM Journal on Computing 11(4), 709–720 (1982)
2. Caprara, A., Kellerer, H., Pferschy, U., Pisinger, D.: Approximation algorithms for knapsack problems with cardinality constraints. European Journal of Operational Research 123(2), 333–345 (2000)
3. Chen, J., et al.: On the computational hardness based on linear FPT-reductions. Journal of Combinatorial Optimization 11, 231–247 (2006)
4. Drozdowski, M.: On The Complexity of Multiprocessor Task Scheduling. Bulletin of the Polish Academy of Sciences. Technical Sciences 43(3), 381–392 (1995)
5. Du, J., Leung, J.Y.-T.: Minimizing Mean Flow Time in Two-Machine Open Shops and Flow Shops. Journal of Algorithms 14(1), 24–44 (1993)
Cited by
12 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献