摘要
提出运用混合模拟退火进化规划（ＳＡＥＰ）求解Ｊｏｂ－ｓｈｏｐ调度问题．首先介绍了ＳＡＥＰ和进化规划（ＥＰ）的不同选择方法以及他们的变异算子，最后给出了仿真实例。
In this paper, a combined evolutionary programming (SAEP) with simulated annealing is presented to solve Job shop scheduling problem. Two different selected methods between SAEP and EP and their mutation operators are discussed, and simulation results are given to illustrate the efficiency of the presented algorithm, and a comparison between the two algorithms is also presented.
出处
《信息与控制》
CSCD
北大核心
1999年第2期81-85,共5页
Information and Control
