. Acar, A. Umut, A. Acar, M. Chargueraud, and . Rainey, Scheduling Parallel Programs by Work Stealing with Private Deques, Proc. of the 18 th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, PPoPP '13, pp.219-228, 2013.
URL : https://hal.archives-ouvertes.fr/hal-00863028

]. A. Allahverdi, J. N. Gupta, and T. Aldowaisan, A review of scheduling research involving setup considerations, Omega, vol.27, issue.2, pp.219-239, 1999.
DOI : 10.1016/S0305-0483(98)00042-5

]. R. Allen, L. Cinque, S. Tanimoto, L. Shapiro, and D. Yasuda, A parallel algorithm for graph matching and its MasPar implementation, IEEE Transactions on Parallel and Distributed Systems, vol.8, issue.5, pp.490-501, 1997.
DOI : 10.1109/71.598276

]. D. Bader, W. E. Hart, and C. A. Phillips, Parallel Algorithm Design for Branch and Bound, pp.5-6, 2005.
DOI : 10.1007/0-387-22827-6_5

]. L. Barreto and M. Bauer, Parallel Branch and Bound Algorithm - A comparison between serial, OpenMP and MPI implementations, Journal of Physics: Conference Series, p.12018, 2010.
DOI : 10.1088/1742-6596/256/1/012018

]. M. Bonney and S. W. Gundry, Solutions to the constrained flowshop sequencing problem, Operational Research Quarterly, p.869, 1976.

]. T. Carneiro, A. Muritiba, M. Negreiros, and G. A. Lima-de-campos, A New Parallel Schema for Branch-and-Bound Algorithms Using GPGPU, 2011 23rd International Symposium on Computer Architecture and High Performance Computing, 2011.
DOI : 10.1109/SBAC-PAD.2011.20

]. L. Casado, J. A. Martinez, I. Garcia, and E. Hendrix, Branch-and-Bound interval global optimization on shared memory multiprocessors, Optimization Methods and Software, vol.23, issue.5, pp.689-701, 2008.
DOI : 10.1080/10556780802086300

]. I. Chakroun, N. Melab, M. Mezmaz, and D. Tuyttens, Combining multi-core and GPU computing for solving combinatorial optimization problems, Journal of Parallel and Distributed Computing, vol.73, issue.12, pp.1563-1577, 2013.
DOI : 10.1016/j.jpdc.2013.07.023
URL : https://hal.archives-ouvertes.fr/hal-00935890

]. I. Chakroun, M. Mezmaz, N. Melab, and A. Bendjoudi, Reducing thread divergence in a GPU-accelerated branch-and-bound algorithm, Concurrency and Computation: Practice and Experience, vol.1, issue.1, pp.1121-1136, 2013.
DOI : 10.1002/cpe.2931
URL : https://hal.archives-ouvertes.fr/hal-00846004

]. S. Climer and W. Zhang, Cut-and-Solve: an Iterative Search Strategy for Combinatorial Optimization Problems, Artificial Intelligence, pp.714-738, 2006.

]. V. Cung, S. Dowaji, B. Le-cun, T. Mautor, and C. , Parallel and Distributed Branch-and-Bound/A* Algorithms, Laboratoire PRISM, 1994.

]. S. Dowaji and C. , Load balancing strategy and priority of tasks in distributed environments, Proceedings International Phoenix Conference on Computers and Communications, pp.15-22, 1995.
DOI : 10.1109/PCCC.1995.472518

]. M. 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

R. Michael, . Garey, S. David, and . Johnson, Computers and intractability: a guide to the theory of NP-completeness, 1979.

]. B. Gendron and T. G. Crainic, Parallel Branch-and-Branch Algorithms: Survey and Synthesis, Operations Research, vol.42, issue.6, pp.1042-1066, 1994.
DOI : 10.1287/opre.42.6.1042

]. B. Goldengorin, D. Ghosh, and G. Sierksma, Branch and peg algorithms for the simple plant location problem, Computers & Operations Research, vol.31, issue.2, pp.241-255, 2004.
DOI : 10.1016/S0305-0548(02)00190-9

]. S. Golomb, Run-length encodings (Corresp.) Information Theory, IEEE Transactions on, vol.12, issue.3, pp.399-401, 1966.

]. S. Hejazi and S. Saghafian, Flowshop-scheduling problems with makespan criterion: a review, International Journal of Production Research, vol.44, issue.14, pp.2895-2929, 2005.
DOI : 10.1016/0377-2217(94)00021-4

]. V. Janakiram, D. P. Agrawal, and R. Mehrotra, A randomized parallel branch-and-bound algorithm, Proc. of Int. Conf. on Parallel Processing, pp.69-75, 1988.
DOI : 10.1007/BF02427853

]. S. Johnson, Optimal two- and three-stage production schedules with setup times included, Naval Research Logistics Quarterly, vol.1, issue.1, pp.61-68, 1954.
DOI : 10.1002/nav.3800010110

]. J. King and A. S. Spachis, Heuristics for flow-shop scheduling, International Journal of Production Research, vol.20, issue.3, pp.345-357, 1980.
DOI : 10.1080/00207548008919673

E. Donald and . Knuth, The Art of Computer Programming, Seminumerical Algorithms, vol.2, 1998.

C. Tjalling, M. Koopmans, and . Beckmann, Assignment problems and the location of economic activities, Econometrica: journal of the Econometric Society, pp.53-76, 1957.

]. V. Kumar and L. Kanal, Parallel Branch-and-Bound Formulations for AND/OR Tree Search, IEEE Transactions on Pattern Analysis and Machine Intelligence, vol.6, issue.6, pp.768-778, 1984.
DOI : 10.1109/TPAMI.1984.4767600

C. Laisant, Sur la num??ration factorielle, application aux permutations, Bulletin de la Société mathématique de France, vol.2, pp.176-183, 1888.
DOI : 10.24033/bsmf.378

]. M. Lalami, Contribution à la résolution de problèms d'optimisation combinatoire: méthodes séquentielles et parallèles, 2012.

L. Eugene and . Lawler, The Quadratic Assignment Problem, Management Science, vol.9, issue.4, pp.586-599, 1963.

]. D. Lehmer, Teaching combinatorial tricks to a computer, Proc. Sympos, 1960.
DOI : 10.1090/psapm/010/0113289

]. J. Lenstra, B. J. Lageweg, and A. H. Kan, A General bounding scheme for the permutation flow-shop problem, Operations Research, vol.26, issue.1, pp.53-67, 1978.

M. Loiola, N. M. Maia-de-abreu, P. O. Boaventura-netto, P. Hahn, and T. Querido, A survey for the quadratic assignment problem, European Journal of Operational Research, vol.176, issue.2, pp.657-690, 2007.
DOI : 10.1016/j.ejor.2005.09.032

]. T. Luong, Métaheuristiques parallèles sur GPU, 2011.

]. T. Mautor and C. , A new exact algorithm for the solution of quadratic assignment problems, Discrete Applied Mathematics, vol.55, issue.3, pp.281-293, 1994.
DOI : 10.1016/0166-218X(94)90014-0

M. Thierry and C. Roucairol, Difficulties of exact methods for solving the quadratic assignment problem, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol.16, pp.263-274, 1994.

M. Mehdi, Parallel hybrid optimization methods for permutation based problems, 2011.
URL : https://hal.archives-ouvertes.fr/tel-00841962

N. Melab, I. Chakroun, M. Mezmaz, and D. Tuyttens, A GPU-accelerated Branch-and-Bound Algorithm for the Flow-Shop Scheduling Problem, 2012 IEEE International Conference on Cluster Computing, pp.10-17, 2012.
DOI : 10.1109/CLUSTER.2012.18
URL : https://hal.archives-ouvertes.fr/hal-00723736

]. M. Mezmaz, N. Melab, and E. Talbi, An efficient load balancing strategy for grid-based branch and bound algorithm, Parallel Computing, vol.33, issue.4-5, pp.4-5, 2007.
DOI : 10.1016/j.parco.2007.02.004
URL : https://hal.archives-ouvertes.fr/hal-00684607

]. M. Mezmaz, N. Melab, and E. Talbi, A Grid-enabled Branch and Bound Algorithm for Solving Challenging Combinatorial Optimization Problems, 2007 IEEE International Parallel and Distributed Processing Symposium, 2007.
DOI : 10.1109/IPDPS.2007.370217
URL : https://hal.archives-ouvertes.fr/inria-00083814

]. D. Miller and J. F. Pekny, Commentary???The Role of Performance Metrics for Parallel Mathematical Programming Algorithms, ORSA Journal on Computing, vol.5, issue.1, pp.26-28, 1993.
DOI : 10.1287/ijoc.5.1.26

]. R. Pastor and A. Corominas, Branch and win: OR tree search algorithms for solving combinatorial optimisation problems, Top, vol.41, issue.1, pp.169-192, 2004.
DOI : 10.1007/BF02578930

I. R. Schaefer, C. Cotta, J. Ko?odziej, and G. Rudolph, Parallel Problem Solving from Nature, PPSN XI, Lecture Notes in Computer Science, vol.6239, pp.250-259, 2010.

]. J. Quinn, Analysis and implementation of branch-and-bound algorithms on a hypercube multicomputer, IEEE Transactions on Computers, vol.39, issue.3, pp.384-387, 1990.
DOI : 10.1109/12.48868

]. 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

]. S. Tschöke, R. Lüling, and B. Monien, Solving the traveling salesman problem with a distributed branch-and-bound algorithm on a 1024 processor network, Proceedings of 9th International Parallel Processing Symposium, 1995.
DOI : 10.1109/IPPS.1995.395930

]. Vu, Heterogeneity and locality-aware work stealing for large scale Branch-and-Bound irregular algorithms, 2014.

I. Publications, C. Papers, @. M. Mezmaz, R. Leroy, N. Melab et al., A Multi-Core Parallel Branch-and- Bound Algorithm Using Factorial Number System, Proc. of IEEE IPDPS, pp.1203-1212, 2014.

@. R. Leroy, M. Mezmaz, N. Melab, and D. Tuyttens, Work Stealing Strategies For Multi-Core Parallel Branch-and-Bound Algorithm Using Factorial Number System, Proceedings of Programming Models and Applications on Multicores and Manycores, PMAM'14, 2014.
DOI : 10.1145/2578948.2560694
URL : https://hal.archives-ouvertes.fr/hal-01095213

@. N. Melab, R. Leroy, M. Mezmaz, and D. Tuyttens, Parallel Branch-and-Bound using private IVM-based work stealing on Xeon Phi MIC coprocessor, 2015 International Conference on High Performance Computing & Simulation (HPCS), pp.394-399, 2015.
DOI : 10.1109/HPCSim.2015.7237067
URL : https://hal.archives-ouvertes.fr/hal-01248335

@. R. Leroy, M. Mezmaz, N. Melab, and D. Tuyttens, Using Factorial Number System to Solve Permutation Optimization Problems, 28 th Annual Conference of the Belgian Operational Research Society, 2014.

@. R. Journal-paper-under-minor-revision, J. Leroy, M. Gmys, N. Mezmaz, D. Melab et al., Work Stealing with Private Integer-Vector-Matrix Data Structure for Multi-core Branch-and-Bound Algorithms. Concurrency and Computation: Practice and Experience, 2015.

@. N. To-be-submitted, J. Melab, R. Gmys, M. Leroy, D. Mezmaz et al., Many-core Branch-and- Bound for GPU accelerators and MIC coprocessors