摘要
针对以总完工时间最小为目标的流水调度问题,提出一个复合禁忌搜索算法(Hybrid Tabu Algorithm,HTB)。提出算法以启发式算法的结果作为初始解,然后采用禁忌搜索算法对其进行改进,并将提出算法与三个已有的启发式算法RZ、WY和FL进行比较。实验结果表明:在最好调度的获取能力和所得调度的平均质量方面,HTB算法均为最优。
In this paper, a hybrid tabu algorithm（HTB） is proposed for flow shop schedule problem with total flowtime minimization. The initial solution of HTB is obtained by the FL algorithm, and the initial solution is improved by the tabu algorithm. HTB is compared with three existing heuristic algorithms RZ （described by Rajendran ＆ Ziegler）, WY（ developed by Woo ＆ Yim） and FL（proposed by Frarninan ＆ Leisten）. Computational results show that HTB is the best in ARPD and OPT among the compared algorithms.
出处
《电机与控制学报》
EI
CSCD
北大核心
2007年第6期672-675,共4页
Electric Machines and Control
基金
哈尔滨师范大学校基金资助项目(K2006022)
关键词
组合优化
禁忌搜索
调度
总完工时间
combinational optimization
tabu
scheduling
total flowtime
