Solving fuzzy flexible job shop scheduling problems using genetic algorithm

This paper presents a two-population genetic algorithm (TPGA) for FfJSSPs with the maximum fuzzy completion time. TPGA uses two-string representation to represent a solution and two populations to search the optimal schedule. In each generation, crossover and mutation are only applied to one part of the chromosome and these populations are combined and updated by using half of the individuals with the bigger fitness in the combined population. Some instances of FfJSSP are designed and the performance of TPGA is tested. The computational results demonstrate the promising performance of TPGA on FfJSSP.