关键词: 柔性作业车间调度, 机器选择, 初始群体, 遗传算法

Abstract: To improve the quality of initial population of the genetic algorithm for the Flexible Job-shop Scheduling Problem (FJSP) solution,a machine selection initialization method based on limit scheduling completion time (Climit) minimization was proposed,in which the Climit was equal to the maximum of machine load and job process time.The double chains structure which included machine selection chain and operation sequence chain was used to encode.While initializing machine selection chains,global selection and local selection were adopted macroscopically to optimize maximum machine load and maximum job process time respectively;microscopically,the random sequence was used to select the operation.On the basis of considering the optional machine load for selecting machine,the process time was further compared,and both maximum machine load and maximum job process time were optimized.The effectiveness of proposed method was verified by analyzing the machine selection results of benchmarks and solving it based on genetic algorithm.

Key words: flexible job shop scheduling, machine selection, initial solution, genetic algorithms