关键词: 产品综合调度, 虚拟零部件, 分区编码, 遗传算法

Abstract: To make the product processing and assembling in parallel and to improve production efficiency,the comprehensive scheduling for two purposes were processed,and a scheduling algorithm based on virtual component level division coding was proposed.The model of product comprehensive scheduling problem was given,and the genetic algorithm was adopted to solve this problem.A novel division coding strategy which ensured all initial solutions feasible was designed based on rank of virtual components,which reflected the sequence constraints of parts processing and assembly.Feasible crossover and mutation methods were given for division coding to ensure the feasibility of offspring individuals and avoid the check and repair work.The decoding method was presented for parts processing and assembly constraints.The designed genetic algorithm was tested by literature example.Experimental results showed that the proposed algorithm had good solution speed and quality,and its validity was verified.In addition,the proposed encoding,crossover and mutation methods provided valuable references for other intelligent algorithms to solve this problem.

Key words: product comprehensive scheduling, virtual component, division coding, genetic algorithms