论文部分内容阅读
提出运用混合模拟退火进化规划（ＳＡＥＰ）求解Ｊｏｂ－ｓｈｏｐ调度问题．首先介绍了ＳＡＥＰ和进化规划（ＥＰ）的不同选择方法以及他们的变异算子，最后给出了仿真实例，并比较了这两种算法的优劣
It is proposed to solve the Job-shop scheduling problem by using Hybrid Simulated Annealing Evolutionary Programming (SAEP). Firstly, the different selection methods of SAEP and evolutionary programming (EP) and their mutation operator are introduced. Finally, the simulation examples are given and the advantages and disadvantages of these two algorithms are compared