Abstract: Simulated annealing algorithm is a kind of preferable algorithms on solving job shop schedule problem. However, because of its inborn limitation and constraints from the job shop environment, its effect is impaired. Two improved SA are proposed: one is temper-SA, which can improve the quality of the solution; the other is fast-SA, which can shorten the running time of the algorithm. A job shop schedule example is described, which is solved with normal SA, temper-SA and fast-SA respectively.

Key words: Simulated annealing algorithm (SA), Temper-SA, Fast-SA, Job shop scheduling problem (JSP), Local search algorithm (LSA)

摘要： 模拟退火算法是较常用和较理想的解决车间作业调度问题的方法，但由于算法本身的限制和JSP问题的特殊性，其效能难以很好地发挥。该文提出了2种针对JSP问题的改进模拟退火算法：回火退火算法和快速模拟退火算法，前者可以提高最终解质量，后者可以提高算法的运行速度；并以Matlab为工具进行了仿真实验，获得了较好效果。

关键词: 模拟退火算法, 回火退火算法, 快速模拟退火算法, 作业车间调度问题, 局部搜索算法

CLC Number: 

• TP312