用于求解单机调度问题的混合禁忌搜索算法

Hybrid Tabu Search Algorithm for Solving Single Machine Scheduling Problem

针对工件不同释放时间和实际加工时间之和的学习效应情况,研究单机调度总完工时间最小化问题。根据问题的NP-hard特性,证明2个优先规则,结合禁忌搜索算法与优先规则,提出一个混合禁忌搜索算法,提高了算法跳出局部最优的能力,既保留了优异的基因又扩大了领域的搜索范围。实验结果表明,与基准算法相比,该算法在求解质量上有更好的表现,而且随着工件规模的增加优势更加明显。

A single machine scheduling problem with sum of actual processing times dependent learning effect and unequal release time consideration is investigated where the objective is to minimize the total completion time. According to the NP-hard characteristic of the problem, two dominance rules are developed, comined with Tabu Search （TS） algorithm and priority rule, this paper proposes an algorithm of hybrid TS algorithm, which improves the ability of jumping out of the local optimal trap, both retains the excellent gene and expands the scope of the search area. Experimental results demonstrate that the proposed hybrid Tabu search algorithm has a better performance than the benchmark algorithms in the literature and the advantage becomes more obvious with the number of jobs increasing.