job-shop scheduling

基本解释

Job-shop Scheduling Problem is a typical NP problems, which is one of the hardest combinatorial optimization problem.
作业车间调度问题是一个典型的NP 难问题，是最困难的组合优化问题之一。
A genetic algorithm with master-slave structure was proposed to solve the flexible Job-Shop scheduling problems based on the analysis of jobs, machines and their relationships.
通过分析柔性作业车间调度问题中工件与设备的特征及两者间的关系，提出了一种主-从遗传算法的调度方案。
To overcome the limitations of traditional Genetic Algorithm (GA) when solving the problem of job-shop scheduling, an improved GA was proposed by taking advantages of traditional GA and local search.
为克服传统遗传算法解决车间作业调度问题的局限性，综合遗传算法和局部搜索的优点，提出一种改进的遗传算法。

车间调度
Job-shop scheduling problems are not only an important issue in practical production of manufacturing system but also one of the difficulties of theoretic research. It has large practical significance and theoretical value.
车间调度问题既是制造系统实际生产的重要问题,也是理论研究的难点之一,具有很大的实用意义和理论价值。
管理学
作业安排调度