摘要
针对目标为总完工时间的FlowShop调度问题,提出了一个启发式算法与禁忌搜索算法相结合的混合禁忌搜索算法HTA(Hybrid Tabu Algorithm):将RZ算法的结果作为初始解,然后采用禁忌搜索算法对其进行改进.实验结果表明:在最好调度的获取能力、所得调度的平均质量及算法的稳定性方面,HTA算法均是最优的.
In this paper,hybrid tabu algorithm HTA is proposed for flow shop with total flowtime minimization.An initial solution is obtained by the RZ algorithm and improved by a tabu algorithm.HTA is compared with other existing heuristic algorithms RZ and WY.Computational results show that HTA is the best in STD and OPT among the compared algorithms.
出处
《哈尔滨师范大学自然科学学报》
CAS
2007年第3期59-61,共3页
Natural Science Journal of Harbin Normal University
基金
哈尔滨师范大学校基金项目(K2006022)资助
关键词
组合优化
禁忌搜索
流水车间
调度
总完工时间
Combinational Optimization
Tabu
Flow Shop
Scheduling
Total Flowtime
