Author:
Jagtenberg Caroline,Schwiegelshohn Uwe,Uetz Marc
Publisher
Springer Berlin Heidelberg
Reference13 articles.
1. Bruno, J.L., Downey, P.J., Frederickson, G.N.: Sequencing tasks with exponential service times to minimize the expected flowtime or makespan. Journal of the ACM 28, 100–113 (1981)
2. Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman, New York (1979)
3. Graham, R.L., Lawler, E.L., Lenstra, J.K., Rinnooy Kan, A.H.G.: Optimization and approximation in deterministic sequencing and scheduling: A survey. Annals of Discrete Mathematics 5, 287–326 (1979)
4. Kämpke, T.: On the optimality of static priority policies in stochastic scheduling on parallel machines. Journal of Applied Probability 24, 430–448 (1987)
5. Kawaguchi, T., Kyan, S.: Worst case bound on an LRF schedule for the mean weighted flow-time problem. SIAM Journal on Computing 15, 1119–1129 (1986)
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献