Said Bourazza, "A New Manner of Crossing in the Genetic Algorithm for Resolving Job Shop Problem (JSP)," WSEAS Transactions on Computer Research, vol. 8, pp. 39-43, 2020, DOI:10.37394/232018.2020.8.7
Said Bourazza. A New Manner of Crossing in the Genetic Algorithm for Resolving Job Shop Problem (JSP).
WSEAS Transactions on Computer Research. 2020;8:39-43. 10.37394/232018.2020.8.7
WSEAS Transactions on Computer Research
Print ISSN: 1991-8755, E-ISSN: 2415-1521
Volume 8, 2020
A New Manner of Crossing in the Genetic Algorithm for Resolving Job Shop Problem (JSP)
Author:
Abstract: The minimization of the makespan of the job shop problem with J jobs and M machines is NP-hard problem. To resolve it we apply a genetic algorithm [1,2]. We use a real coding for the representation of chromosomes. The originality of our variant lies by the choice of two effective crossover operators and one for mutation, As well as their respective probability, determined by numeric simulations on several examples known in the literature. We compare our results on ’’OR library’’ benchmarks [3] with Adamas and al. [4], Ombuki and al [5] and Yamada and al [6] results.
Pages: 39-43 WSEAS Transactions on Computer Research, ISSN / E-ISSN: 1991-8755 / 2415-1521, Volume 8, 2020, Art. #7 DOI: 10.37394/232018.2020.8.7
×
Citation Tools