A New Genetic Algorithm or the Flexible Job Shop scheduling problems, ISSN/ISBN 1738-494X / 1976-3824

Citation:

Imen, Driss, Mouss kinza Nadia, and Laggoun Assia. 2015. “A New Genetic Algorithm or the Flexible Job Shop scheduling problems, ISSN/ISBN 1738-494X / 1976-3824”. J MECH SCI TECHNOL Volume 29 (Issue 3) : pp 1273–1281.

Abstract:

Flexible job-shop scheduling problem (FJSP), which is proved to be NP-hard, is an extension of the classical job-shop scheduling problem. In this paper, we propose a new genetic algorithm (NGA) to solve FJSP to minimize makespan. This new algorithm uses a new chromosome representation and adopts different strategies for crossover and mutation. The proposed algorithm is validated on a series of benchmark data sets and tested on data from a drug manufacturing company. Experimental results prove that the NGA is more efficient and competitive than some other existing algorithms.

Publisher's Version

Last updated on 12/09/2019