In order to improve the diversity of initial population and consider the operation sequence constraints of the same artifact at the same time

the stack was used to storage all operations in the view of the FJSP machine selection problem

in which the makespan was the optimization objective. Global random initialization method based on the key operation was proposed to solve the machine selection problem of FJSP

in which the key operation containing the only optional machine can directly affect the total load machine and processing time. To avoid the basic genetic algorithm trapped in local optimum when solving FJSP

re-activation mechanism was added to the GA algorithm

by which the diversity of population can be increased. Finally

in the view of the FJSP benchmark examples

the effectiveness of the GRS initialization mechanism and the reliability of the proposed improved algorithm were verified respectively by analyzing the performance comparison of the initial machine selection parts and the experimental results of solving FJSP by the genetic algorithm with different initializations.