说明:双击或选中下面任意单词,将显示该词的音标、读音、翻译等;选中中文或多个词,将显示翻译。
您的位置:首页 -> 句库 -> 最优排序
1.
Paths Optimal Ordering Algorithm Based on MPLS Traffic Engineering
基于MPLS流量工程的路径最优排序算法
2.
A StUDY ON OP IMAL SOR ING ALGORI HM OF WORKPIECE PROCESSING RELA IVE SUPERIOR RECURRENCE ME HOD
工件加工最优排序算法研究——相对优势递推法
3.
The 0-1 Programming Model of Optimal Scheduling in Enterprisire Cooperative Processing;
企业合作加工最优排序的0—1规划模型
4.
Optimal Ranking Method of Air Defense Forces’ Operational Proposal Based on Fuzzy Evaluation
基于模糊评估的防空兵作战方案最优排序方法
5.
The Equilibrium of the Two-way permutation Cannot Guarantee the Best Scheme;
论双向排序均衡法不能保证方案最优
6.
Pareto Optimizations for Rescheduling Problems
重新排序问题的Pareto最优解
7.
The Study on the Optimal Disassembling level Based on Synthetically Sorting Model
基于综合排序法的最优拆解层次探讨
8.
The Study of Flow-line Two-stage Production Schedules with Infinite Optimal Solutions;
有多重最优解的流水型两工序排序问题研究
9.
Method for requirements prioritizing based on optimal combination of components
基于组件最优组合的需求优先级排序方法
10.
Scheduling problem is an important combination optimization problem.
排序问题是一类重要的组合最优化问题。
11.
Determiniation of the PRI of the curriculum arrangement program and the realization of the simplest algorithm
排课程序优先级的确定与最简单算法的实现
12.
The Generalized and Completed Optimality of Scheduling to Minimize the Number of Tardy Jobs Proofed by Pinedo
误工排序问题最优性Pinedo证明的完善和发展
13.
The study of methods for maximum near optimal solution of m×n permutation schedule problems;
同顺序m×n排序问题极大值近似最优解解法的探讨
14.
A discussion of approximate optimal solution to another two kinds of 3×n permutation schedule problems;
另两类3×n同顺序排序问题近似最优解法的探讨
15.
We consider the following application the best use of refinery gas in decreasing order:
我们认为以下是炼厂气从最优应用到最差应用的一个排序。
16.
Please rank the following types of cooperation according to priorities. *4*equals highest priority and *1* equals lowest priority.
请按照优先顺序排列下面的合作类型,*4*代表最高优先级,*1*代表最低优先级。
17.
An Optimal Algorithm of Minimizing the Total Completion on Identical Machine Batching Scheduling Problem;
极小化总完工时间同型机分批排序问题的最优算法
18.
A study of new near optimal method for one kind of 3×n water-flowing ordering problems;
一类3×n流水型排序问题新近似最优解法的探讨