关键词: 作业车间调度 遗传算法 自适应遗传算法

Abstract:

The job-shop scheduling problem （JSSP） is one of the most difficult combinatorial optimization problems, and it is also a typical NP-hard problem. G    A（Genetie Algorithm）, as a current optimized algorithm, has been used widely for JSP. In order to solve the problem of job-shop scheduling, and accordding to the condition of population evolution, this paper presents a new adaptive algorithm with a new crossover and mutation method based on the improv  ed genetic algorithm, and realizes a multi-population crossover in order to keep the population＇s diversification.

Key words: job-shop scheduling, genetic algorithm, adaptive genetic algorithm