Assembly job shop scheduling algorithm based on right-shift repair coding method
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,a right-shift repair coding method was proposed.The coding method could not only meet the constraints of assembly relationship of the product to ensure the solution feasibility when the algorithm iterated through the right-shift operation of a specific region,but also ensure that the relative order of the underlying work processes unchanged in the process of repair,which minimizes the damage to the original solution as much as possible,improve the diversity of the initial solution and realize the efficient search of the solution space.In addition,a block-based insertion variation operator for the co-ded solution was designed to enlarge the search range of the solution.Finally,the coding method and mutation oper-ator were realized in the classical genetic algorithm and compared with the existing algorithms,and the experimental results verified the effectiveness of the proposed method.
万方数据
维普
