R. D. Blumofe and C. E. Leiserson, Scheduling multithreaded computations by work stealing, Journal of the ACM, vol.46, issue.5, pp.720-748, 1999.
DOI : 10.1145/324133.324234

A. Boukedjar, M. E. Lalami, and D. El-baz, Parallel Branch and Bound on a CPU-GPU System, 2012 20th Euromicro International Conference on Parallel, Distributed and Network-based Processing, pp.392-398, 2012.
DOI : 10.1109/PDP.2012.23

URL : https://hal.archives-ouvertes.fr/hal-01152948

T. Carneiro, A. E. Muritiba, M. Negreiros, L. De-campos, and G. Augusto, A New Parallel Schema for Branch-and-Bound Algorithms Using GPGPU, 2011 23rd International Symposium on Computer Architecture and High Performance Computing, pp.41-47, 2011.
DOI : 10.1109/SBAC-PAD.2011.20

I. Chakroun and M. Melab, An Adaptative Multi-GPU Based Branch-and-Bound. A Case Study: The Flow-Shop Scheduling Problem, 2012 IEEE 14th International Conference on High Performance Computing and Communication & 2012 IEEE 9th International Conference on Embedded Software and Systems, 2012.
DOI : 10.1109/HPCC.2012.59

URL : https://hal.archives-ouvertes.fr/hal-00705868

E. W. Dijkstra, Derivation of a termination detection algorithm for distributed computations. Control Flow and Data Flow: concepts of distributed programming, pp.507-512, 1987.

J. Dinan, S. Olivier, G. Sabin, J. Prins, P. Sadayappan et al., A message passing benchmark for unbalanced applications. Simulation Modelling Practice and Theory, pp.1177-1189, 2008.

F. Matteo, C. E. , and K. H. , The implementation of the cilk-5 multithreaded language, SIGPLAN Not, vol.33, pp.212-223, 1998.

D. James, L. D. Brian, P. Sadayappan, S. Krishnamoorthy, and N. Jarek, Scalable work stealing, ACM Conf. on High Performance Computing Networking, Storage and Analysis, pp.1-5311, 2009.

M. E. Lalami and D. El-baz, GPU Implementation of the Branch and Bound Method for Knapsack Problems, 2012 IEEE 26th International Parallel and Distributed Processing Symposium Workshops & PhD Forum, pp.1769-1777, 2012.
DOI : 10.1109/IPDPSW.2012.219

URL : https://hal.archives-ouvertes.fr/hal-01149777

N. Melab, I. Chakroun, M. Mezmaz, and D. Tuyttens, A GPU-accelerated b&b algorithm for the flow-shop scheduling problem, 14 th IEEE Conf. on Cluster Computing, 2012.

S. Min, C. Iancu, and K. Yelick, Hierarchical work stealing on manycore clusters, 5 th Conf. on Partitioned Global Address Space Prog. Models, 2011.

V. A. Saraswat, P. Kambadur, S. Kodali, D. Grove, and S. Krishnamoorthy, Lifeline-based global load balancing, 16 th ACM Symp. on Principles and practice of parallel programming (PPoPP '11), pp.201-212, 2011.

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