在该研究领域里，它属于非标准型的的作业车间调度问题。
In this research field, it is a none-standard Job Shop Scheduling Problem.
基于交货期的模具车间作业调度问题是解决不同类型工件的加工排序，使其误工最少。
The mould manufacture scheduling based on due date is a problem of how to schedule operation processing sequence to minimize tardiness.
因此，寻找有效的方法对柔性作业车间调度问题进行求解具有重要的理论价值和应用意义。
Thus, seeking the effective methods used to solve flexible job shop scheduling has important theoretical and applied significance.
作业车间调度是制造系统的一个研究热点，也是理论研究中最为困难的问题之一。
As a popular research realm in manufacture system, Job Shop Scheduling is one of the most difficult problems in theoretic.
提出了用于解决作业车间调度问题的离散版粒子群算法。
A discrete Particle Swarm Optimization (PSO) algorithm was presented for Job Shop scheduling problem.
在研究作业车间模糊调度问题的基础上，建立了两种作业车间模糊调度模型。
Two kinds of model are formulated based on the studies of job shop fuzzy scheduling problem.
针对作业车间调度问题，提出了最小化空闲时间的处理过程及其变异算子，设计了一种自适应遗传算法。
Classic scheduling benchmark problem test shows:the self-adaptive measure can efficiently keep current populations diversity, can use very small population size; shortest idle time .
车间作业调度系统的应用车间是HTC叶片车间，本章分析了其现有调度方法和模型的特点和存在问题。
Based on the traits of the vane workshop of HTC, this chapter analyses the traits and present problem of the present scheduling system.
车间作业调度问题是一类带有约束的典型的组合优化问题，目前采用人工鱼群算法解决车间作业调度问题没有检索到参考文献。
Job shop scheduling problem is one of the typical combinatorial optimization problems with constraints. To get its encoding has always been one of the main and difficult points of the problem.
提出了用于解决作业车间调度问题的离散版粒子群算法。
This paper proposes a method of adaptive neural network based on constraint satisfaction for Job Shop Scheduling Problem.
车间作业调度研究属于组合优化范畴，是典型的NP难问题，对它的研究具有重大的理论意义和现实意义。
The job-shop scheduling research belongs to the combination optimization category, it is the typical NP difficult question, its research has great theory significance and practical significance.
首先，针对经典作业车间调度问题的局限性，结合车间生产的实际情况，研究建立了有限能力作业车间调度模型。
Firstly, direct against the limitation of classical job-shop scheduling, combine the actual conditions of the workshop, deployment model of finite capacity job-shop scheduling.
车间作业调度问题是一类具有时间约束、次序约束和资源约束的组合优化问题。
The Job shop scheduling problem is a combinatorial optimum problem that is constrained with time, sequence and resource.
第二类问题为具有预防性维修的模糊柔性作业车间调度问题。
The second problem is the fuzzy flexible job shop scheduling problem with preventive maintenance.
为了更好的解决作业车间调度问题，各种智能计算方法逐渐被引入到调度问题求解中。
In order to better solve the problem of workshop scheduling, a variety of intelligent computation methods have been gradually introduced to the solve of workshop scheduling.
多种时间因素作业车间的调度问题正越来越受到研究人员和技术人员的重视，成为研究的热点和重点。
The JSP with multi-time is paid more and more attention by the researchers and technologists, and it is becoming the focus and emphasis of research.
在作业车间调度问题中，存在大量的不可行调度解，严重影响了遗传算法查找最优调度的质量。
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.
建立了针对柔性作业车间的动态调度问题数学模型和目标函数。
To study the flexible job shop scheduling problem, the author builds mathematical model and establishes objective functions for flexible job shop dynamic scheduling.
研究了并行遗传算法在车间作业调度问题中的应用，通过对传统的迁移策略进行改进，给出了运用该算法求解车间作业调度的具体过程。
This paper presented a scheduling approach developed to address the scheduling problem of small batch and multiple process routes in job shop environment.
研究了并行遗传算法在车间作业调度问题中的应用，通过对传统的迁移策略进行改进，给出了运用该算法求解车间作业调度的具体过程。
This paper presented a scheduling approach developed to address the scheduling problem of small batch and multiple process routes in job shop environment.
应用推荐