1. Ullman, J.D.: NP-complete scheduling problems. Journal of Computer and System Sciences 10(3), 384–393 (1975)
2. Garey, M., Johnson, D.: Computers and Intractability: A Guide to the Theory of NP-Completeness. WH Freeman and Co., New York (1979)
3. Casanova, H., Obertelli, G., Berman, F., Wolski, R.: The apples parameter sweep template: user-level middleware for the grid. In: Proceedings of the ACM/IEEE conference on Supercomputing, pp. 75–76 (2000)
4. Altschul, S., Gish, W., Miller, W., Myers, E., Lipman, D.: Basic local alignment search tool. Journal of Molecular Biology 215(3), 403–410 (1990)
5. Casanova, H., Legrand, A., Zagorodnov, D., Berman, F.: Using simulation to evaluate scheduling heuristics for a class of applications in grid environments. Technical Report RR-1999-46, LIP, ENS (2000)