Vol. 7, Issue 2, Part B (2025)

The job-shop scheduling problem is one of the combinatorial optimization problems, which is very difficult to find the optimal solution in its nonlinear nature and reasonable time. This paper selects the job-shop scheduling problem as a research object and constructs a mathematical model aimed at minimizing the makespan in flexible manufacturing system (FMS). The genetic algorithm is applied to the scheduling program to obtain the optimal solution in the job-shop scheduling problem. A new solution method is proposed to get the optimal scheduling result according to the selection of the mutation type, using a job-shop scheduling program based on genetic algorithm. The Flexsim based on 3D discrete event simulation is used to simulate and verify the job-shop scheduling results obtained by selection of mutation type. Finally, through analyzing the simulated results, it shows that the proposed method is efficient and reasonable for solving job-shop scheduling problem in FMS.