|
|||||
|
|
| 基于改进遗传算法的流水车间调度求解方法 | |
| 引用本文： | 王克喜,单汨源,黄敏镁.基于改进遗传算法的流水车间调度求解方法[J].系统工程,2008,26(10). |
| 作者姓名： | 王克喜 单汨源 黄敏镁 |
| 作者单位： | 1. 湖南大学,工商管理学院,湖南,长沙,410082;湖南科技大学,管理学院,湖南,湘潭,411201 2. 湖南大学,工商管理学院,湖南,长沙,410082 3. 华南师范大学,公共管理学院,广东,广州,510006 |
| 基金项目： | 湖南省教育厅科研项目 |
| 摘 要： | 流水车间调度问题是一类经典的NP完全问题,为此提出了一种求解极小化总完工时间的流水车间调度问题的改进遗传算法.该算法采用构造型启发式算法和随机方法共同产生初始种群,结合禁忌搜索算法的局部搜索性能和遗传算法的全局搜索性能.仿真实例的结果表明该算法对问题求解的可行性和有效性. |
| 关 键 词： | 遗传算法 禁忌搜索 启发式算法 调度 |
Solution Method of Flowshop Scheduling Based on Improved Genetic Algorithm |
|
| WANG Ke-xi,SHANG Mi-yuan,HUANG Min-mei.Solution Method of Flowshop Scheduling Based on Improved Genetic Algorithm[J].Systems Engineering,2008,26(10). | |
| Authors: | WANG Ke-xi SHANG Mi-yuan HUANG Min-mei |
| Institution: | WANG Ke-xi1,2,SHANG Mi-yuan1,HUANG Min-mei3(1.College of Business Administration,Hunan University,Changsha 410082,China,2.School of Management,Hunan University of Science Technology,Xiangtan 411201,3.College of Public Administration,South China Normal University,Guangzhou 510006,China) |
| Abstract: | Flowshop scheduling is proved to be a NP-complete problem.In order to solve this problem,a method based on an improved genetic algorithm is developed to minimize flowtime of jobs.This method generates initial species by means of constructive heuristic algorithm and random method and obtains an optimal solution by combining taboo search with standard genetic algorithm,which improves the local and global search property.Results of computational experiment indicate that the proposed improved genetic algorithm ... |
| Keywords: | Genetic Algorithm Taboo Search Heuristic Algorithm Scheduling |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ | |