解决车间调度问题的改进模拟退火算法  

An Enhanced Simulated Annealing Algorithm for Job Shop Scheduling Problems

作　　者：潘全科[1] 段俊华[1] 赵清理[1] 朱剑英[2] 

机构地区：[1]聊城大学计算学院,聊城252059 [2]南京航空航天大学机电学院,南京210016

出　　处：《机械科学与技术》2007年第1期112-114,共3页Mechanical Science and Technology for Aerospace Engineering

基　　金：国家自然科学基金项目(50275078);山东省自然科学基金项目(2004ZX14)资助

摘　　要：结合作业车间调度问题的关键路径理论,设计了一种具有多次退火过程的调度算法。该算法利用记忆表记录下降过程中的平衡点,当一次退火过程结束后,从表中取出各平衡点的温度、状态和抽样长度重新开始退火过程,直到记忆表为空。仿真结果表明该算法在求解质量和求解效率方面均有优势。The paper designed an enhanced simulated annealing algorithm （ESA） with back jump tracking in connection with the critical path theory of a job shop scheduling problem. The algorithm uses a memory list to search for optimal solutions in the annealing process. After one annealing process is over, the temperature, state and sampiing length of each solution are taken out from the list to resume the search from that solution until the list is empty. A simulation indicates that the ESA algorithm can solve job shop scheduling problems more efficiently and with higher quality than other algorithms.

关 键 词：改进的模拟退火算法 作业车间调度问题 关键路径理论 

分 类 号：TP278[自动化与计算机技术—检测技术与自动化装置]