Publisher
Springer Science and Business Media LLC
Subject
Management Science and Operations Research,General Mathematics,Software
Reference65 articles.
1. Aho, A., J. Hopcroft, andJ. Ullman: The Design and Analysis for Computer Algorithms. Reading, Mass. 1974.
2. Brucker, P.: NP-vollständige Operations Research Probleme. Graphen, Algorithmen, Datenstrukturen. Ed. by H. Noltemeier. München 1976.
3. -: On the Complexity of Clustering Problems. Optimization and Operations Research. Ed. by R. Henn, B. Korte, and W. Oettli. Berlin 1978.
4. Brucker, P., M. Garey, andD. Johnson: Scheduling Equal Length Tasks under Tree Like Precedence Constraints to Minimize Maximum Lateness. Math. of Operations Research2, 1977, 275–284. 275–284.
5. Bruno, J., E.G. Coffman Jr., andR. Sethi: Scheduling Independent Tasks to Recue Mean Finishing-Time. Comm. ACM17, 1974, 504–510.
Cited by
8 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献