| 一种基于禁忌搜索技术的作业车间调度算法 |
| |
| 引用本文： | 黄志,黄文奇.一种基于禁忌搜索技术的作业车间调度算法[J].小型微型计算机系统,2005,26(2):222-225. |
| |
| 作者姓名： | 黄志 黄文奇 |
| |
| 作者单位： | 1. 华中科技大学,计算机系,湖北,武汉,430074
2. 华中科技大学,计算机系,湖北,武汉,430074;中国科学院,软件所,北京,100087 |
| |
| 基金项目： | 国家“九七三”重点基础研究规划项目 (19980 3 0 60 0 )资助 . |
| |
| 摘 要： | 描述了一种解决作业车间调度最短完工时间问题的有效的启发式算法．该算法基于禁忌搜索技术．算法中利用了新的禁忌搜索方法．从对一组问题基准实例的实验计算结果看，该算法在合理的计算时间内，对多个实例得到比当前没有用转换瓶颈技术的禁忌搜索中最好的算法之一的TSAB算法更好的结果．
|
| 关 键 词： | 作业车间调度 NP-难 启发式 禁忌搜索 |
| 文章编号： | 1000-1220(2005)02-0222-04 |
Algorithm Based on Taboo Search for Job Shop Scheduling |
| |
| HUANG Zhi,HUANG Wen-qi.Algorithm Based on Taboo Search for Job Shop Scheduling[J].Mini-micro Systems,2005,26(2):222-225. |
| |
| Authors: | HUANG Zhi HUANG Wen-qi |
| |
| Affiliation: | HUANG Zhi 1,HUANG Wen qi 1,2 1 |
| |
| Abstract: | An effective heuristic algorithm for solving the minimum makespan problem of job shop scheduling is presented in this paper. The algorithm is based on taboo search technique. A new developed taboo search method is used in the algorithm. Computational experiments on a set of benchmark problem instances show that, in several cases, the approach, in a reasonable amount of computing time, yields better results than TSAB,which is one of best taboo search algorithm of those not using shifting bottleneck technique. |
| |
| Keywords: | job shop scheduling NP-hard heuristic taboo search |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
