G. Aggarwal, R. Motwani, and A. Zhu, The load rebalancing problem, Proceedings of the Fifteenth Annual ACM Symposium on Parallel Algorithms and Architectures, pp.258-265, 2003.

E. Anderson, J. Hall, J. Hartline, M. Hobbs, A. R. Karlin et al., An Experimental Study of Data Migration Algorithms, Proceedings of the 5th International Workshop on Algorithm Engineering, p.145, 2001.
DOI : 10.1007/3-540-44688-5_12

J. Bang-jensen and G. Gutin, Digraphs?Theory, algorithms and applications, 2002.

P. Baptiste, J. Carlier, and A. Jouglet, A Branch-and-Bound procedure to minimize total tardiness on one machine with arbitrary release dates, European Journal of Operational Research, vol.158, issue.3
DOI : 10.1016/S0377-2217(03)00378-3
URL : https://hal.archives-ouvertes.fr/hal-00357955

R. Bellman, Dynamic programming, 1957.

J. Carlier, Leprobì eme de l'ordonnancement des paiements de dettes, RAIRO?Operations Research, vol.18, issue.1, 1984.
DOI : 10.1051/ro/1984180100431
URL : http://archive.numdam.org/article/RO_1984__18_1_43_0.pdf

J. Carlier, Probì emes d'ordonnancementàordonnancement`ordonnancementà contraintes de ressources : algorithmes et complexité, of Méthodologie & Architecture des Systèmes Informatiques. Université P. et M. Curie et CNRS, 1984.

J. Carlier and P. Chrétienne, Probì emes d'ordonnancements : modélisation, complexité et algorithmes, Etudes et Recherches en Informatique. Masson, 1988.

E. G. Coffman, M. R. Garey, D. S. Johnson, and A. S. Lapaugh, Scheduling file transfers in a distributed network, Proceedings of the second annual ACM symposium on Principles of distributed computing , PODC '83, pp.254-266, 1983.
DOI : 10.1145/800221.806726

E. G. Coffman, M. R. Garey, D. S. Johnson, and A. S. Lapaugh, Scheduling File Transfers, SIAM Journal on Computing, vol.14, issue.3, 1985.
DOI : 10.1137/0214054

M. Demange and V. T. Paschos, On an approximation measure founded on the links between optimization and polynomial approximation theory, Theoretical Computer Science, vol.158, issue.1-2, pp.117-141, 1996.
DOI : 10.1016/0304-3975(95)00060-7

M. R. Garey and D. S. Johnson, Computers and intractability?A guide to the theory of N P -completeness, 1979.

B. Gavish, O. R. Liu, and . Sheng, Dynamic file migration in distributed computer systems, Communications of the ACM, vol.33, issue.2, pp.177-189, 1990.
DOI : 10.1145/75577.75583

J. Hall, J. Hartline, A. R. Karlin, J. Saia, and J. Wilkes, On algorithms for efficient data migration, Proceedings of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms, pp.620-629, 2001.

T. Ibaraki, The Power of Dominance Relations in Branch-and-Bound Algorithms, Journal of the ACM, vol.24, issue.2, pp.264-279, 1977.
DOI : 10.1145/322003.322010

H. Kellerer and U. Pferschy, Improved dynamic programming in connection with an FPTAS for the knaspack problem, Journal of Combinatorial Optimization, vol.3, issue.1, pp.59-71, 1999.
DOI : 10.1023/A:1009813105532

H. Kellerer, U. Pferschy, and D. Pisinger, Knapsack problems, 2004.
DOI : 10.1007/978-3-540-24777-7

D. E. Knuth, Sorting and searching, volume 3 of The Art of Computer Programming, 1998.

D. Pisinger, Where are the hard knapsack problems? Computers & Operations Research, pp.2271-2284, 2005.

J. C. Saia, Data migration with edge capacities and machine speeds, 2001.

R. Sirdey, J. Carlier, and D. Nace, Approximate resolution of a resourceconstrained scheduling problem, Nortel GSM Access R&D, 2005.
URL : https://hal.archives-ouvertes.fr/hal-00445528

R. Sirdey, D. Plainfossé, and J. Gauthier, A practical approach to combinatorial optimization problems encountered in the design of a high availability distributed system, Proceedings of INOC, pp.532-539, 2003.