Research on assembly constraints job shop scheduling based on genetic algorithm

In this paper, genetic algorithm was used to solve the job shop scheduling problem with assembly constraints. The model of job shop scheduling problem with assembly constraints was built up by analyzing the characteristics of production process with the sequence constraints. Aiming at the special characteristics of the job in the processing and combining genetic algorithm theory, a feasible chromosome generating mechanism based on precedence constraint matrix was designed. The crossover operator based on secondary sub assembly and the mutation operator that can meet the assembly constraints were proposed. The feasibility and effectiveness of the proposed algorithm was verified by testing benchmark examples.