全文文献 工具书 数字 学术定义 翻译助手 学术趋势 更多

 mean completion time 的翻译结果: 查询用时：0.205秒
 在分类学科中查询 所有学科 数学 更多类别查询

 历史查询

 mean completion time 平均完工时间(3)
 平均完工时间
 Flowshop scheduling with the objective of minimizing mean completion time has been proved to be NP hard. 流水车间以极小化平均完工时间为目标的排序问题已被证明为NP难题，本文给出了求解该问题的两种方法； 短句来源 The problem of finding an optimal sequencing of n independent jobs to be processed on a single machine by minimizing the mean absolute deviation ( MAD ) of job completion time from the mean completion time is considered. A procedure to find the optimal sequence is presented and elaborated a numerical example. 提出寻找n个独立工件在一台机器上加工，使工件完工时间与平均完工时间的平均绝对偏差（MAD）最小的最优排序问题．给出寻找工件最优排序的方法及实例说明 短句来源 This paper is concerned with the problem of serial batching and schedulingto minimize mean completion time. 对于目标函数为平均完工时间的串联工件同时加工排序问题,本文证明在分批数固定时是NP_C 的,同时给出求解该问题的几个数学模型.
 相似匹配句对
 Mean Entropy 平均熵 短句来源 b)the principle of completion; 完备性原则 ; 短句来源 But this does not mean the completion of administrative monitor; 但这绝不意味着行政监督的任务已经完成,行政监督工作已告终结。 短句来源 Completion of Codes 码的完全化 短句来源 Flowshop scheduling with the objective of minimizing mean completion time has been proved to be NP hard. 流水车间以极小化平均完工时间为目标的排序问题已被证明为NP难题，本文给出了求解该问题的两种方法； 短句来源

我想查看译文中含有：的双语例句

 mean completion time
 In this paper, we consider a bi-criteria permutation flow shop scheduling problem, where weighted mean completion time and weighted mean tardiness are to be minimized simultaneously. The MQOL-CSF had little respondent burden (mean completion time=3.3?min) and was evaluated as 'very clear' or 'clear' (98.2%), comprehensive (74.5%) and acceptable (96.4%). Minimizing Mean Completion Time in a Batch Processing System In contrast, females exhibited no change in the mean completion time for the assembly task but did show an increase in collision counts. In this paper, we address the two-stage assembly flowshop scheduling problem with a weighted sum of makespan and mean completion time criteria, known as bicriteria. 更多
 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. 流水车间以极小化平均完工时间为目标的排序问题已被证明为ＮＰ难题，本文给出了求解该问题的两种方法；求最优解的分枝定界法和求近化解的启发式算法．大量计算机模拟结果表明，本文给出的启发式算法优度较高，而且是简单的多项式算法． The problem of finding an optimal sequencing of n independent jobs to be processed on a single machine by minimizing the mean absolute deviation ( MAD ) of job completion time from the mean completion time is considered.A procedure to find the optimal sequence is presented and elaborated a numerical example. 提出寻找ｎ个独立工件在一台机器上加工，使工件完工时间与平均完工时间的平均绝对偏差（ＭＡＤ）最小的最优排序问题．给出寻找工件最优排序的方法及实例说明 >=This paper is concerned with the problem of serial batching and schedulingto minimize mean completion time. It's proved that the problem is NP_C when thenumber of batches is fixed. For this problem, we propose three models which could besolved by convex programming Relaxation. Finally special batching is also discussed. 对于目标函数为平均完工时间的串联工件同时加工排序问题,本文证明在分批数固定时是NP_C 的,同时给出求解该问题的几个数学模型.最后,本文对特殊分批进行了讨论.关键词:同时加工排序,平均完工时间,凸规划松弛,NP困难性,列生成技术.
 相关查询

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

 CNKI主页 |  设CNKI翻译助手为主页 | 收藏CNKI翻译助手 | 广告服务 | 英文学术搜索
2008 CNKI－中国知网

2008中国知网(cnki) 中国学术期刊(光盘版)电子杂志社