助手标题  
全文文献 工具书 数字 学术定义 翻译助手 学术趋势 更多
查询帮助
意见反馈
   completion time 在 数学 分类中 的翻译结果: 查询用时:0.177秒
图标索引 在分类学科中查询
所有学科
数学
互联网技术
计算机软件及计算机应用
企业经济
工业通用技术及设备
中国通史
中国文学
更多类别查询

图标索引 历史查询
 

completion time
相关语句
  完工时间
    A Flowshop Scheduling Algorithm to Minimize Total Weighted Completion Time
    极小化加权完工时间和的Flowshop问题的算法(英文)
短句来源
    Discounted Total Weighted Completion Time in No-Wait Flow Shop with Separated Setup Times
    折扣加权总完工时间的调整时间可分离无等待Flow Shop排序问题
短句来源
    ON-LINE RANDOMIZED ALGORITHM TO MINIMIZE WEIGHTED COMPLETION TIME FOR DIAL-A-RIDE PROBLEMS
    极小化总加权完工时间的Dial-a-Ride问题的在线随机算法(英文)
短句来源
    We first formulate the problem of minimizing total weighted completion time on single batch processing machine 1|B|∑ωjCj and get some conclusions.
    本文首先介绍总完工时间和最小的带权单机分批排序问题1|B|∑ωjCj,然后将1|B|∑ωjCj表示成数学规划的形式,并且用数学规划中的对偶理论证明了SPT序是其特殊情况1|B=1|∑Cj的最优解。
短句来源
    We study the problem 1|B|ΣwjCj of minimizing the total weighted completion time on a batch machine.
    本文研究使带权总完工时间为最小的同时加工排序问题1|B|∑wjCj.
短句来源
更多       
  总完工时间
    Discounted Total Weighted Completion Time in No-Wait Flow Shop with Separated Setup Times
    折扣加权总完工时间的调整时间可分离无等待Flow Shop排序问题
短句来源
    We first formulate the problem of minimizing total weighted completion time on single batch processing machine 1|B|∑ωjCj and get some conclusions.
    本文首先介绍总完工时间和最小的带权单机分批排序问题1|B|∑ωjCj,然后将1|B|∑ωjCj表示成数学规划的形式,并且用数学规划中的对偶理论证明了SPT序是其特殊情况1|B=1|∑Cj的最优解。
短句来源
    We study the problem 1|B|ΣwjCj of minimizing the total weighted completion time on a batch machine.
    本文研究使带权总完工时间为最小的同时加工排序问题1|B|∑wjCj.
短句来源
    Single Machine Scheduling Problems With a Common Finite Total Weighted Completion Time and Resource Dependent Release Dates
    加权总完工时间有限的受资源约束排序问题
短句来源
    Inverse Problems of a Single Machine Scheduling to Minimize the Total Completion Time
    单台机器总完工时间排序问题的反问题
短句来源
更多       
  “completion time”译为未确定词的双语例句
    The objective is to minimize the maximum machine completion time. We mainly consider four problems: 1 We give Qmax2 algorithm whose competitive ratio is 2(s+1)/s+2 (1≤ s≤ 2) and s+1/s (s > 2) for two uniform machines case, and show Qmax2 algorithm is tight and optimal for some s.
    主要讨论四个问题:1 对于两台同类机的问题,我们给出竞争比分别为2(s+1)/(s+2)(1≤s≤2)和(s+1)/s(s>2)的Qmax2算法,并且证明此算法是紧的且相应某些s的特殊值是最优的。
短句来源
    The problem of minimizing total weighted completion time in flow shop F2|prmu,s,pkij=pij,GT|∑wjcj is considered. The two-machine flow shop problem is discussed.
    讨论Flow Shop成组排序问题F2|prmu,s,pkij=pij,GT|∑wjcj.
短句来源
    The Scheduling Problem of the Total Weighted Completion Time on A Single Machine as the Processing Times Identical and the Ready Times Controllable
    单处理机在加工时间相同准备时间可控时的∑w_jC_j问题
短句来源
    MINIMIZING TOTAL COMPLETION TIME IN TWO-MACHINE FLOW PROCESS WITH SETUP TIME ADJUSTING
    有调整时间的两机器流水作业总流程问题
短句来源
    An Optimal Algorithm for Solving the Single Machine Scheduling Problem with Treelike Precedence Ordering to Minimize Total Weighted Completion Time with Discounted Factor
    带有折扣因子的树型约束排序问题的最优算法
短句来源
更多       
查询“completion time”译词为用户自定义的双语例句

    我想查看译文中含有:的双语例句
例句
为了更好的帮助您理解掌握查询词或其译词在地道英语中的实际用法,我们为您准备了出自英文原文的大量英语例句,供您参考。
  completion time
The objective functions are the minimizing of makespan and total weighted completion time.
      
The objective is to minimize the maximum job completion time.
      
The objective is to minimize the longest job completion time (makespan).
      
Semi on-line scheduling for maximizing the minimum machine completion time on three uniform machines
      
The reaction completion time was directly proportional to the initial concentration of Ca(OH)2 in slurry above 0.5 wt%.
      
更多          


In this paper we prove that the shortest ready time (SRT) sequencing minimizes the total completion time, and analyse properties of the one-machine sequencing problem with ready time to minimize the weighted number of tardy jobs.

本文证明了最短准备时间(SRT)排序使总的完工时间取得最小,并进一步分析了带有准备时间的带权误工工件数排序问题的一些性质.

We consider the problem of scheduling n independent jobs on m identical machines in order to maximize the earliest processor completion time. The jobs are available at time zero,but some machines may not be available at time zero. In this paper,we show that the worst case ratio of LPT algorithm is greater than

本文考虑带准备时间的平行机排序问题,讨论在使最早机器完工时间达到最大目标下的优化问题.这是NP-hard问题,本文证明LPT排序解至少是最优解的倍.

Flowshop scheduling with the objective of minimizing mean completion time has been proved to be NP hard. The paper presents two methods,branch and bound to guarantee optimal solution and heuristic algorithm to achieve near optimal solution. Computer simulation shows that the new heuristic algorithm performs well and it is easy for computer implementation.

流水车间以极小化平均完工时间为目标的排序问题已被证明为NP难题,本文给出了求解该问题的两种方法;求最优解的分枝定界法和求近化解的启发式算法.大量计算机模拟结果表明,本文给出的启发式算法优度较高,而且是简单的多项式算法.

 
<< 更多相关文摘    
图标索引 相关查询

 


 
CNKI小工具
在英文学术搜索中查有关completion time的内容
在知识搜索中查有关completion time的内容
在数字搜索中查有关completion time的内容
在概念知识元中查有关completion time的内容
在学术趋势中查有关completion time的内容
 
 

CNKI主页设CNKI翻译助手为主页 | 收藏CNKI翻译助手 | 广告服务 | 英文学术搜索
版权图标  2008 CNKI-中国知网
京ICP证040431号 互联网出版许可证 新出网证(京)字008号
北京市公安局海淀分局 备案号:110 1081725
版权图标 2008中国知网(cnki) 中国学术期刊(光盘版)电子杂志社