| 基于遗传优化算法求解作业车间调度问题 |
| |
| 引用本文： | 姜思杰,徐晓飞,李全龙. 基于遗传优化算法求解作业车间调度问题[J]. 计算机集成制造系统, 2002, 8(3): 229-232 |
| |
| 作者姓名： | 姜思杰 徐晓飞 李全龙 |
| |
| 作者单位： | 哈尔滨工业大学计算机科学与工程系,黑龙江,哈尔滨,150001 |
| |
| 基金项目： | 国家 8 63 /CIMS主题资助项目 (863 -5 11-944 -0 0 1)~~ |
| |
| 摘 要： | 将一类具有路径柔性的作业车间调度问题，分解为任务优化分配和任务优化调度两个子问题，结合遗传算法和启发式算法，提出了基于遗传算法的优化调度算法，并有实例证实了该算法的有效性。
|
| 关 键 词： | 作业车间调度问题 遗传优化算法 启发式算法 |
| 文章编号： | 1006-5911(2002)03-0229-04 |
| 修稿时间： | 2001-04-02 |
An Optimal Algorithm for a Class of Jobshop Scheduling Problems |
| |
| JIANG Si-jie,XU Xiao-fei,LI Quan-long. An Optimal Algorithm for a Class of Jobshop Scheduling Problems[J]. Computer Integrated Manufacturing Systems, 2002, 8(3): 229-232 |
| |
| Authors: | JIANG Si-jie XU Xiao-fei LI Quan-long |
| |
| Abstract: | The scheduling problem on a class of jobshop with routing flexibility is divided into two subproblems, which are the task's optimal distribution and optimal scheduling. A genetics based optimal scheduling algorithm, which combines the genetic algorithm and heuristic algorithm, is presented, and is proven to be effective by an example. |
| |
| Keywords: | jobshop routing flexibility heuristic algorithm genetic algorithm |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
