K. R. Baker, Introduction to Sequencing and Scheduling, 1974.

K. R. Baker, E. L. Lawler, J. K. Lenstra, and A. H. Rinnooy-kan, Preemptive scheduling of a single machine to minimize maximum cost subject to release dates and precedence constraints, Operations Research, vol.31, issue.2, pp.381-386, 1983.

P. Baptiste, P. Brucker, M. Chrobak, C. Dürr, S. A. Kravchenko et al., The complexity of mean flow time scheduling problems with release times, Journal of Scheduling, vol.10, issue.2, pp.139-146, 2007.
URL : https://hal.archives-ouvertes.fr/inria-00123665

M. A. Bender, New Algorithms and Metrics for Scheduling, 1998.

M. A. Bender, S. Chakrabarti, and S. Muthukrishnan, Flow and stretch metrics for scheduling continuous job streams, Proceedings of the 9th Annual ACM-SIAM Symposium On Discrete Algorithms (SODA'98), pp.270-279, 1998.

M. A. Bender, S. Muthukrishnan, and R. Rajaraman, Improved algorithms for stretch scheduling, SODA '02: Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms, pp.762-771, 2002.

M. A. Bender, S. Muthukrishnan, and R. Rajaraman, Approximation algorithms for average stretch scheduling, J. of Scheduling, vol.7, issue.3, pp.195-222, 2004.

D. Bertsekas and R. Gallager, Data Networks, 1987.

V. Bharadwaj, D. Ghose, V. Mani, and T. G. Robertazzi, Scheduling Divisible Loads in Parallel and Distributed Systems, 1996.

C. Blanchet, C. Combet, C. Geourjon, and G. Deléage, MPSA: Integrated System for Multiple Protein Sequence Analysis with client/server capabilities, Bioinformatics, vol.16, issue.3, pp.286-287, 2000.
URL : https://hal.archives-ouvertes.fr/hal-00313794

J. Blazewicz, K. H. Ecker, E. Pesch, G. Schmidt, and J. Weglarz, Handbook on Scheduling: From Theory to Applications. International Handbooks on Information Systems, 2007.

J. Blazewicz, Scheduling dependent tasks with different arrival times to meet deadlines, Proceedings of the International Workshop, pp.57-65, 1976.

R. C. Braun, K. T. Pedretti, T. L. Casavant, T. E. Scheetz, C. L. Birkett et al., Parallelization of local BLAST service on workstation clusters, Future Generation Computer Systems, vol.17, issue.6, pp.745-754, 2001.

C. Chekuri and S. Khanna, Approximation schemes for preemptive weighted flow time, Proceedings of the thiry-fourth annual ACM symposium on Theory of computing, pp.297-305, 2002.

A. E. Darling, L. Carey, and . Wu-chun-feng, The Design, Implementation, and Evaluation of mpiBLAST, Proceedings of ClusterWorld, 2003.

M. L. Dertouzos, Control robotics: the procedural control of physical processes, Proceedings of IFIP Congress, pp.897-813, 1974.

M. Protasi, G. Ausiello, and A. , Structure preserving reductions among convex optimization problems, Journal of Computer and System Sciences, vol.21, issue.1, pp.136-153, 1980.

M. R. Garey and D. S. Johnson, Computers and Intractability, a Guide to the Theory of NP-Completeness, 1991.

T. Gonzalez and S. Sahni, Open shop scheduling to minimize finish time, J. ACM, vol.23, issue.4, pp.665-679, 1976.

, GriPPS, 2005.

D. S. Johnson, Approximation algorithms for combinatorial problems, Journal of Computer and System Sciences, vol.9, pp.256-278, 1974.

J. Labetoulle, E. L. Lawler, J. K. Lenstra, and A. H. Rinnooy-kan, Preemptive scheduling of uniform machines subject to release dates, Progress in Combinatorial Optimization, pp.245-261, 1984.

E. L. Lawler and J. Labetoulle, On preemptive scheduling of unrelated parallel processors by linear programming, Journal of the Association for Computing Machinery, vol.25, issue.4, pp.612-619, 1978.

A. Legrand, L. Marchal, and H. Casanova, Scheduling Distributed Applications: The SimGrid Simulation Framework, Proceedings of the 3rd IEEE Symposium on Cluster Computing and the Grid, 2003.
URL : https://hal.archives-ouvertes.fr/hal-00789451

A. Legrand, A. Su, and F. Vivien, Off-line scheduling of divisible requests on an heterogeneous collection of databanks, Research report, vol.5386, 2004.
URL : https://hal.archives-ouvertes.fr/hal-00789443

A. Legrand, A. Su, and F. Vivien, Off-line scheduling of divisible requests on an heterogeneous collection of databanks, Proceedings of the 14th Heterogeneous Computing Workshop, 2005.
URL : https://hal.archives-ouvertes.fr/hal-00789443

A. Legrand, A. Su, and F. Vivien, Minimizing the stretch when scheduling flows of biological requests, Symposium on Parallelism in Algorithms and Architectures SPAA'2006, 2006.
URL : https://hal.archives-ouvertes.fr/inria-00070293

A. Legrand, A. Su, and F. Vivien, Minimizing the stretch when scheduling flows of divisible requests, Also available as INRIA research report, vol.6002, 2008.
URL : https://hal.archives-ouvertes.fr/hal-02102657

J. K. Lenstra, A. H. Rinnooy-kan, and P. Brucker, Complexity of machine scheduling problems, Annals of Discrete Mathematics, vol.1, pp.343-362, 1977.

L. Massoulié and J. Roberts, Bandwidth sharing: Objectives and algorithms, Transactions on Networking, vol.10, issue.3, pp.320-328, 2002.

N. Megow, Performance analysis of on-line algorithms in machine scheduling, Diplomarbeit, 2002.

P. L. Miller, M. Prakash, N. M. Nadkarni, and . Carriero, Parallel computation and FASTA: confronting the problem of parallel database search for a fast sequence comparison algorithm, Computer Applications in the Biosciences, vol.7, issue.1, pp.71-78, 1991.

S. Muthukrishnan, R. Rajaraman, A. Shaheen, and J. Gehrke, Online scheduling to minimize average stretch, IEEE Symposium on Foundations of Computer Science, pp.433-442, 1999.

A. S. Schulz and M. Skutella, The power of ?-points in preemptive single machine scheduling, Journal of Scheduling, vol.5, issue.2, pp.121-133, 2002.

R. Sitters, Complexity of preemptive minsum scheduling on unrelated parallel machines, Journal of Algorithms, vol.57, issue.1, pp.37-48, 2005.

P. Slavík, A tight analysis of the greedy algorithm for set cover, STOC '96: Proceedings of the twenty-eighth annual ACM symposium on Theory of computing, pp.435-441, 1996.

W. E. Smith, Various optimizers for single-stage production, Naval Research Logistics Quarterly, vol.3, pp.59-66, 1956.