车间作业调度问题是一类具有时间约束、次序约束和资源约束的组合优化问题。
The Job shop scheduling problem is a combinatorial optimum problem that is constrained with time, sequence and resource.
在此基础上，本文尝试将缩短空闲时间法应用到多作业动态车间作业调度问题上。
The purpose of this paper is using the algorithm to solve the dynamic Job shop scheduling problems.
基于交货期的模具车间作业调度问题是解决不同类型工件的加工排序，使其误工最少。
The mould manufacture scheduling based on due date is a problem of how to schedule operation processing sequence to minimize tardiness.
在分析车间作业调度问题的数学模型的基础上，给出了：（1）采用分段结构的染色体编码思想；
Through analyzing the mathematical model of JSP, the authors put forward:(1)the coding idea of subsection chromo-some structure;
车间作业调度问题是一类带有约束的典型的组合优化问题，目前采用人工鱼群算法解决车间作业调度问题没有检索到参考文献。
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 presented a scheduling approach developed to address the scheduling problem of small batch and multiple process routes in job shop environment.
车间作业调度研究属于组合优化范畴，是典型的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.
车间作业调度系统的应用车间是HTC叶片车间，本章分析了其现有调度方法和模型的特点和存在问题。
Based on the traits of the vane workshop of HTC, this chapter analyses the traits and present problem of the present scheduling system.
车间作业调度系统的应用车间是HTC叶片车间，本章分析了其现有调度方法和模型的特点和存在问题。
Based on the traits of the vane workshop of HTC, this chapter analyses the traits and present problem of the present scheduling system.
应用推荐