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. Carlier, Leprobì eme de l'ordonnancement des paiements de dettes, RAIRO?Operations Research, vol.18, 1984.
DOI : 10.1051/ro/1984180100431
URL : http://archive.numdam.org/article/RO_1984__18_1_43_0.pdf

T. Christof and G. Reinelt, Algorithmic Aspects of Using Small Instance Relaxations in Parallel Branch-and-Cut, Algorithmica, vol.30, issue.4, 1998.
DOI : 10.1007/s00453-001-0029-3

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

P. C. Fishburn, Induced binary probabilities and the linear ordering polytope: a status report, Mathematical Social Sciences, vol.23, issue.1, pp.67-80, 1992.
DOI : 10.1016/0165-4896(92)90038-7

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

M. Grötschel, M. Jünger, and G. Reinelt, A Cutting Plane Algorithm for the Linear Ordering Problem, Operations Research, vol.32, issue.6, pp.1195-1220, 1984.
DOI : 10.1287/opre.32.6.1195

M. Grötschel, M. Jünger, and G. Reinelt, Facets of the linear ordering polytope, Mathematical Programming, pp.43-60, 1985.
DOI : 10.1007/BF01582010

M. Grötschel, M. Jünger, and G. Reinelt, On the acyclic subgraph polytope, Mathematical Programming, pp.28-42, 1985.
DOI : 10.1007/BF01582009

M. Grötschel, L. Lovász, and A. Schrijver, Geometric algorithms and combinatorial optimization, Algorithms and Combinatorics, vol.2, 1988.

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.

P. Jalote, Fault tolerance in distributed systems. Distributed Systems, 1994.

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

H. Kerivin and R. Sirdey, Polyhedral combinatorics of a resourceconstrained ordering problem part II: on the process move program polytope, 2006.

J. E. Mitchell and B. Borchers, Solving Linear Ordering Problems with a Combined Interior Point/Simplex Cutting Plane Algorithm, High performance optimization, pp.349-366, 2000.
DOI : 10.1007/978-1-4757-3216-0_14

M. Queyranne and A. S. Schulz, Polyhedral approaches to machine scheduling, 1994.

G. Reinelt, The linear ordering problem: algorithms and applications, volume 8 of Research and exposition in mathematics, 1985.

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

R. Sirdey, J. Carlier, H. Kerivin, and D. Nace, On a resource-constrained scheduling problem with application to distributed systems reconfiguration, European Journal of Operational Research, vol.183, issue.2, pp.546-563, 2007.
DOI : 10.1016/j.ejor.2006.10.011
URL : https://hal.archives-ouvertes.fr/inria-00311377

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

R. Sirdey, J. Carlier, and D. Nace, A fast heuristic for a resource-constrained scheduling problem, 2005.

R. Sirdey and H. Kerivin, Polyhedral combinatorics of a resourceconstrained ordering problem part I: on the partial linear ordering polytope, 2006.

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 the International Network Optimization Conference, pp.532-539, 2003.