Method for solving flexible job shop scheduling problem based on circasian monkey search algorithm

The invention discloses a method for solving a flexible job shop scheduling problem based on a curtail monkey search algorithm, and the method comprises the steps: firstly coding the machine selection and process sorting of the flexible job shop scheduling problem, and building a mathematical model: carrying out the description of the flexible job shop scheduling problem, model hypothesis and model construction; setting algorithm parameters of a circaudal monkey search algorithm, and obtaining an initial population individual code in a random mode; calculating fitness values of all individuals in the initial population, sorting the individuals in an ascending order according to the fitness values, and taking the individual with the minimum fitness value as an optimal agent; meanwhile, all individual codes in the current population are converted into curtail monkey individual position vectors; and updating the optimal agent, judging whether an algorithm termination condition is met or not, and finally outputti