查询词典 scheduling problem

In this paper, we consider a type of modern scheduling problem in which some tasks are processed on more than one processor at a time. We call this kind of problem Two-stage Multi-processor Flow shop.

本文研究了生产系统中的一种特别类型的可同时加工条件下的现代排序问题----分装式流水作业复合并行机排序问题。

Scheduling problem is a kind of important combination optimization problem.

排序问题是一类重要的组合最优化问题。

Since vehicle scheduling problem is NP-hard,parallel genetic algorithm is proposed to solve this problem.

由于车辆调度问题属于NP难问题，提出了采用遗传算法对问题进行求解。

An improved scheduling method based on exponential division of deadline is presented after study on the problem of prevenient average division of deadline method in this paper.The paper also proves when the relative deadline of each node is too large,the schedular performance of messages transmission task using average division of deadline will be decreased by introducing notion of quantization cost.The new method solves the problem well,and digital simulation validate the new method.

摘 要：针对平均分区的EDF算法在CAN总线中的应用出现的问题，本文提出了一种改进的基于指数分区的EDF算法，并通过引入量化误差的概念，推导证明当CAN网络中各节点相对截至期分布时间过大时，平均分区的EDF算法会导致CAN总线中信息传输任务可调度性的下降，而基于指数分区的EDF算法保证了信息传输任务的实时性，仿真试验验证了算法的有效性。

The example and implementation of the algorithm are also provided.Thirdly, with respect to DVSPPD (Dynamic Vehicle Scheduling Problem withPick-up and Delivery), we build the mathematical model and exploit the corresponding two-phase algorithm. In addition, we consider the problem of combinable tasks, and design a strategy based on grouping policy to solve it.

对动态集送货一体化问题，本文也构建了相应的数学模型，并设计了两阶段的求解算法，并在随后对可拼装的动态集送货一体化问题，本文以分组策略为基础，详细设计了问题的求解策略。

The scheduling problem of visual MES for the process of assembly is a typical multi-objective optimization problem.

面向装配过程的可视化MES的调度问题是一个典型的多目标优化问题。

First,how to map the resource assignment and task scheduling problem into the optimization selection problem of task resource assignment graph and to add the semaphore mechanism in the optimal TRAG to solve deadlocks are explained.

首先阐述了如何将分配调度问题映射到任务资源分配图的优化选择问题上和如何将信号量机制引入到最优任务资源分配图中来解决死锁问题。

Examples of open-shop problem include health examination and the operation of car maintenance. Scheduling problem with no-wait constraints occur in many industries. For instance, in hot metal rolling industries, where the heated metal has to undergo a series of operations at continuously high temperatures before it is cooled in order to prevent defects.

生产过程中的排序往往受到产品生产的特性或者生产技术的限制，所以会产生不同的约束情况，例如：无等待时间是化学、石油工业和冶金工业的特色；阻塞指的是缓存能力受到限制或者没有缓存的情况，最常见的是利用机器人进行夹取工件的作业。

Firstly, on the basis of defining the characteristics of project and reviewing the mathematical models for RCPSP, we constructed the mathematical model for RCPSP under the condition that there is non-fixed duration and splittable tasks in project; In order to solve above model, we emphatically discussed the basic principle of the swarm intelligence algorithm--the particle swarm optimization algorithm as well as improvement research for current algorithm, and then proposed a new improved particle swarm optimization algorithm and analyzed its application process in the resource-constrained project scheduling problem; Lastly, in order to confirm the validity of the model and the algorithm, we took an experiment based on 108 instances that produced by problem instance generator which was developed by our team.

首先，在对RCPSP项目特征进行界定以及对项目进度优化模型回顾的基础之上，构建了基于活动工期不固定、任务可拆分特征的RCPSP的数学模型；为了求解上述模型，本文详细阐述粒子群优化算法(Particle Swarm Optimization，PSO)的基本原理以及当前对其改进的研究成果，提出了一种新的改进PSO算法，并对其在RCPSP的应用过程进行了设计；最后，为了检验模型的有效性及算法的优越性，基于梯队内部开发的案例生成器生成的108个算例，进行了仿真试验。

There are series of papers studying the solvability of an incompressible, viscous, instationary fluid contained in a domian bounded entirely by a free surface. In 1977, Solonnikov proved its local solvability in a Holder space for any initial date but without surface tension. In 1984, he considered the same problem in a Sobolev space with surface tension being taken into account. In I992, Mogilevskii and Solonnikov treated the same problem in a Holder space, where the coefficient of surface tension is not a constant. There are also short-time existence results for the solvability of an incompressible, vicous, unsteady fluid bounded above by a free surface and below by a fixed bottom which approach horizontal planes at infinity. In 1981, Beale proved its local solvability in a Sobolev space for any initial date but without surface tension. In 1983, Allain were concerned with the same problem in R〓 with surface tension but under the assumption that the initial fluid domain was near a horizontal strip. In 1987, he obtained the same result without the preceding assumption. In 1996, Tani solved the same problem in R with surface tension. For the solvability of an incompressible viscous instationary fluid in Ω R bounded inside by a free surface S and outside by a rotating boundary S, in 1995 Ciuperca proved its local existence in a Sobolev space for any initial date but without surface tension. In this paper, we consider the same problem with surface tension.

对于边界完全是由自由边界组成的有界区域中粘性不可压流体的非定常运动问题，Solonnikcv于1977年在忽略表面张力情况下证明了初值问题小时间解在Holder空间的存在性，于1984年在有表面张力情况下证明了初值问题问题小时间解在Sobolev空间的存在性，Mogilevskii和Solonnikov于1992年在表面张力系数可以不是常数情况下证明了初值问题小时间解在Holder空间的存在性；对于上面是自由边界、下面是固定边界且两边界在无限处趋于水平的无限区域中粘性不可压流体的非定常运动问题，Beale于1981年在忽略表面张力情况下证明了初值问题小时间解在Sobolev空间的存在性，Allain于1983年在有表面张力情况下证明了R中初值问题小时间解在Sobolev空间的存在性，但其中假定初始区域近似是个水平条，他于1987年去掉了这个假定得到同样的结果，Tani于1996年在有表面张力情况下证明了R中初值问题小时间解在Sobolev空间的存在性；对于R中内面是自由边界、外面是旋转边界S的有界区域中粘性不可压流体的非定常运动问题，Ciuperca于1995年在忽略表面张力情况下证明了初值问题小时间解在Sobolev空间的存在性，本文考虑了在有表面张力情况下初值问题可解性问题。

"Second Life is remarkably easy to work with, and is very popular,"

"第二次生命是显着容易的工作，并且很受欢迎，"

For example, we usually assume that materials are homogeneous and isotropic and free of internal defects or flaws.

为了得到适合有限元分析的模型，我们必须经过如图2所示的简化步骤。