Now showing items 1-2 of 2

  • 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 ...
  • GPU-based two level parallel B&B for the Blocking job shop scheduling problem. 

    Adel, Dabah; Bendjoudi, Ahcène; El Baz, Didier; Abdelhakim, Ait Zai
    In : (IEEE, Chicago, Illinois USA, 2016-05-23)
    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 ...

Tous les documents dans CERIST DIGITAL LIBRARY sont protégés par copyright, avec tous droits réservés. copyright © 2013-2015  CERIST
Powered by 
@mire NV