一种用于Job-Shop调度问题的改进禁忌搜索算法  

A Modified Taboo Search Algorithm for the Job-Shop Problem

作　　者：童刚[1] 李光泉[1] 刘宝坤[2] 

机构地区：[1]天津大学管理学院,天津300072 [2]天津大学自动化学院,天津300072

出　　处：《系统工程理论与实践》2001年第9期48-52,共5页Systems Engineering-Theory & Practice

摘　　要：提出了一种改进的禁忌搜索算法 .该算法利用了 Hash技术和对 Job-Shop调度问题的解进行编码实现了对 Job-Shop调度问题的解进行禁忌 .在算法中增加了回访功能 ,它可对未访问到的先前产生的解的相邻解继续搜索 .仿真实验表明算法是可行的和有效的 .In this paper, a modified taboo search algorithm is presented. The algorithm realized to forbid a solution of Job-Shop scheduling problem by encoding the solution visited during the search process and using hashing to keep track of the solution. A back visit strategy is used. The main idea of the strategy is to resume the search from unvisited neighbors of solutions previously generated. The results of computer simulation experiment indicate that the algorithm is applicable and effective.

关 键 词：JOB-SHOP调度问题 组合优化 禁忌搜索算法 

分 类 号：O224[理学—运筹学与控制论]