| 一种求解Job-Shop调度问题的快速禁忌搜索算法 |
| |
| 引用本文： | 戚海英,黄明,李瑞.一种求解Job-Shop调度问题的快速禁忌搜索算法[J].大连铁道学院学报,2005,26(3):46-48. |
| |
| 作者姓名： | 戚海英 黄明 李瑞 |
| |
| 作者单位： | 大连交通大学电气信息学院,辽宁大连116028 |
| |
| 摘 要： | 介绍了一种解决Job-Shop调度最短完工时间的有效的快速禁忌搜索算法,该算法首先利用插入算法构造尽可能好的初始解,然后使用禁忌搜索算法改进当前解,用基准实例进行仿真,实验结果表明该算法是可行的和有效的.
|
| 关 键 词： | Job-Shop调度 禁忌搜索 插入算法 |
| 文章编号： | 1000-1670（2005）03-0046-03 |
| 收稿时间： | 2005-03-10 |
A Fast Taboo Search Algorithm for Solving Job-Shop Problem |
| |
| QI Hai-ying,HUANG Ming,LI Rui.A Fast Taboo Search Algorithm for Solving Job-Shop Problem[J].Journal of Dalian Railway Institute,2005,26(3):46-48. |
| |
| Authors: | QI Hai-ying HUANG Ming LI Rui |
| |
| Institution: | School of Electrical Engineering, Dalian Jiaotong University, Dalian 116028, China |
| |
| Abstract: | A fast taboo search algorithm for solving the minimum makespan problem of JobShop scheduling is presented in this paper. In the first, the insertion method is used to create the initial solution, and then the taboo search algorithm is applied to improve the final solution. Computer simulation experiments on a set of benchmark problems show that the algorithm is applicable and effective. |
| |
| Keywords: | Job-shop scheduling taboo search insertion method |
| 本文献已被 CNKI 维普 等数据库收录！ |
|
