关键词: 缓存约束, 作业车间调度, 遗传算法, 求解精度

Abstract: To solve the low accuracy problem for solving the job shop scheduling with cache constraints applied by existing heuristic algorithm,the solution extended from the job level to the process level was proposed,and the genetic algorithm was used to get a higher precision solution.To avoid premature convergence and falling into local optimum of traditional genetic algorithm,the algorithm was improved by combining the adaptive crossover mutation probability with improved crossover operator.The experimental results showed that the proposed algorithm could obtain higher precision solutions with the same buffer capacity.

Key words: buffer constraints, job shop scheduling, genetic algorithms, prescision