Scheduling of production systems with the approach of meta-heuristic algorithms

The main goal of the research is production timing with the approach of meta-heuristic algorithms. First, the mathematical model of the production schedule was presented, and then the model was solved with the genetic algorithm. All types of genetic operators were considered at this stage, and an attempt was made to achieve better answers by choosing appropriate methods. The result of applying these targeted selection methods was the rapid convergence of the population. However, this fast convergence did not provide an optimal solution because it quickly converged all the people of the population to a local optimal solution and did not allow the algorithm to search more of the solution space. Therefore, contrary to expectations, the targeted selection methods without a suitable generation method did not improve the algorithm's efficiency. At this stage, the generation methods were considered; the optimal solution for big problems was also obtained by implementing the selection methods. By finding the appropriate generation method, it was observed that even the operators who did not have much ability to see close to optimal solutions succeeded in finding optimal solutions.