Multi and many-core parallel B&B approaches for the Blocking Job Shop Scheduling problem

In this paper, we propose three approaches to accelerate the B&B execution time using Multi and Manycore systems to solve the NP-hard Blocking Job Shop Scheduling problem (BJSS). The first approach is based on Master/Worker paradigm where the workers independently explore the branches sent by the master. The second approach is a node-based parallelization… CONTINUE READING