A. Aitzai, B. Benmedjdoub, and M. Boudhar, A branch and bound and parallel genetic algorithm for the job shop scheduling problem with blocking, International Journal of Operational Research, vol.14, issue.3, pp.343-365, 2012.

A. Bendjoudi, M. Chekini, M. Gharbi, M. Mehdi, K. Benatchba et al., Parallel B&B Algorithm for Hybrid Multicore/GPU Architectures, High Performance Computing and Communications (HPCC), pp.914-921, 2013.

P. Brucker, Scheduling algorithms, vol.3, 2007.

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. Dabah, A. Bendjoudi, and A. Aitzai, Multi and Many-core Parallel B&B approaches for the Blocking Job Shop Scheduling Problem, 14 International Conference on High Performance Computing & Simulation (HPCS), pp.705-713, 2016.
URL : https://hal.archives-ouvertes.fr/hal-02115637

A. Dabah, A. Bendjoudi, D. El-baz, and A. Aitzai, GPU-Based Two Level Parallel B&B for the Blocking Job Shop Scheduling Problem, Parallel and Distributed Processing Symposium Workshops, pp.747-755, 2016.
URL : https://hal.archives-ouvertes.fr/hal-02115751

A. Dabah, A. Bendjoudi, and A. Aitzai, Efficient parallel B&B method for the blocking job shop scheduling problem, 14 International Conference on High Performance Computing & Simulation, 2016.

I. Chakroun, M. Mezmaz, N. Melab, and A. Bendjoudi, Reducing thread divergence in a GPUaccelerated branch-and-bound algorithm, Concurrency and Computation: Practice and Experience, vol.25, issue.8, pp.1121-1136, 2013.
URL : https://hal.archives-ouvertes.fr/hal-00846004

. Chakroun, . Imen, . Melab, . Nordine, M. Mohand et al., Combining multi-core and GPU computing for solving combinatorial optimization problems, Journal of Parallel and Distributed Computing, vol.73, pp.1563-1577, 2013.
URL : https://hal.archives-ouvertes.fr/hal-00935890

J. Carlier and E. Pinson, Adjustment of heads and tails for the job-shop problem, European Journal of Operational Research, vol.78, pp.146-161, 1994.

H. Gröflin and A. Klinkert, A new neighborhood and tabu search for the blocking job shop, Discrete Applied Mathematics, vol.157, issue.17, pp.3643-3655, 2009.

B. Gendron and T. G. Crainic, Parallel branch-and-branch algorithms: Survey and synthesis, Operations research, vol.42, issue.6, pp.1042-1066, 1994.

N. G. Hall and C. Sriskandarajah, A survey of machine scheduling problems with blocking and no-wait in process, Operations research, vol.44, issue.3, pp.510-525, 1996.

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

N. Melab, I. Chakroun, and A. Bendjoudi, Graphics processing unit-accelerated bounding for branch-andbound applied to a permutation problem using data access optimization, Concurrency and Computation: Practice and Experience, vol.26, issue.16, pp.2667-2683, 2014.

Y. Mati, N. Rezg, and X. Xie, A taboo search approach for deadlock-free scheduling of automated manufacturing systems, Journal of Intelligent Manufacturing, vol.12, issue.5-6, pp.535-552, 2001.

A. Mascis and D. Pacciarelli, Job-shop scheduling with blocking and no-wait constraints, European Journal of Operational Research, vol.143, issue.3, pp.498-517, 2002.

N. Melab, Multi-core versus many-core computing for many-task Branch-and-Bound applied to big optimization problems, Future Generation Computer Systems, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01419079

C. Meloni, D. Pacciarelli, and M. Pranzo, A rollout metaheuristic for job shop scheduling problems, Annals of Operations Research, vol.131, pp.215-235, 2004.

A. Oddi, R. Rasconi, A. Cesta, and S. F. Smith, Iterative Improvement Algorithms for the Blocking Job Shop, ICAPS, 2012.

M. Pranzo and D. Pacciarelli, An iterated greedy metaheuristic for the blocking job shop scheduling problem, Journal of Heuristics, pp.1-25, 2013.

B. Roy and B. Sussmann, Les problemes d'ordonnancement avec contraintes disjonctives, Note ds, vol.9, 1964.

H. Riebler, Efficient Branch and Bound on FPGAs Using Work Stealing and Instance-Specific Designs, ACM Transactions on Reconfigurable Technology and Systems (TRETS), vol.10, p.24, 2017.

E. Taillard, Taillard's FSP benchmarks

T. Vu and B. Derbel, Parallel Branch-and-Bound in multi-core multi-CPU multi-GPU heterogeneous environments, Future Generation Computer Systems, vol.56, pp.95-109, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01249124

, Message Passing Interface Forum. MPI: A Message Passing Interface Standard, 2012.

, NVIDIA Corporation. CUDA C Programming Guide

, NVIDIA Corporation. Multi-Process Service

W. Yang, K. Li, and K. Li, A hybrid computing method of SpMV on CPU-GPU heterogeneous computing systems, Journal of Parallel and Distributed Computing, vol.104, pp.49-60, 2017.

D. S. Souza, H. G. Santos, and I. M. Coelho, A Hybrid Heuristic in GPU-CPU Based on Scatter Search for the Generalized Assignment Problem, Procedia Computer Science, vol.108, pp.1404-1413, 2017.

L. Asadzadeh, A local search genetic algorithm for the job shop scheduling problem with intelligent agents, Computers & Industrial Engineering, vol.85, pp.376-383, 2015.

. He-nouri, K. Belkahla-driss, and . Ghédira, Hybrid metaheuristics for scheduling of machines and transport robots in job shop environment, Applied Intelligence, vol.45, issue.3, pp.808-828, 2016.

O. Houssem-eddine-nouri, K. Belkahla-driss, and . Ghédira, Hybrid Metaheuristics within a Holonic Multiagent Model for the Flexible Job Shop Problem, Procedia Computer Science, vol.60, pp.83-92, 2015.