期刊文献+

作业车间调度问题的一种混合式算法

Hybrid algorithm for job shop scheduling problem
在线阅读 下载PDF
导出
摘要 通过对传统模拟退火算法和移动瓶颈法各自算法流程的分析,提出了一种改进的模拟退火算法.该算法以模拟退火算法为主体流程,在主体流程中融入移动瓶颈技术,及记忆功能和倒转技术.通过对JSP优化问题的仿真试验,验证了改进后的模拟退火算法对大规模组合优化问题可以得到好的优化效果. Based on the analysis of the process of the Simulated Annealing Algorithm and the Shifting Bottleneck procedure, an improved Simulated Annealing was proposed. The simulated annealing was served as the main flow of improved algorithm which syncretized the mechanism of improved shifting bottleneck procedure. To get some improvement, the memory function and reverse technique are applied in the algorithm. Through the simulation test for JSP optimization problem, the result indicates that the improved algorithm can gain better optimization effect especially combination optimization problem with large size.
出处 《材料研究与应用》 CAS 2007年第1期61-64,共4页 Materials Research and Application
关键词 作业车间调度 NP-HARD 启发式 模拟退火算法 移动瓶颈法 job shop scheduling NP-hard heuristic simulated annealing algorithm shifting bottleneck
  • 相关文献

参考文献5

  • 1[2]TAKESHI Y.Studies on metaheuristics for jobshop and flowshop scheduling problems[D].Kyoto:Kyoto University,2003.
  • 2黄志,黄文奇.一种基于禁忌搜索的作业车间调度算法[J].计算机工程与应用,2006,42(3):12-14. 被引量:13
  • 3[5]ADAMS J,BALAS E,ZAWACK D.The shifting bottleneck procedure for job shop scheduling[J].Management Science,1988,34(3):391-401.
  • 4[6]PETER J M,EMILE H L,LENSTRA J K.Job shop scheduling by simulated annealing[J].Operations Research,1992,40(1):113-125.
  • 5[7]TAILLARD E.Paralled taboo search techniques for the job shop scheduling problem[J].ORSA J Computing,1994(6):118-125.

二级参考文献12

  • 1黄志,黄文奇.作业车间调度问题的一种启发式算法[J].计算机工程与应用,2004,40(26):25-27. 被引量:1
  • 2M R Garey,D S Johnson.Computer and Intractability:A Guide to the Theory of NP-Completeness.San Francisco, Freeman, 1979.
  • 3J Adams,E Balas,D Zawack.The Shifting Bottleneck Procedure for job Shop Scheduling[J],Management Science,1988,34(3):391-401.
  • 4E Balas,A Vazacopoulos.Guided Local Search with Shifting Bottleneck for Job Shop Scheduling[J].Management Seienee,1998,44(2): 262-275.
  • 5F Pezzella,E Merelli.A tabu search method guided by shifting bottleneck for the job shop scheduling problem[J].European Journal of Operational Research, 2000 ; 120 : 297-310.
  • 6E Nowicki,C Smutnicki.A fast taboo search algorithm for the job shop problem[J].Management Science, 1996;42(6) :797-813.
  • 7H Wenqi,Y Aihua.An improved shifting bottleneck procedure for the job shop scheduling problem[J].Computer and Operations Research, 2004;31 (12) :2093-2110.
  • 8E Balas. Machine sequencing via Disjunctive Graphs:An Implicit Enumeration Algorithm[J].Oper Res, 1969; 17 (3) : 941 -957.
  • 9P J M Van Laarhoven,E H L Arts,J K Lenstra.Job shop scheduling by simulated annealing[J].Operations research, 1992 ;40( 1 ) : 113-125.
  • 10E Taillard.Parallel taboo search techniques for the job shop scheduling problem[J].ORSA J Computing,1994;6:l18-125.

共引文献12

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部