| 求解Job-Shop车间作业调度的混合算法 |
| |
| 引用本文： | 时维国,薛倩.求解Job-Shop车间作业调度的混合算法[J].大连铁道学院学报,2009(4):64-66. |
| |
| 作者姓名： | 时维国 薛倩 |
| |
| 作者单位： | 大连交通大学电气信息学院; |
| |
| 摘 要： | 提出了一种解决车间作业调度最短完成时间的有效的混合算法．基于考虑到遗传算法的早熟收敛问题和禁忌搜索算法的自适应优点，该算法结合了遗传算法和禁忌搜索算法对Job—Shop车间作业调度问题的解进行编码，通过实例表明该算法是可行和有效的．
|
| 关 键 词： | 作业车间调度 遗传算法 禁忌搜索法 |
A Mixed Algorithm for A Job-Shop Problem |
| |
| SHI Wei-guo,XUE Qian.A Mixed Algorithm for A Job-Shop Problem[J].Journal of Dalian Railway Institute,2009(4):64-66. |
| |
| Authors: | SHI Wei-guo XUE Qian |
| |
| Institution: | SHI Wei-guo,XUE Qian(School of Electrical & Information Engineering,Dalian Jiaotong University,Dalian 116028,China) |
| |
| Abstract: | An effective mixed algorithm for solving the minimun makespan problem of job-shop scheduling is presented.Aiming at a class of job shop scheduling problem with routing flexibility,an optimal scheduling algorithm that combines GA(Genetic Algorithm)with TS(Taboo Search) is established.Simulation results demonstrate that the mixed algorithm is applicable and effective. |
| |
| Keywords: | job-shop scheduling genetic algorithm taboo search |
| 本文献已被 CNKI 维普 等数据库收录！ |
