| 极小化时间表长的无等待流水车间调度 |
| |
| 引用本文： | 钟雪灵.极小化时间表长的无等待流水车间调度[J].计算机工程与应用,2008,44(34):53-55. |
| |
| 作者姓名： | 钟雪灵 |
| |
| 作者单位： | 广东金融学院计算机系,广州,510520 |
| |
| 摘 要： | 针对以时间表长最小为目标函数的无等待流水车间(No-Wait Flow Shop,NWFS)调度问题,提出了一个混合禁忌搜索算法(Hybrid Taboo Search,HTS),以启发式算法产生的解作为初始解,通过禁忌搜索进一步提高解的质量。大量随机产生实例的实验结果表明:提出的HTS算法在总体性能上优于经典的RAJ、VNS和GASA算法,因此该算法具有可行性和优越性。
|
| 关 键 词： | 无等待流水车间调度 时间表长 启发式算法 混合禁忌搜索 |
| 收稿时间： | 2008-5-13 |
| 修稿时间： | 2008-9-1
|
No-Wait Flow Shop scheduling to minimize makespan |
| |
| ZHONG Xue-ling.No-Wait Flow Shop scheduling to minimize makespan[J].Computer Engineering and Applications,2008,44(34):53-55. |
| |
| Authors: | ZHONG Xue-ling |
| |
| Affiliation: | Department of Computer，Guangdong University of Finance，Guangzhou 510520，China |
| |
| Abstract: | In this paper,a Hybrid Taboo Search(HTS) algorithm is proposed for the No-Wait Flow Shop(NWFS) problem with makespan criterion.An initial solution is obtained by the heuristic algorithm and improved by the Taboo Search(TS) algorithm.Ex-periment results on a large number of the random generated instances show that HTS outperforms three classical algorithms RAJ,VNS and GASA,therefore the proposed algorithm is effective in finding optimal or near-optimal solutions. |
| |
| Keywords: | No-Wait Flow Shop(NWFS) makespan heuristic algorithm Hybrid Taboo Search(HTS) |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
| 点击此处可从《计算机工程与应用》浏览原始摘要信息 |
|
点击此处可从《计算机工程与应用》下载全文 |
|
