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

图标索引 历史查询
 

completion time
相关语句
  完工时间
    In this paper,HTS(Hybrid Tabu Search) is proposed,which combines a heuristic with a TS(tabu search) method,for no-wait flowshop scheduling problems with total completion time minimization. An initial solution is obtained by the heuristic and improved by a TS.
    针对以总完工时间最小为目标的无等待流水调度问题,提出了一个启发式算法与禁忌搜索算法相结合的混合禁忌搜索算法HTS(Hybrid Taboo Search):以启发式算法产生的解作为初始解,通过禁忌搜索提高解的质量.
短句来源
  “completion time”译为未确定词的双语例句
    This paper presents the parameter linear programming methods for determining critical path in fuzzy network based on network flows model, and gives the membership functions of fuzzy critical path and fuzzy completion time reflecting preference of decision maker, therefore, obtains more overall results of fuzzy critical path.
    基于网络流模型,本文提出了确定模糊网络关键路线的参数线性规划方法,并给出了反映决策者偏好信息的模糊网络关键路线和工程模糊完工期的隶属函数形式,从而得到了模糊网络关键路线性质的更全面结果。
短句来源
查询“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%.
      
更多          


This paper presents the parameter linear programming methods for determining critical path in fuzzy network based on network flows model, and gives the membership functions of fuzzy critical path and fuzzy completion time reflecting preference of decision maker, therefore, obtains more overall results of fuzzy critical path. Finally, gives the method for concurrent engineering in fuzzy environment.

基于网络流模型,本文提出了确定模糊网络关键路线的参数线性规划方法,并给出了反映决策者偏好信息的模糊网络关键路线和工程模糊完工期的隶属函数形式,从而得到了模糊网络关键路线性质的更全面结果。最后,针对模糊环境下的并行工程计划问题,给出了模糊网络的分析方法。

This paper deals with the flow shop scheduling problems with processing time dependent on starting time. In these problems job processing time is a simple linear function of the starting time and some dominance relations, between machines can be satisfied. It is shown that for the problems to minimize make span,polynomial algorithms still exist, although these problems are more complicated than classical ones. When the objective is to minimize weighted sum of completion time or maximum delay,the solutions...

This paper deals with the flow shop scheduling problems with processing time dependent on starting time. In these problems job processing time is a simple linear function of the starting time and some dominance relations, between machines can be satisfied. It is shown that for the problems to minimize make span,polynomial algorithms still exist, although these problems are more complicated than classical ones. When the objective is to minimize weighted sum of completion time or maximum delay,the solutions of a classical version may not hold.

讨论了加工时间依赖开工时间的Flow shop 调度问题。在这类问题中,工件的加工时间是开工时间的简单线性函数,机器间满足某种优势关系。对于这类问题,当目标函数是极小化最大完工时间时,尽管比相应的经典问题复杂,但仍存在多项式算法。如果目标函数是极小化加权完工时间和或极小化最大延误,则经典问题中的结论未必成立。

In this paper,HTS(Hybrid Tabu Search) is proposed,which combines a heuristic with a TS(tabu search) method,for no-wait flowshop scheduling problems with total completion time minimization.An initial solution is obtained by the heuristic and improved by a TS.Experiment results on a large number of the random generated instances show that HTS outperforms four classical heuristics RC1 and RC2,PH1(p),DS,and computing time is about fifty seconds when the problem size is less than one hundred hours.

针对以总完工时间最小为目标的无等待流水调度问题,提出了一个启发式算法与禁忌搜索算法相结合的混合禁忌搜索算法HTS(Hybrid Taboo Search):以启发式算法产生的解作为初始解,通过禁忌搜索提高解的质量.大量随机产生实例的实验结果表明:提出的HTS在性能上优于经典的RC1、RC2、PH1(p)和DS算法,问题规模不超过100h,计算时间约为50s.

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

 


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

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