There are a number of unfeasible scheduling solutions in the Job-shop Scheduling Problem (JSP), it seriously affects the quality of Genetic Algorithms(GA) searching for the best solution.

There are a number of unfeasible scheduling solutions in the Job-shop Scheduling Problem (JSP), it seriously affects the quality of Genetic Algorithms(GA) searching for the best solution.

摘要在作业车间调度问题中，存在大量的不可行调度解，严重影响了遗传算法查找最优调度的质量。