• Efficient parallel B&B method for the Blocking Job Shop Scheduling Problem 

    Dabah, Adel; Bendjoudi, Ahcène; Ait Zai, Abdelhakim
    In : (Innsbruck, Austria, 2016-07)
    The blocking job shop scheduling problem (BJSS) is a version of the classical job shop scheduling with no intermediate buffer between machines. It is known to be NP-hard in the strong sense. The major drawbacks of the previous works are the huge time needed to explore the search space and the low ratio of feasible to ...
  • GPU parallel B&B for the Blocking job shop scheduling problem. 

    Dabah, Adel; Bendjoudi, Ahcène; Ait Zai, Abdelhakim; El Baz, Didier
    In : Rapports de recherche internes, (CERIST, Alger, 2016-02-22)
    Branch and bound algorithms (B&B) are well known techniques for solving optimally combinatorial optimization problems. Nevertheless, these algorithms remain inefficient when dealing with large instances. This paper deals with the blocking job shop scheduling (BJSS), which is a version of classical job shop scheduling ...
  • Multi and Many-core Parallel B&B approaches for the Blocking Job Shop Scheduling Problem 

    Dabah, Adel; Bendjoudi, Ahcène; Ait Zai, Abdelhakim; El Baz, Didier; Nouali-Taboudjemat, Nadia
    In : (Innsbruck, Austria, 2016-07)
    In this paper, we propose three approaches to accelerate the B&B execution time using Multi and Many-core 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 ...