E. Alba and B. Dorronsoro, Cellular genetic algorithms, vol.42, 2008.

E. Alba, G. Luque, and S. Nesmachnow, Parallel metaheuristics: recent advances and new trends, International Transactions in Operational Research, vol.20, issue.1, pp.1-48, 2013.

H. Bai, D. Ouyang, X. Li, L. He, and H. Yu, MAX-MIN Ant System on GPU with CUDA, Fourth International Conference on Innovative Computing, Information and Control, pp.801-804, 2009.

R. Bellman, Dynamic Programming, 1957.

M. Benhamadou, On the simplex algorithm 'revised form, Advances in Engineering Software, vol.33, issue.11, pp.769-777, 2002.

J. Bieling, P. Peschlow, and P. Martini, An efficient GPU implementation of the revised simplex method, 24th IEEE International Parallel Distributed Processing Symposium, Workshops and Phd Forum, pp.1-8, 2010.

A. Boukedjar, M. Lalami, and D. El-baz, Parallel branch and bound on a CPU-GPU system, 20th International Conference on Parallel, Distributed and network-based Processing, pp.392-398, 2012.
URL : https://hal.archives-ouvertes.fr/hal-01152948

V. Boyer, D. El-baz, and M. Elkihel, Dense dynamic programming on multi GPU, 19th International Conference on Parallel, Distributed and network-based Processing, pp.545-551, 2011.
URL : https://hal.archives-ouvertes.fr/hal-01152683

V. Boyer, D. El-baz, and M. Elkihel, Solving knapsack problems on GPU, Computers and Operations Research, vol.39, issue.1, pp.42-47, 2012.
URL : https://hal.archives-ouvertes.fr/hal-01152223

W. Bo?-zejko, Solving the flow shop problem by parallel programming, Journal of parallel and distributed computing, vol.69, issue.5, pp.470-481, 2009.

A. R. Brodtkorb, T. R. Hagen, C. Schulz, and G. Hasle, GPU computing in discrete optimization. Part I: Introduction to the GPU, EURO Journal on Transportation and Logistics, pp.1-29, 2013.

L. Bukata, P. S?cha, and Z. Hanzálek, Solving the resource constrained project scheduling problem using the parallel tabu search designed for the {CUDA} platform, Journal of Parallel and Distributed Computing, vol.77, issue.0, pp.58-68, 2015.

L. Bukata and P. Sucha, A GPU algorithm design for resource constrained scheduling problem, 21st Conference on Parallel, Distributed and networked-based Processing (PDP), pp.367-374, 2013.

T. Carneiro, A. E. Muritiba, M. Negreiros, and G. A. Lima-de-campos, A new parallel schema for branch-and-bound algorithms using gpgpu, Computer Architecture and High Performance Computing (SBAC-PAD), pp.41-47, 2011.

A. Catala, J. Jaen, and J. Modioli, Strategies for accelerating ant colony optimization algorithms on graphical processing units, IEEE Congress on Evolutionary Computation, pp.492-500, 2007.

J. Cecilia, J. Garcia, M. Ujaldon, A. Nisbet, and M. Amos, Parallelization strategies for ant colony optimisation on GPUs, 25th IEEE International Parallel and Distributed Processing Symposium, Workshops and Phd Forum, pp.339-346, 2011.

I. Chakroun and N. Melab, An adaptative multi-GPU based branch-andbound. a case study: the flow-shop scheduling problem, IEEE 14th International Conference on High Performance Computing and Communication and 2012 IEEE 9th International Conference on Embedded Software and Systems (HPCC-ICESS), pp.389-395, 2012.

V. Boyer,

I. Chakroun, N. Melab, M. Mezmaz, and D. Tuyttens, Combining multicore and gpu computing for solving combinatorial optimization problems, Journal of Parallel and Distributed Computing, vol.73, issue.12, pp.1563-1577, 2013.
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.25, issue.8, pp.1121-1136, 2012.
URL : https://hal.archives-ouvertes.fr/hal-00731859

S. Chen, S. Davis, H. Jiang, A. , and N. , CUDA-based genetic algorithm on traveling salesman problem, Computers and Information Science, pp.241-252, 2011.

M. Czapi´nskiczapi´nski and S. Barnes, Tabu Search with two approaches to parallel flow shop evaluation on CUDA platform, Journal of Parallel and Distributed Computing, vol.71, pp.802-811, 2011.

G. Dantzig, Maximization of a linear function of variables subject to linear inequalities, Activity Analysis of Production and Allocation, pp.339-347, 1951.

G. B. Dantzig and W. Orchard-hays, The product form for the inverse in the simplex method. Mathematical Tables and Other Aids to Computation, pp.64-67, 1954.

A. Delévacq, P. Delisle, M. Gravel, and M. Krajecki, Parallel ant colony optimization on graphics processing units, Journal of Parallel and Distributed Computing, vol.73, issue.1, pp.52-61, 2013.

M. Dorigo, M. Birattari, and T. Stützle, Ant colony optimization. Computational Intelligence Magazine, IEEE, vol.1, issue.4, pp.28-39, 2006.

J. Fu, L. Lei, and G. Zhou, A parallel ant colony optimization algorithm with GPU-acceleration based on all-in-roulette selection, Third International Workshop on Advanced Computational Intelligence (IWACI 2010), pp.260-264, 2010.

R. S. Garfinkel and G. L. Nemhauser, Integer programming, vol.4, 1972.

F. Glover, Tabu search -part i, ORSA Journal on computing, vol.1, issue.3, pp.190-206, 1989.

F. Glover, Tabu search -part ii, ORSA Journal on computing, vol.2, issue.1, pp.4-32, 1990.

D. Goldfarb and J. Reid, A practicable steepest-edge simplex algorithm, Mathematical Programming, vol.12, issue.1, pp.361-371, 1977.

G. Greeff, The revised simplex algorithm on a GPU, Univ. of Stellenbosch, 2005.

M. Harris, S. Sengupta, and J. D. Owens, Parallel prefix sum (scan) with CUDA, GPU gems, vol.3, issue.39, pp.851-876, 2007.

O. H. Ibarra and C. E. Kim, Heuristic algorithms for scheduling independent tasks on nonidentical processors, Journal of the ACM, vol.24, issue.2, pp.280-289, 1977.

A. Janiak, W. Janiak, and M. Lichtenstein, Tabu Search on GPU. Journal of Universal Computer Science, vol.14, issue.14, pp.2416-2427, 2008.

W. Jiening, D. Jiankang, and Z. Chunfeng, Implementation of ant colony algorithm based on GPU, Sixth International Conference on Computer Graphics, Imaging and Visualization, pp.50-53, 2009.

J. Jung and D. O'leary, Implementing an interior point method for linear programs on a CPU-GPU system, Electronic Transactions on Numerical Analysis, vol.28, pp.174-189, 2008.

N. A. Kallioras, K. Kepaptsoglou, and N. D. Lagaros, Transit stop inspection and maintenance scheduling: A gpu accelerated metaheuristics approach, Transportation Research Part C: Emerging Technologies, vol.55, pp.246-260, 2015.

H. Kung, Why systolic architectures?, IEEE computer, vol.15, issue.1, pp.37-46, 1982.

H. Kung and C. E. Leiserson, Systolic arrays (for vlsi), Sparse Matrix Proceedings, pp.256-282, 1978.

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

M. Lalami, ContributionàContributionà la résolution deprobì emes d'optimisation combinatoire : méthodes séquentielles etparalì eles, 2012.

M. Lalami, V. Boyer, and D. El-baz, Efficient implementation of the simplex method on a CPU-GPU system, 25th IEEE International Parallel and Distributed Processing Symposium, Workshops and Phd Forum (IPDPSW), Workshop PCO'11, pp.1999-2006, 2011.
URL : https://hal.archives-ouvertes.fr/hal-01151614

M. Lalami and D. El-baz, GPU implementation of the branch and bound method for knapsack problems, 26th IEEE International Parallel and Distributed Processing Symposium, Workshops and PhD Forum (IPDPSW), Workshop PCO'12, pp.1769-1777, 2012.
URL : https://hal.archives-ouvertes.fr/hal-01149777

M. Lalami, D. El-baz, and V. Boyer, Multi GPU implementation of the simplex algorithm, 13th IEEE International Conference on High Performance Computing and Communications, pp.179-186, 2011.
URL : https://hal.archives-ouvertes.fr/hal-01149739

G. Laporte and S. Martello, The selective travelling salesman problem, Discrete Applied Mathematics, vol.26, issue.2, pp.193-207, 1990.

J. Li, X. Hu, Z. Pang, and K. Qian, A parallel ant colony optimization algorithm based on fine-grained model with GPU-acceleration, International Journal of Innovative Computing, Information and Control, vol.5, issue.11, pp.3707-3716, 2009.

J. Li, L. Zhang, and L. Liu, A parallel immune algorithm based on finegrained model with gpu-acceleration, 2009 Fourth International Conference on Innovative Computing, Information and Control (ICICIC), pp.683-686, 2009.

T. Luong, Métaheuristiquesparalì eles sur GPU, Université Lille 1, 2011.

T. V. Luong, Métaheuristiquesparalì eles sur GPU, Université Lille 1 -Sciences et Technologies, 2011.

T. V. Luong, N. Melab, and E. Talbi, GPU-based approaches for multiobjective local search algorithms. a case study: the flowshop scheduling problem, Evolutionary Computation in Combinatorial Optimization, pp.155-166, 2011.
URL : https://hal.archives-ouvertes.fr/inria-00638811

S. Martello and P. Toth, Knapsack problems: algorithms and computer implementations, 1990.

N. Melab, I. Chakroun, M. Mezmaz, and D. Tuyttens, A GPUaccelerated branch-and-bound algorithm for the flow-shop scheduling problem, 2012 IEEE International Conference on Cluster Computing (CLUS-TER), pp.10-17, 2012.
URL : https://hal.archives-ouvertes.fr/hal-00723736

X. Meyer, P. Albuquerque, and B. Chopard, A multi-GPU implementation and performance model for the standard simplex method, Euro-Par, pp.312-319, 2011.

M. Moz and M. V. Pato, A genetic algorithm approach to a nurse rerostering problem, Computers & Operations Research, vol.34, issue.3, pp.667-691, 2007.

A. Naiem and M. El-beltagy, Deep greedy switching: A fast and simple approach for linear assignment problems, 7th International Conference of Numerical Analysis and Applied Mathematics, 2009.

H. Nguyen, GPU GEMS 3, 2008.

P. Nikolaos and S. Nikolaos, A computational comparison of basis updating schemes for the simplex algorithm on a cpu-gpu system, Operations Research and Management Science, vol.3, pp.633-654, 2006.

I. H. Osman and G. Laporte, Metaheuristics: A bibliography, Annals of Operations Research, vol.63, issue.5, pp.511-623, 1996.

L. Paquete and T. Stützle, Stochastic local search algorithms for multiobjective combinatorial optimization: A review, 2006.

M. Pedemonte, E. Alba, and F. Luna, Towards the design of systolic genetic search, 26th IEEE International Parallel and Distributed Processing Symposium, Workshops and PhD Forum, pp.1778-1786, 2012.

M. L. Pinedo, Scheduling: theory, algorithms, and systems, 2012.

F. Pinel, B. Dorronsoro, and P. Bouvry, A new cellular genetic algorithm to solve the scheduling problem designed for the gpu, Metaheuristics Conference (META), 2010.

F. Pinel, B. Dorronsoro, and P. Bouvry, Solving very large instances of the scheduling of independent tasks problem on the GPU, Journal of Parallel and Distributed Computing, vol.73, issue.1, pp.101-110, 2013.

N. Ploskas and N. Samaras, Efficient GPU-based implementations of simplex type algorithms, Applied Mathematics and Computation, vol.250, pp.552-570, 2015.

G. Reinelt, TSPLIB -a traveling salesman problem library, ORSA Journal on Computing, vol.3, issue.4, pp.376-384, 1991.
DOI : 10.1287/ijoc.3.4.376

G. Reinelt, The traveling salesman: computational solutions for TSP applications, 1994.

R. Roverso, A. Naiem, M. El-beltagy, S. El-ansary, and S. Haridi, A GPU-enabled solver for time-constrained linear sum assignment problems, 7th International Conference on Informatics and Systems (INFOS), pp.1-6, 2011.

T. Scavo, Scatter-to-gather transformation for scalability, 2010.

A. Schrijver, Theory of integer and linear programming, 1986.

C. Schulz, G. Hasle, A. R. Brodtkorb, and T. R. Hagen, GPU computing in discrete optimization. Part II: Survey focused on routing problems, EURO Journal on Transportation and Logistics, pp.1-28, 2013.

S. Sivanandam, S. Deepa, . Springer, D. Spampinato, and A. Elster, Introduction to genetic algorithms, 2009 IEEE International Parallel and Distributed Processing Symposium (IPDPS), pp.1-8, 2007.

T. Stützle and H. H. Hoos, MAX-MIN ant system. Future generation computer systems, vol.16, pp.889-914, 2000.

B. Suri, U. Bordoloi, and P. Eles, A scalable GPU-based approach to accelerate the multiple-choice knapsack problem, Design, Automation Test in Europe Conference Exhibition (DATE), pp.1126-1129, 2012.

E. Taillard, Benchmark for basic scheduling problems, Journal of Operational Research, vol.64, pp.278-285, 1993.

A. Uchida, Y. Ito, and K. Nakano, Accelerating ant colony optimisation for the travelling salesman problem on the gpu, International Journal of Parallel, Emergent and Distributed Systems, vol.29, issue.4, pp.401-420, 2014.

R. C. Whaley and J. Dongarra, Automatically tuned linear algebra software, Ninth SIAM Conference on Parallel Processing for Scientific Computing, pp.1-27, 1999.

W. L. Winston and J. B. Goldberg, Operations research: applications and algorithms, vol.3, 2004.

Y. You, Parallel ant system for traveling salesman problem on GPUs, Eleventh annual conference on genetic and evolutionary computation, pp.1-2, 2009.

Q. Yu, C. Chen, Z. Pan, T. Zají?-cek, and P. Sucha, Parallel genetic algorithms on programmable graphics hardware, Workshop on Models and Algorithms for Planning and Scheduling Problems (MAPSP), pp.1051-1059, 2005.

B. Zden?k, D. Jan, ?. S. P?emysl, and H. Zden?k, An acceleration of the algorithm for the nurse rerostering problem on a graphics processing unit, Lecture Notes in Management Science, vol.5, pp.101-110, 2013.