然后对最优参数进行辨识，从而优选出最优调度规则。
The optimal dispatch rule is identified by solving a stochastic optimal model for cascade reservoir dispatch.
而在这个系统中，最优调度是极其重要的一个组成部分。
And in this system, the optimal dispatch of the fire fighting force is a very important part.
该算法可以实现子任务集在DAG图限制下的最优调度。
Optimal scheduling can be realized in the restriction of DAG in this algorithm.
寻求水库最优调度轨迹过程线是水库优化调度中的经典、难点问题。
It is a classic and difficult issue to find the reservoir optimal scheduling process.
同时，通过对多处理机任务之间的并行关系的分析，得到了一般最优调度的下界。
At the same time, through the analysis of the parallel relation among the multiprocessor parallel job, the low bound of the optimal schedule has been provided.
本文的结果是该问题在加工时间扰动下最优调度具有区间摄动鲁棒性的三个充分必要条件。
The results are three if and only if conditions under which an optimal schedule is of interval perturbation robustness.
在作业车间调度问题中，存在大量的不可行调度解，严重影响了遗传算法查找最优调度的质量。
There are a number of unfeasible scheduling solutions in the Job-shop scheduling Problem (JSP), it seriously affects the quality of Genetic Algorithms (GA) searching for the best solution.
采用第二价格竞拍规则作为资源分配策略，满足了网格对分配系统可扩展性和全局最优调度的需求。
Secondly, a market model of resources allocation in computer grids is given, use the vickery auction algorithm …
在对实时多任务流系统进行统计分析的基础上，提出了一种嵌入JIT思想的立即抢先最优调度算法。
While the just-in-time (JIT) scheduling algorithm can ensure tasks' time limits, but it is unfit to work for multitasks systems.
搜索树的每一节点对应一个RCPSP，通过求解各节点rcps P来求得rl P的最优调度计划。
Every node in search tree corresponds a RCPSP, and the RCPSP is solved to obtain schedule for the RLP.
变序集上周期最小的最优控制可以转化为一个求解旅行推销员问题，而最优调度恰好是一类特殊的最优控制。
The optimal control of minimal period on the changing order set can be transferred into the calculation for problem of trip salesman, and the optimal arrangement is a special optimal control.
在预调度建模期间使用机会约束把不确定因素包含到模型中，在满足一定稳定度的前提下，寻求最优调度方案；
Uncertain information was added to the pre-scheduling model as chance constraints before optimal scheduling result that was researched with scheduling stability above some level was attained.
在一个典型的集群上，会有很多用户都要运行自己的程序，我们必须使用调度软件来确保它们可以最优地使用集群。
On a typical cluster, multiple users will want to run their programs, and you must use scheduling software to ensure optimal use of the cluster.
它为集群资源的最优化利用提供了动态调度和工作负载均衡的功能。
It provides dynamic scheduling and workload balancing for optimum utilization of cluster resources.
由于计划调度问题本身的复杂性，很难寻求到最优解。
It is very difficult for solving the planning and scheduling problem because of its complexity.
为了提高查询处理器的执行效率，采用启发式规则来搜索最优的多连接表达式并行调度执行计划。
To improve the execution efficiency of the query processors, the authors exploit heuristics to seek the optimum parallel scheduling execution plan for multi-join expressions.
最后，选取一对梯级水库的调度问题，以随机最优控制理论和方法进行了实际求解。
Finally, one pair of cascade reservoir scheduling problem selected as an example, the practical solution is introduced by random optimal control theory and method.
TT CAN周期性任务调度是最优装载问题的推广，它在通信时间关键的实时分布式系统中有着很强的应用背景。
As the extension of the optimal loading problem, periodic task scheduling of TTCAN has many important applications in real-time distributed systems that are communication time critical.
仿真实验表明，同步调度算法得到的覆盖集的大小为异步调度算法的76%左右，平均覆盖度接近理想最优情况。
Simulations showed that size of cover set obtained by synchronous scheduling algorithm is 76% of asynchronous scheduling algorithm's, and average cover degree is near to optimization.
由于在这样的环境中找到一个最优的调度是一个NP难问题，通常运用各种启发式算法来找到近似最优解。
Finding an optimal scheduling for such an environment is a NP-hard problem, and so heuristic approaches must be used in general to get an optimal approximation solution.
结果表明对于在有限网络中求解出租车调度可以通过该方案求出最优解。
And the result shows that we can find the best strategy in taxis' scheduling in the limited network through the dynamic programming principle.
仿真试验表明，该算法不仅提高了最优解的质量，而且还具有搜索空间小、求解速度快的特点，能够有效地解决大规模动态车辆调度问题。
The simulation results show that the proposed algorithm can not only improve the optimal solution, but also reduce greatly the search space and computation time, and can solve the problem efficiently.
电力系统中的动态经济调度问题是时间上和空间上相关联的一个复杂的最优决策问题。
The dynamic economic dispatching coupled with space and time is a complicated optimal decision problem in power system.
一个自动化立库系统是由许多的子系统构成，为了保证整个系统的最优绩效，就要优化调度各个子系统的运作。
An auto-stereoscopic warehouse system is composed of many subsystems and the operation of every subsystem needs to be optimized and scheduled to ensure the optimal performance of the whole system.
TDS等典型算法在优化条件下可得到该问题调度长度上的最优解。
A typical heuristic algorithm, TDS, can generate optimal schedule in scheduling length under optimality condition.
采用遗传算法搜索子载波最优分配方案，对多用户正交频分复用多址接入(OFDMA)系统资源分配问题进行了研究，提出了一种多载波比例公平调度算法G - PFS。
Focusing on the resource allocation problem in multi-user orthogonal frequency division multiple access (OFDMA) systems, a multi-carrier proportional fair scheduling algorithm, G-PFS, is proposed.
无等待问题是流水车间调度中的一种，是一类典型的NP完全问题，已被证明在多项式时间内得不到最优值。
No-wait flow shop problem is one of flow shop problems, and is a typically NP-complete problem, which means that it is impossible to find the global optimum in polynomial complexity.
采用基于动态信息素更新策略的改进蚁群优化算法，在保证优化目标的基础上，迅速收敛并得到最优解，从而提高调度系统的可行性，增强系统稳定性。
Secondly, the algorithm based on the dynamic pheromone updating ensures the quick convergence and the optimal solution, thus improving the feasibility and the stability of the schedule system.
新算法的时间复杂度高于现有算法，但其调度性能最优。
The time complexity of the proposed algorithm is higher than the existing algorithm, but its scheduling performance is the most superior.
新算法的时间复杂度高于现有算法，但其调度性能最优。
The time complexity of the proposed algorithm is higher than the existing algorithm, but its scheduling performance is the most superior.
应用推荐