Subject
General Engineering,General Computer Science
Reference17 articles.
1. On the complexity of mean flow time scheduling;Sethi;Mathematics of Operations Research,1977
2. Computer and intractability: a guide to the theory of NP-completeness;Garey,1979
3. Analysis of a linear programming heuristic for scheduling unrelated parallel machines;Potts;Discrete Applied Mathematics,1983
4. Bernstein D, Pinter RY, Rodeh M. Optimal scheduling of arithmetic operations in parallel with memory, The Annual ACM Symposium on Principles of Programming Languages, New York, 1985.
5. Luh PB, Hoitomt DJ, Max E. Parallel machine scheduling using Lagrangian relaxation. IEEE International Conference on Computer Integrated Manufacturing, New York, 1988. pp. 244–248.
Cited by
72 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献