Abstract: In the operation sequencing optimization based on genetic algorithm, the individuals availability in the evolution should be ensured. It means those preference constraints among the operations should be satisfied in every individual. Through the comparison between the operations’ sequence of the individual generated randomly in the evolution in genetic algorithm and those pre-defined preference constraints among the operations, the operations’ sequence relationship is adjusted to satisfy all the pre-defined preference constraints among the operations. Using O-O technology and double linked list data structure, the general program of constraint adjustment algorithm is developed and embedded into the genetic algorithm. The feasibility of the constraint adjustment algorithm is validated through the case.

Key words: Operation sequencing optimization; Constraint adjustment algorithm; Genetic algorithm(GA

摘要： 基于遗传算法的工序排序优化，在进化过程中需要保证其个体的有效性，也就是工序之间存在的各优先级约束应该在每个个体中得到满足。通过将遗传算法进化中得到的随机个体的工序排序与预定的各优先级约束进行比较，调整个体的工序顺序关系直到满足全部的优先级约束。采用面向对象技术和双向链表数据结构，开发了约束调整算法的通用程序，并将其嵌入到遗传算法中。实例验证了该算法的可行性。

关键词: 工序排序优化；约束调整算法；遗传算法