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

 completion times 的翻译结果: 查询用时：0.01秒
 在分类学科中查询 所有学科 数学 机械工业 计算机软件及计算机应用 自动化技术 更多类别查询

 历史查询

 completion times 完成时间(7)完工时间(21)
 完成时间
 The single machine scheduling problem to minimize total weighted deviations of completion times from a common due date is a typical E/T (Earliness/Tardiness) scheduling model. It is NP-hard. 工件完成时间与交货期差的绝对值加权和最小化单机调度是典型的E/T(Earliness/Tardiness)的调度模型,是NP-hard问题. 短句来源 The problem of minimizing total weighted deviations of job completion times from a common due date on a single machine is a typical scheduling model in Just-In-Time production environment. It is NP-hard. 工件完成时间与交货期差的绝对值加权和最小化单机调度问题是 JIT(just- in- time)生产环境下的典型调度模型 ,是 NP- hard问题 . 短句来源 In OGS Algorithm, expect machine ready time is used, the completion times of all predecessors are also considered as heuristic information. OGS算法不仅考虑机器就绪时间 ,还考虑每个任务全部先导的完成时间 . 短句来源 Base on these time estimates, we then propose a new fuzzy project-network analysis method -Fuzzy Dominant Path Method (F-DPM) for calculating the fuzzy project completion time, the possibility of meeting certain project completion times, the degree of criticality for each path and other important parameters. 基于这些估计值，论文提出了一种工期分析的新方法，即模糊优势线路法(F-DPM)，该法可以计算项目模糊完成时间、在某工期内完成的可能性、每个线路的关键度等重要参数。 短句来源 Fuzzy du e dates denote the degree of satisfaction with respect to completion times of jo bs. 模糊交货期表示对任务完成时间的满意程度; 短句来源 更多
 完工时间
 The deterministic problem of minimizing total weighted deviations of job completion times from a common due date on a single machine (abbreviated to TWD problem) is a typical scheduling model in Just-In-Time production environment. The general TWD problem is NP-hard. 完工时间与交货期偏差加权和最小化单机调度 (简记 TWD)问题是 Just-In-Time生产环境下典型的调度模型 ,是 NP-hard问题 . 短句来源 For two cases that the basic processing times are independent of the decreasing rates and the basic processing times are related to the decreasing rates, the optimal algorithms are presented respectively for the problems of minimizing the makespan and the sum of completion times. 在递减率与基本加工时间无关以及递减率与基本加工时间相关的两种情况下,对目标函数为极小化最大完工时间与完工时间和问题分别给出了最优算法。 短句来源 Considering the problems of scheduling n independent unit-execution-time jobs in a two-machine open shop, we discuss two problems, one is to minimize the total weighted completion times (O2/UET/Σwici) and the other is to minimize the maximum leteness (O2/UET/Lmax). A polynomial optimal solution algorithm is designed here for each of the problems respectively. 本文考虑将n个互相独立的每道工序加工时长相等的工件放在两台机器上加工的自由作业排序问题。 讨论了目标函数分别是带权完工时间和（O2／UET／Σwici）及最大迟后（O2／UET／Lmax）两个问题，分别得到了计算时间限为O（nlogn）及O（n2）的两个求解最优时间表的多项式算法。 短句来源 Optimal algorithms are presented respectively for single machine scheduling problems of minimizing the makespan, weighted sum of completion times, maximum lateness and maximum cost. 对单机调度问题中目标函数为极小化最大完工时间加权完工时间和 ,最大延误以及最大费用等问题分别给出了最优算法 . 短句来源 The dual target problem of mininmizing total completion time and variation of completion times can also be formulated as assignment problem. 对于极小化完工时间和与完工时间偏差的双目标问题,其一般情况同样可以转化成指派问题. 短句来源 更多
 “completion times”译为未确定词的双语例句
 Dynamic Decisionmaking of Completion Times of Products in Short term Planning 短期生产计划中产品完成期的动态决策 短句来源 Analysis of the name,writers and completion times of "The Rites of Zhou" a classical book in ancient China 千古悬疑 耐人寻味——《周礼》的名称、作者及成书时代解析 短句来源 2. Under the industrial background of job overlaps, the dissertation analyzed the hard of the situation and built up a dynamic programming model that has an objective function that the function minimizes the total completion times. After studied the characteristics of the function, brought forward a heuristic asymptotic optimal scheduling policy and proved the asymptotic optimality of the policy. 2、针对任务重叠的工业背景,分析问题的难点,建立了一个目标函数为最短加工时间的动态规划模型,研究了相关特性,提出了一个启发式的渐进最优调度策略并对其渐进最优性进行了证明。 短句来源 Based on the studies of the completion times of products we propose a kind of dynamic Gantt chart, which is applied to dynamic decisionmaking of the completion times in short term planning. 在研究了产品完成期的基础上提出了动态甘特图 ,用于短期生产计划中产品完成期的动态决策。 短句来源 In this paper, we have discussed the problem on the jobs scheduling of maximal operation efficiency in the m×n flow shop, have set up the lower bound of the sum of the completion times of all jobs and the completion times of all machines, and also have given a jobs scheduling method of the maximal operation efficiency in the m×n flow shop and an example. 讨论了 Flow- shop网络中最大服务效率的作业排序问题 ,给出了机器完成服务时间与作业结束服务时间之和的一个下界估计公式 ,由此提出了一个可使 Flow- shop网络中服务效率达到最大值的作业排序方法以及一个算例 短句来源 更多

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

 completion times
 The goal is to minimize the total completion times. Subjects receiving the lesson in the print mode had shorter completion times and higher achievement than their CBI counterparts. The worst-case completion times of jobs obtained with the proposed methods are compared with the values by simulations under different workload characteristics. An efficient method has been proposed to determine how late the completion times of jobs can be in dynamic systems where the jobs are preemptable and nonmigratable. fixed destination), execution of discretionary activities, and finally activities completion times and order. 更多
 This paper is concerned with a single machine scheding problem of minimizingweighted completion times in which the weights can be variable.We first prove that theproblem is NP-hard， and then present some precedence criteria and polynomial algorithmsfor special cases. 证明了可变费用的单机等待损失排序问题１‖Σｆ＿ｉ（ｃ＿ｉ）是ＮＰ－ｈａｒｄ；给出了一般情形下工件优先安排加工的两个判别条件；对几种特殊情形给出了多项式时间算法或最优解的判定条件。 A model that,scheduling a set,of stochastic jods on a single machine that is subject to breakdorwn and repair is dicussed.The model assumes that a significant set-up time,which is an arbitrary variable,is when the machine changes from processing one of jobs to another job.When job i is being processed, the prooessing time of job i,uptime and reparied time of the machine are all general random variables. For both preemptive resume model and preemptive repeat model,we find the optimal polices that minimize the... A model that,scheduling a set,of stochastic jods on a single machine that is subject to breakdorwn and repair is dicussed.The model assumes that a significant set-up time,which is an arbitrary variable,is when the machine changes from processing one of jobs to another job.When job i is being processed, the prooessing time of job i,uptime and reparied time of the machine are all general random variables. For both preemptive resume model and preemptive repeat model,we find the optimal polices that minimize the following objective functions:(1)the weighted sum of the completion times;(2)the weighted number of late jobs having random dud dates with exponential distributions. ＳｔｏｃｈａｓｔｉｃＳｃｈｅｄｕｌｉｎｇｏｎａｎＵｎｒｅｌｉａｂｌｅＭａｃｈｉｎｅｗｉｔｈＧｅｎｅｒａｌＵｐｔｉｍｅｓａｎｄＧｅｎｅｒａｌＳｅｔ－ＵｐＴｉｍｅｓＬＩＷｅｉ；ＣＡＯＪｉｎｈｕａ（ＩｎｓｔｉｔｕｔｅｏｆＡｐｐｌｉｅｄＭａｔｈｅｍａｔｉｃｓ... Considering the problems of scheduling n independent unit-execution-time jobs in a two-machine open shop, we discuss two problems, one is to minimize the total weighted completion times (O2/UET/Σwici) and the other is to minimize the maximum leteness (O2/UET/Lmax). A polynomial optimal solution algorithm is designed here for each of the problems respectively. 本文考虑将ｎ个互相独立的每道工序加工时长相等的工件放在两台机器上加工的自由作业排序问题。讨论了目标函数分别是带权完工时间和（Ｏ２／ＵＥＴ／Σｗｉｃｉ）及最大迟后（Ｏ２／ＵＥＴ／Ｌｍａｘ）两个问题，分别得到了计算时间限为Ｏ（ｎｌｏｇｎ）及Ｏ（ｎ２）的两个求解最优时间表的多项式算法。 << 更多相关文摘
 相关查询

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

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

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