一种启发式混合遗传算法及其在车间作业排序问题中的应用

A KIND OF HYBRID HEURISTIC GENETIC ALGORITHM WITH APPLICATIONS TO JOB SHOP SCHEDULING

针对一般车间作业排序问题（ｎ／ｍ／Ｇ／Ｃｍａｘ）建立了一种启发式混合遗传算法，将调度规则ＳＰＴ与ＭＷＫＲ引入遗传搜索过程，并应用邻域搜索法作局部辅助搜索，以提高解的性能。通过与目前一些常用算法的比较表明，该算法具有良好的求解性能与运算效率。

A kind of hybrid heuristic genetic algorithm is introduced for the job shop problem n/m/G/C max , in which the scheduling rules of SPT and MWKR are applied, and the neighbourhood search technique (NST) is adopted as an auxiliary procedure to improve the solution performance. The new algorithm is proved to be both effective and efficient by the comparison with some methods in common use at present.