scheduling problem

scheduling problem的基本解释

-

[计] 调度问题

与scheduling problem相关的网络例句 [注：此内容来源于网络，仅供参考]

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测试时间。

Thirdly, we examine a job scheduling problem, in which jobs could be processed by multiple in-line steppers. This problem includes two decisions: job assignment and job sequencing. Through developing a new and concise representation scheme for modeling the two decisions, we solve the multiple-machine scheduling problem by various meta-heuristic algorithms. The preceding single-machine scheduling problem in fact is a special case of the multiple-machine scheduling problem.

第三部分探讨在多机情境下，求解工件排程问题，在此情境下产生两个决策变数：工件指派给各机台，以及工件在机台内的排序问题；为了解决此问题，本研究透过新的染色体设计，能同时代表此两个决策变数，使得解题空间变小，求得更好的解题品质。

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概念模型的、集成强化学习机制的合同网协议和改进过滤定向搜索算法的自治与协商智能调度技术，以提供实用有效的求解方法、改善柔性制造车间适应内部动态环境和外部市场快速变化的能力。

与scheduling problem相关的网络解释 [注：此内容来源于网络，仅供参考]

Scheduling problem：排程问题

之前在>里面提到了Job-Shop Problem是一个很难的排程问题 (Scheduling Problem),是NP-complete. 本篇就简单介绍一下搜寻演算法、「旅行中的商人」这个问题如何使用搜寻演算法、NP-complete的定义、以及最后提一下对偶问题(Dual Problem).

Scheduling problem：调度问题

有效地解决了机器人定位这一非线性非高斯状态估计问题.模拟退火算法的应用很广泛,可以较高的效率求解最大截问题(Max Cut Problem)、0-1背包问题(Zero One Knapsack Problem)、图着色问题(Graph Colouring Problem)、调度问题(Scheduling Problem)等等.

Scheduling problem：等问题

scheduling algorithm 等算法 | scheduling problem 等问题 | scheduling theory 等理论

Scheduling problem：排课

排序:Scheduling | 排课:Scheduling problem | 告警:Scheduling Algorithm

Vehicle scheduling problem：车辆调度优化

价值评估:Vehicle scheduling problem | 车辆调度优化:Vehicle scheduling problem | 车辆调度:vehicle routing and scheduling problem