| 解JobShop问题的一种组合模拟算法 |
| |
| 引用本文： | 韩丽敏.解JobShop问题的一种组合模拟算法[J].北京航空航天大学学报,1998,24(1):75-78. |
| |
| 作者姓名： | 韩丽敏 |
| |
| 作者单位： | 北京航空航天大学 管理学院 |
| |
| 基金项目： | 国家自然科学基金、航空科学基金资助项目 |
| |
| 摘 要： | 针对成批车间的作业排序(Job Shop Scheduling )问题设计了一种模拟退火与Tabu Search相组合的算法.首先用模拟退火算法求得一个初始解,再利用Tabu Search进行进一步的寻优.通过大量的算例分析表明,该算法具有良好的寻优特性与运算效率.
|
| 关 键 词： | 排序 组合最优化 最优化算法 成批车间作业排序 模拟退火算法 Tabu Search算法 生产管理 |
| 收稿时间： | 1996-12-20 |
Job Shop Scheduling by Simulated AnnealingAlgorithm Combined with Tabu Search |
| |
| Han Limin,Huang Hongxuan,Feng Yuncheng.Job Shop Scheduling by Simulated AnnealingAlgorithm Combined with Tabu Search[J].Journal of Beijing University of Aeronautics and Astronautics,1998,24(1):75-78. |
| |
| Authors: | Han Limin Huang Hongxuan Feng Yuncheng |
| |
| Institution: | Beijing University of Aeronautics and Astronautics,School of Management |
| |
| Abstract: | 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. |
| |
| Keywords: | sequencing combinatorial optimization optimization algorithms job shop scheduling simulated annealing algorithms tabu search production management |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《北京航空航天大学学报》浏览原始摘要信息 |
| 点击此处可从《北京航空航天大学学报》下载免费的PDF全文 |
