关键词: 装配作业车间调度, 右移修复编码, 遗传算法

Abstract: Aiming at the problem that the process-based coding method cannot guarantee the feasibility of the solution when the intelligent optimization algorithm solves the assembly job shop scheduling problem,this paper proposes a right-shift repair coding method.The coding method can not only meet the constraints of the assembly relationship of the product to ensure the feasibility of the solution when the algorithm iterates through the right-shift operation of a specific region;at the same time,it can ensure that the relative order of the underlying work processes remains unchanged in the process of repair,minimize the damage to the original solution,improve the diversity of the initial solution,and realize the efficient search of the solution space;in addition,this paper designs a block-based insertion variation operator for the coded solution,which can enlarge the search range of the solution.Finally,the coding method and mutation operator are realized in the classical genetic algorithm,and compared with the existing algorithms,and the experimental results verify the effectiveness of the proposed method.

Key words: assembly job shop scheduling, right-shift repair code, genetic algorithm