Operator allocation model and scheduling algorithm for flexible job-shop problem

To reduce crew expenses and raise operation profits of flexible production enterprises, a mathematical model was constructed on the basis of reasonable operator allocation scheme and optimal sequence of operations, and a multi-objective mixed algorithm was used for solving the problem. The operation is divided into two layers, and the man-hour optimization scheme can be acquired by genetic algorithm and dynamic programming method. A simulated annealing genetic algorithm was proposed to optimize the sequence of operations, in which the search was limited to the space of permutation vectors of the order, and a given set of jobs were performed in the first stage using a hybrid crossover operators and mutation operators to redesign the selection operators. A set of test results show that the proposed algorithm is effective.