摘要
本文描述了一种解决车间作业调度最短完工时间问题的有效禁忌搜索算法,建立了该问题的数学模型,并提出了新的邻域构造方法。该算法利用改进的插入算法构造尽可能好的初始解,然后使用禁忌搜索算法改进当前解。实验结果表明该算法是可行和有效的。
An effective heuristic algorithm for solving the minimum makespan problem of job shop schecluling is presented in this paper, a model of JSSP is built, and a new generation method of neighbourhood is introduced. The taboo search algorithm generates a good feasible initial solution by using improved the insertion algorithm, and improves the initial solution. Finally the experiment results show that the algorithm is applicable and effective.
出处
《信息技术与信息化》
2011年第3期77-80,共4页
Information Technology and Informatization
