解 Job Shop 问题的一种组合模拟算法  

Job Shop Scheduling by Simulated Annealing Algorithm Combined with Tabu Search

作　　者：韩丽敏[1] 黄红选[1] 冯允成[1] 

机构地区：[1]北京航空航天大学管理学院

出　　处：《北京航空航天大学学报》1998年第1期75-78,共4页Journal of Beijing University of Aeronautics and Astronautics

基　　金：国家自然科学基金;航空科学基金

摘　　要：针对成批车间的作业排序（ＪｏｂＳｈｏｐＳｃｈｅｄｕｌｉｎｇ）问题设计了一种模拟退火与ＴａｂｕＳｅａｒｃｈ相组合的算法．首先用模拟退火算法求得一个初始解，再利用ＴａｂｕＳｅａｒｃｈ进行进一步的寻优．通过大量的算例分析表明，该算法具有良好的寻优特性与运算效率．This paper describes an approximation algorithm for the problem of finding the minimum makespan in a job shop.The algorithm is based on simulated annealing algorithm and tabu search,two generalizations of the well known iterative improvement approach to combinatorial optimization problems.First a start solution is found by the simulated annealing algorithm,then tabu search is used to seek the better solution in order to compensate the disadvantage of large running times by single simulated annealing algorithm.The algorithm in this paper is proved effective and efficient both in computation and convergence by analyzing the results of some experiments on it.

关 键 词：生产管理 成批车间 作业排序 组合模拟算法 

分 类 号：F270.7[经济管理—企业管理] F406.2[经济管理—国民经济]