Rezultaty 1 - 2 Rezultaty od 2 Dla wyszukiwania '', Czas wyszukiwania: 0,01s Redukuj rezultaty
  1. 1

    Modified discrete firefly algorithms with mutation operators as local search for makespan minimization of the permutation flowshop scheduling problem od Pabrua, Lerr Dwaine Badoy

    Wydane 2011
    Praca dyplomowa

    Modified discrete firefly algorithms with mutation operators as local search for makespan minimization of the permutation flowshop scheduling problem
  2. 2

    Comparison of crossover and mutation operators of genetic algorithm applied to CSM-UPMin scheduling problem od Talaugon, Armida Glaiza Varquez

    Wydane 2011
    Praca dyplomowa

    Comparison of crossover and mutation operators of genetic algorithm applied to CSM-UPMin scheduling problem

Narzędzie wyszukiwania: