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

Abstract:

To reduce crew expenses and raise operation profits of flexible production enterprises, a mathemati- cal model was constructed on the basis of reasonable operator allocation scheme and optimal sequence of opera- tions, 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 program- ming 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 per- formed in the first stage using a hybrid crossover operators and mutation operators to redesign the selection op- erators. A set of test results show that the proposed algorithm is effective