| 一种求3机Flow—shop调度问题的遗传算法 |
| |
| 引用本文： | 陈雄,汤光强,吴启迪.一种求3机Flow—shop调度问题的遗传算法[J].同济大学学报(自然科学版),2001,29(8):940-945. |
| |
| 作者姓名： | 陈雄 汤光强 吴启迪 |
| |
| 作者单位： | 1. 复旦大学电子工程系,
2. 同济大学CIMS研究中心, |
| |
| 摘 要： | 提出一种遗传分枝定界算法求解3机Flow-shop调度问题，该算法似于常用的遗传局部算法和遗传动态规划算法，用随杨方法生成测试例子，通过与著名的Taillard的禁忌搜索算法和Reeves的遗传算法进行比较，实验结果证实了遗传分枝定界算法的有效性。
|
| 关 键 词： | Flowshop调度 分枝定界 遗传算法 |
| 文章编号： | 0253-374(2001)08-0940-06 |
| 修稿时间： | 2000年12月19 |
Genetic Algorithm for Three-machine Flow-show Scheduling Problem |
| |
| CHEN Xiong ,TANG Guang-qiang ,WU Qi-di.Genetic Algorithm for Three-machine Flow-show Scheduling Problem[J].Journal of Tongji University(Natural Science),2001,29(8):940-945. |
| |
| Authors: | CHEN Xiong TANG Guang-qiang WU Qi-di |
| |
| Institution: | CHEN Xiong 1,TANG Guang-qiang 2,WU Qi-di 2 |
| |
| Abstract: | A genetic branch and bound algorithm is proposed to solve the 3 machine flow-shop permutation problem,which is similar to the often used genetic local algorithm and the genetic dynamic programming algorithm.Based on the test examples that are produced with random methods and the performance comparison with the famous Taillard' tuba search algorithm and Reeves'genetic algorithm,the experimental results show the effectiveness of the genetic branch and bound algorithm. |
| |
| Keywords: | Flow-shop scheduling branch and bound algorithm genetic algorithm |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
