K. Aida and Y. Futakata, High-performance parallel and distributed computing for the BMIeigenvalue problem. Parallel and Distributed Processing Symposium, Proceedings International, IPDPS 2002, Abstracts and CD- ROM, pp.71-78, 2002.

K. Aida, N. Wataru, and Y. Futakata, Distributed computing with hierarchical master-worker paradigm for parallel branch and bound algorithm, CCGrid 2003. 3rd IEEE/ACM International Symposium on Cluster Computing and the Grid, 2003. Proceedings., pp.156-163, 2003.
DOI : 10.1109/CCGRID.2003.1199364

K. Anstreicher, N. Brixius, J. P. Goux, and J. Linderoth, Solving large quadratic assignment problems on computational grids, Mathematical Programming, pp.563-588, 2002.
DOI : 10.1007/s101070100255

C. A. Bohn and G. B. Lamont, Load balancing for heterogeneous clusters of PCs, Future Generation Computer Systems, vol.18, issue.3, pp.389-400, 2002.
DOI : 10.1016/S0167-739X(01)00058-9

P. Bouvry, J. C. De-kergommeaux, and D. Trystram, Efficient solutions for mapping parallel programs, European Conference on Parallel Processing, pp.379-390, 1995.
DOI : 10.1007/BFb0020479

J. Eckstein, C. A. Phillips, and W. E. Hart, Pico: An Object-Oriented Framework for Parallel Branch and Bound, Research Report, vol.40, 2000.
DOI : 10.1016/S1570-579X(01)80014-8

G. Fedak, XtremWeb : une plate-forme pour l'étude expérimentale du calcul global pair-à-pair, 2003.

R. Finkel and U. Manber, DIB---a distributed implementation of backtracking, ACM Transactions on Programming Languages and Systems, vol.9, issue.2, pp.235-256, 1987.
DOI : 10.1145/22719.24067

M. R. Garey, D. S. Johnson, and R. Sethi, The Complexity of Flowshop and Jobshop Scheduling, Mathematics of Operations Research, vol.1, issue.2, pp.117-129, 1976.
DOI : 10.1287/moor.1.2.117

A. Iamnitchi and I. Foster, A problem-specific fault-tolerance mechanism for asynchronous, distributed systems, Proceedings 2000 International Conference on Parallel Processing, pp.21-24, 2000.
DOI : 10.1109/ICPP.2000.876065

B. , L. Cun, and C. , BOB: A unified platform for implementing branch-and-bound like algorithms, Research Report, vol.9516, 1995.

R. Moe and T. Sørevik, Parallel Branch and Bound Algorithms on Internet Connected Workstations, High Performance Computing and Communcations, pp.768-775, 2005.
DOI : 10.1007/11557654_87

R. Ruiz and T. Stutzle, A Simple and Effective Iterative Greedy Algorithm for the Flowshop Scheduling Problem, Technical Report, submitted to European Journal of Operational Research, 2004.

D. Sinclair, The GST load balancing algorithm for parallel and distributed systems, International Journal of Approximate Reasoning, vol.19, issue.1-2, pp.39-56, 1998.
DOI : 10.1016/S0888-613X(98)00017-6

E. Taillard, Benchmarks for basic scheduling problems, European Journal of Operational Research, vol.64, issue.2, pp.278-285, 1993.
DOI : 10.1016/0377-2217(93)90182-M

Y. Xu, T. K. Ralphs, L. Ladányi, and M. J. Saltzman, Alps: A Framework for Implementing Parallel Tree Search Algorithms, The Proceedings of the Ninth INFORMS Computing Society Conference, 2005.
DOI : 10.1007/0-387-23529-9_21