Improved simulated annealing algorithm used for job shop scheduling problems
In dealing with shop scheduling, by optimizing solver to improve the simulated annealing algorithm, it can be solved quickly and effectively. The stability of the mean completion time and the output of optimal completion time were compared with other simulated annealing algorithm.
simulated annealing algorithm job shop scheduling optimization solution
Song Shao-zhong Ren Jia-jun
Department of Information Engineering Jilin Business and Technology College Changchun 130062, China College of Mechanical Science and Engineering Jilin University Changchun 130022, China
国际会议
2010 Second Asia-Pacific Conference on Information Processing(2010年第二届亚太地区信息处理国际会议 APCIP 2010)
南昌
英文
43-46
2010-09-17(万方平台首次上网日期,不代表论文的发表时间)