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

图标索引 历史查询
 

completion time
相关语句
  完工时间
    Minimizing the Maximum Deviation of Job Completion Time from Their Due Dates Based on a General Mode
    一个一般应交工时间模式下完工时间的最大离差最小问题
短句来源
    For a general scheduling problem of minimizing the maximum deviation of job completion time from their due dates related to the required processing time, the expected starting time and a common grace period, this paper introduces four consistent conditions, discusses their interrelations, and gives a sufficient condition under which a given schedule is optimal.
    对工件应交工时间同其所需加工时间、预期开始加工时间和一共同宽容期有关的一个一般应交工时间模式下完工时间的最大离差最小问题 ,此文在引入四个一致性条件并讨论了它们之间的关系后给出了任一序为最优序的一个充分条件
短句来源
查询“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%.
      
更多          


Time modify and tabu search algorithms are realized in job shop rescheduling. The operations starting and completion time are calculated in the time modify algorithm when the sequence and all processing times are known. It can be applied to inflexible rescheduling. When the disturbance occurs, the affected operations time parameters can be modified. The tabu search algorithm used to solve combination optimization problem is applied to flexible rescheduling. When the disturbance occurs, the...

Time modify and tabu search algorithms are realized in job shop rescheduling. The operations starting and completion time are calculated in the time modify algorithm when the sequence and all processing times are known. It can be applied to inflexible rescheduling. When the disturbance occurs, the affected operations time parameters can be modified. The tabu search algorithm used to solve combination optimization problem is applied to flexible rescheduling. When the disturbance occurs, the number of affected jobs is decided and the jobs on the substitute machine are resequenced. The experiment shows that the two algorithms can be used to solve rescheduling in all operations.

针对单件车间生产作业计划的再生问题,用VisualFoxpro开发了一个时间调整算法和实现了禁忌搜索算法.当干扰发生时,前者用于无可替代机床情况下对受影响工序的开工时间和完工时间的调整;后者用于有可替代机床情况下对在替代机床上加工工件的排序.实验表明,它们能较好地解决各种情况下生产作业计划再生问题.

For a general scheduling problem of minimizing the maximum deviation of job completion time from their due dates related to the required processing time, the expected starting time and a common grace period, this paper introduces four consistent conditions, discusses their interrelations, and gives a sufficient condition under which a given schedule is optimal.

对工件应交工时间同其所需加工时间、预期开始加工时间和一共同宽容期有关的一个一般应交工时间模式下完工时间的最大离差最小问题 ,此文在引入四个一致性条件并讨论了它们之间的关系后给出了任一序为最优序的一个充分条件

ATraditional project management encounters many difficulties like cascade effect, multitasking and behavior effect in a multiple projects environment. Applying critical chain scheduling, pipelining and buffer management, this paper establishes a new method, namely Critical Chain Multi-Project Management (CCMPM). A three-project example is used to test the CCMPM. The simulation using the Crystal Ball 2000.5 shows the CCMPM can reduce the average completion time of 1000 runs from 320 days to 295 days, whilst...

ATraditional project management encounters many difficulties like cascade effect, multitasking and behavior effect in a multiple projects environment. Applying critical chain scheduling, pipelining and buffer management, this paper establishes a new method, namely Critical Chain Multi-Project Management (CCMPM). A three-project example is used to test the CCMPM. The simulation using the Crystal Ball 2000.5 shows the CCMPM can reduce the average completion time of 1000 runs from 320 days to 295 days, whilst the completion time with 90% reliability using the CCMPM is 330 days, compared with 301 days by traditional approach.

传统多项目管理中的主要问题表现在级联效应、多任务工作、行为效应等三个方面。本文提出五步骤法将关键链管理中的关键链调度、同步化、缓冲管理应用于多项目管理,建立了关键链多项目管理方法(CCMPM),并构建了由三个项目组成的多项目环境实例,以工期为评估标准,利用模拟软件CrystalBall2000.5模拟项目实施过程,1000次模拟结果显示,经CCMPM优化前后项目平均完工时间为320天/295天,完工保证率为90%的工期为330天/301天。

 
图标索引 相关查询

 


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

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