用定界-遗传算法解Job-shop调度问题

Solving Job-shop scheduling problem using bounding and genetic algorithm

首先提出工件序编码方法和相应的解码策略，然后介绍定界－遗传算法的概念及运行机理，并对死锁问题的判定作了讨论。实验结果表明，定界－遗传算法比典型遗传算法收敛速度快，效果好。

An encoding method of job order and a decoding one are presented in this paper,the definition of Bounding and Genetic algorithm(BGA) and its working mechanism are introduced and the judgement of deadlock in an individual is discussed. The results show that theBGA is better and can converge faster than canonical genetic algorithm.