Optimisation of distributed manufacturing flexible job shop scheduling by using hybrid genetic algorithms

In contrast to traditional job-shop scheduling problems, various complex constraints must be considered in distributed manufacturing environments; therefore, developing a novel scheduling solution is necessary. this paper proposes a hybrid genetic algorithm (hga) for solving the distributed and flexible job-shop scheduling problem (dfjsp). compared with previous studies on hgas, the hga approach proposed in this study uses the taguchi method to optimize the parameters of a genetic algorithm (ga). furthermore, a novel encoding mechanism is proposed to solve invalid job assignments, where a ga is employed to solve complex flexible job-shop scheduling problems (fjsps). in addition, various crossover and mutation operators are adopted for increasing the probability of finding the optimal solution and diversity of chromosomes and for refining a makespan solution. to evaluate the performance of the proposed approach, three classic dfjsp benchmarks and three virtual dfjsps were adapted from classical fjsp benchmarks. the experimental results indicate that the proposed approach is considerably robust, outperforming previous algorithms after 50 runs.