点击次数：

发表时间：2010-01-01

发表刊物：计算机集成制造系统

所属单位：机械工程学院

期号：1

页面范围：115-120

ISSN号：1006-5911

摘要：To solve the Job Shop scheduling problems in assembly environment, a genetic algorithm based on feasible solution space searching named Feasible Solution Space Genetic Algorithm (FSSGA) was proposed. To ensure the validity and feasibility of chromosomes in the whole evolution process, the first generation of repair operator in the stage of population initialization, the feasible crossover operator in the stage of crossover and the feasible mutation operator in the stage of mutation were designed and realized. The combinatorial design of feasible crossover operator and feasible mutation operator realized the feasible solution search of FSSGA, which not only reduced the searching space but also omitted the complex operations of decoding and repairing. FSSGA improved the solution efficiency and provided valuable reference for solving complex assembly Job Shop scheduling problems. The rationality and su-periority of FSSGA was embodied in the comparative experiment of simple rules, tabu search, simple genetic algo-rithm and FSSGA.

备注：新增回溯数据