查询词典 optimization of scheduling

Some methods aiming at the two problems have been researched. First, the optimal number of ATE site can be calculated based on a cost model of DAT-ATE. Second, the problem of test schedule which is equitant with two-dimensional Bin-Packing problem is presented. Then a TCG denotation satisfied with T-admissible rule is more convenient for combinational optimization. With Simulated annealing algorithm, better test scheduling results can be achieved; but there is no great optimization space because the efficiency of scheduling is greater than 90%. Third, A novel test compression method——Multi-capture testing is proposed to compress the stimuli. And the ATPG results show that MC achieves high compression ratio which is greater than 90% in some large-scale circuits. MISR, widely used in LBIST, is employed to compress the responses. The aliasing analysis demonstrates that the fault coverage reduction is little due to the existence of aliasing. Fourth, an improved TIC (called S-TIC) aiming at structured test is proposed based on ARM's TIC. A MC scheduling algorithm is proposed to compute the SoC test time and combine MC vectors to SoC test vectors. The scheduling results shows that test time is greatly reduced when using the proper scheduling priority.

首先，给出了低成本ATE的成本模型，根据此模型得到最低测试成本时系统级测试调度的基本参数——测试Site数；其次，本文将DAT-Scan方式的SoC测试调度等价为两维BP问题，为有效地求解该问题，将该BP问题表示为TCG图并通过模拟退火算法解决其求解过于复杂的问题，调度的结果表明该方法在测试时间上有一定改善，并指出DAT-Scan测试调度效率已经大于90％，进一步优化的空间较小；第三，本文尝试通过测试压缩来解决激励所需的测试带宽，提出了Multi-capture结构并解决了MC测试过程中的&矢量&退化问题，MC测试的ATPG结果表明其测试压缩率很高（大电路接近90％）；第四，在激励获得很高压缩比的情况下，测试响应也需压缩，本文采用LBIST中常用的MISR作为MC测试的响应压缩电路，理论分析和实验结果都证明了MC测试的别名对故障覆盖率影响较小（小于2％），并对两类别名的成因做了具体分析；第五，在MC测试及其响应压缩的基础上，本文改进了ARM公司的测试控制器TIC使之适合于MC测试，为了解决MC测试矢量合成问题，本文抽取了MC测试模型，通过固定优先级的MC测试调度模拟将MC矢量合成为ATE矢量，并模拟出了总的MC测试时间。

To provide effective and efficient solutions to the scheduling problems in discrete job shop with multiple cells each having flexible process routings, this dissertation presents a Holon-based autonomic and coordinated intelligent scheduling technique, which is integrated with reinforcement-learning-based contract net protocol and modified filtered-beam-search algorithms, based on the recent researches in Agent or Holon-based decentrated production scheduling. The proposed intelligent scheduling technique is studied based on the key techniques of Agent or Holon-based autonomic and coordinated scheduling, i.e., encapsulation of entities, the control architectures, coordinated mechanism and core autonomic algorithms.

本论文在充分吸收近十余年间基于Agent或Holon的非集中式生产调度最新研究成果基础上，以具有生产加工柔性的、多单元、离散作业型制造车间为研究对象，围绕基于Holon的协商与自治调度关键技术(实体封装、控制体系结构、协商机制和核心算法)展开研究，提出了基于Holon概念模型的、集成强化学习机制的合同网协议和改进过滤定向搜索算法的自治与协商智能调度技术，以提供实用有效的求解方法、改善柔性制造车间适应内部动态环境和外部市场快速变化的能力。

This dissertation fistly introduces appearance, definition, development process, functions and status of MES, also analyses methods and existent problems of MES production scheduling; as follow, in the background of CY_MES (a enterprise's Manufacturing Execution System), introduces main function and buildup of its support platform– SIMATIC IT, and whole structure of CY_MES; afterwards, for special production instance of the enterprise, designs production scheduling system software structure, function structure, data structure of order and entry and realization of silk production and packing production scheduling based on SIMATIC IT; finally, after contrast of many modeling methods and careful research of silk production flow of the enterprise, selects Petri net to model the silk production scheduling, for the sake of avoiding many error chromosomes, improves on the basic genetic algorithm, uses sigle unit genetic algorithm to optimize the Petri net model, lists the contrast of scheduling results.

本文首先介绍了MES的产生、定义、发展历程、功能及其发展现状，同时也分析了MES生产调度问题的各种解决方法及其存在的问题；接着以CY_MES为背景介绍了其支撑平台——SIMATIC IT平台的功能及其各组成部分，以及CY_MES的SIMATIC IT整体解决方案；紧接着在SIMATIC IT平台基础上，针对该烟厂的生产实际情况，设计了CY_MES生产调度系统的软件结构、功能结构、工单和子工单的数据结构和制丝与卷包生产调度的实现方式；最后，在比较了各种生产调度建模方法的利弊和对该烟厂制丝生产工艺流程深入研究后，利用Petri网建立了制丝生产调度模型，为了避免大量无效个体的出现，对基本遗传算法进行了改进，采用单个体遗传算法对这个Petri网模型进行了优化，并给出了调度结果的对比。

In this paper, a Robust Discrete Optimization model of elevator group control system is presented for dealing with the uncertainty in elevator traffic flow and computational complexity in scheduling. Based on RDO theory, we propose a new elevator group scheduling Algorithm. Comparison is carried between the RDO algorithm and other scheduling algorithms under the virtual simulation platform of elevator group scheduling.

针对电梯群控调度过程中交通流的不确定性和优化求解复杂性问题，本文通过建立电梯群控调度系统的鲁棒离散优化模型，实现了一种基于鲁棒离散优化理论的新的电梯群控优化调度算法。

This dissertation studies manufacturing shop production scheduling model, and expatiates the relation of yield plan and production scheduling,and lucubrates shop production scheduling characteristics,and proposes the enterprise\'s shop production scheduling model which is based on optimization algorithm.

1论文研究了制造业生产调度体系，分析了生产计划和生产调度的相互关系，深入研究了制造业生产调度多种模式和特点，针对企业现行控制生产进度的方法，建立了基于优化算法的生产调度模型，并给出了基于优化算法的生产调度系统设计实现步骤。

On the other hands, the application of the particle swarm optimization algorithm in discrete optimization problem—resources constrained project scheduling problem, which is always used in continuous optimization problem, provides some important train of thought and method for resources constrained project scheduling problem as well as widening the application area of particle swarm optimization algorithm.

同时将在连续优化问题中得到成功应用的PSO算法用于离散域的RCPSP，既拓展了PSO算法的应用领域，也为RCPSP的求解提供了一种新的思路和方法。

The traditional query tree optimization methods,parallel database optimization methods based on left linear trees and right linear trees,bushy trees,and operation of the forest,have their own pros and cons,they have been more in-depth and maturity of the study.The query optimization method based on multiple weighted tree has studied its model of parallel query plan,its complexity model of parallel query plan and query optimization algorithms.The semantic query method transforms an inquiry into one or several semantic equivalence inquiries then has to find and implement a strategy to achieve a better query.Agent-based parallel database query optimization using Multi-Agent technology to automatically search the integrity constraint conditions which are related to the determined query,there for,the efficiency between several relations' joins has been greatly improved.The parallel optimization algorithm,based on genetic algorithm which is suitable for multi-joins of cluster environment,has deeply studied the relations storage options,multi-joins query optimization and query processing and other key technologies based on cluster parallel database.

传统的查询树优化方法，即基于左线性树、右线性树、浓密树、操作森林的并行数据库查询优化方法，各有优劣，对其的研究比较深入、成熟；基于多重加权树的查询优化方法，研究了其并行查询计划模型、并行查询计划的复杂性模型和查询优化算法；语义查询优化方法将一个查询变换成一个或数个语义等价的查询，进而寻找并执行这些等价查询中具有较好实现策略的一个；基于Agent的并行数据库查询优化采用Multi-Agent技术自动查找与给定查询有关的完整性约束条件，使得多个关系间连接操作的效率得到很大的提高；基于遗传算法的并行优化算法，深入研究了基于机群并行数据库中关系存储的选择、多连接查询优化和查询处理等关键技术。

There exits several MDO algorithms. But they are in our opinion either nonefficient or complicated. So we devised an algorithm called Subspace Approximation Optimization . In the SAO algorithm, the whole system is decomposed into one system-level optimization and several disciplinary optimizations so that a large and complicated problem can be divided into several easy-solving sub-problems. The coupling relationships and the coordination among disciplines are presented by equality constraints and these equality constraints are assigned to relevant disciplines. The optimums of design variables in system level optimization are transferred to discipline level optimization. The optimums of design variables in discipline level correspond to the point that is the nearest to the optimums of design variables in system level. If the optimums of design variables in system level are out of feasible region of discipline 1eve1, linear constraints can be built in the system level optimization using the design variable optimums obtained by the discipline level optimization. The system level optimization would improve the design of the whole system with these linear constraints.

目前，国内外已经发展出了多种飞机多学科设计优化算法，本文的重点是针对协同优化算法的不足，提出了子空间近似优化算法(Subspace ApproximatingOptimization，SAO)，SAO算法中，整个系统的优化问题被分解成一个系统级优化和若干学科级优化，而各个学科之间的耦合与权衡关系则被当作等式约束，这些等式约束将被分配到各个学科级优化中去，系统级优化的任务是寻找整个系统的最优解，而学科级优化的目标函数是以系统级优化分配下来的设计点为圆心的超球半径的平方，因此，如果系统级优化分配下来的设计点在学科级优化可行域内，则学科级优化目标函数为0，反之，则学科级优化的最优点是系统级优化当前设计点距离可行域最近的点。

In this paper, no-wait flow shops scheduling problems for a mixed discrete particle swarm optimization, through the establishment of the location of the vector encoding and scheduling program of mapping relations between the continuous particle swarm optimization algorithm is applied to discrete no-wait flow shops scheduling problem.

针对无等待流水线调度问题提出了一种混合离散化粒子群优化算法。通过建立位置矢量编码与调度方案之间的映射关系将连续的粒子群优化算法应用于离散的无等待流水线工件调度问题。

A single machine scheduling problem with batchs setup time depending on sequence is proposed. The math model to minimize setup times is upbuilt. An improved adaptive hybrid genetic algorithm is brought up for solving this scheduling problem. Several operators are redesigned according to the characteristic of this scheduling problem. Follow job optimization recombination crossover is advanced for transmitting the good character to the offspring. To improve the mountain climbing ability of the genetic algorithm, the mutation is replaced by a local optimization algorithm.

提出了一种具有序依赖setup time的单机器批量生产调度问题，以总的setup time最小为目标建立了该生产调度问题的数学模型，设计了一种改进的自适应混合遗传算法求解该生产调度问题，对遗传算法的交叉和变异算子均按照该调度问题的特点进行了改进，提出一种&紧后任务选优重组交叉算子&，该算子能将调度排序上的优良性状很好地遗传到下一代群体中。

You can do some assertiveness training.

你可以进行一些自信训练。

We were well on the path to making a rear-wheel-drive global platform," says Mays."

我们正致力于建立一个后轮驱动的平台，"Mays这样说道。"