Solving the Multi-objective flexible job shop scheduling problem by the population-based algorithms
In this paper, the flexible job shop scheduling problem with the objective of optimization three objective functions simultaneously has studied. Due to the complexity of this problem exact methods cannot be used to find the optimum solution and therefore, heuristic and meta-heuristic approaches are suitable. In this research, Biogeography-based optimization (BBO) and Genetic Algorithms have been chosen among the population-based optimization algorithms. These algorithms were provided in the MATLAB programming language. Finally, the computational results obtained from the algorithms of this research were analyzed and several research fields have been suggested for the future studies.