从好几个方面描述了os的作业调度问题。
From several aspects described OS operations scheduling problem.
流水作业调度问题在理论和实践方面均是一个著名的难题。
Flow-shop scheduling problem is known to be notoriously intractable, both in theory and practice.
本文主要研究两阶段越库物流作业调度问题及其算法设计。
This paper studies the so called two-stage cross docking logistics scheduling problem and its algorithms.
实验表明本文提出的共生算法能够很好地解决柔性作业调度问题。
The experimental results show the proposed symbiotic evolutionary algorithm can solve FJSP well.
车间作业调度问题是一类具有时间约束、次序约束和资源约束的组合优化问题。
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.
针对供应链网络优化领域中的混合流水作业调度问题提出了一种新的多目标演化优化算法。
A new evolutionary algorithm for solving multi-objective hybrid flow shop scheduling problem(HFSP) which is an important topic in supply chain network optimization is presented.
在分析车间作业调度问题的数学模型的基础上，给出了：（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.
作业车间调度是制造系统的一个研究热点，也是理论研究中最为困难的问题之一。
As a popular research realm in manufacture system, Job Shop Scheduling is one of the most difficult problems in theoretic.
无论是在集群环境下还是在网格环境下，作业调度都关系到了高性能计算的性能，是一个相当重要的问题。
In cluster computing and Grid computing environment, job schedule is related to the performance of system, and it is a very important issue.
提出了用于解决作业车间调度问题的离散版粒子群算法。
A discrete Particle Swarm Optimization (PSO) algorithm was presented for Job Shop scheduling problem.
因此，寻找有效的方法对柔性作业车间调度问题进行求解具有重要的理论价值和应用意义。
Thus, seeking the effective methods used to solve flexible job shop scheduling has important theoretical and applied significance.
车间调度是一类作业排序问题，对于在现有资源条件下提高工作效率和经济效益有重要作用。
The job scheduling is a kind of job sequencing and important to advance work efficiency and economic performance.
针对作业车间调度问题，提出了最小化空闲时间的处理过程及其变异算子，设计了一种自适应遗传算法。
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 .
提出了用于解决作业车间调度问题的离散版粒子群算法。
This paper proposes a method of adaptive neural network based on constraint satisfaction for Job Shop Scheduling Problem.
在研究作业车间模糊调度问题的基础上，建立了两种作业车间模糊调度模型。
Two kinds of model are formulated based on the studies of job shop fuzzy scheduling problem.
成组作业优化调度问题中的作业根据其加工特点要求可分成若干作业类。
In the grouping jobs scheduling optimal problem, jobs are divided into several job classes according to their processing characters.
成组作业优化调度问题中的作业根据其加工特点要求可分成若干作业类。
In the grouping jobs scheduling optimal problem, jobs are divided into several job classes according to their processing characters.
应用推荐