关键词: 生产调度, 最小化空闲时间, 进化算法, 进化计算, Job-shop调度问题

Abstract: In order to study job-shop scheduling problem,analyze scheduling result and scheduling procedure,and think that the scheduling process of classical job-shop scheduling model actually is reducing and minimizing idle time’s combination optimization process,different idle time has different influence to scheduling result.Put forward two-process procedure for minimizing idle time and process order rules for different idle time.Design the shortest idle time initial population generating procedure,recombination operator and mutation operator.Classic scheduling benchmark problem contrast and test shows：the shortest idle time analysis result is right;the shortest idle time procedures are efficient and credible;the shortest idle time evolution algorithm reduces search space,greatly improves search efficiency,efficiently avoids premature convergence problem,is stable and credible.

Key words: production scheduling, shortest idle time, evolution algorithm, evolution computing, Job-shop scheduling problem