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

 total completion time 的翻译结果: 查询用时：0.009秒
 在分类学科中查询 所有学科 数学 工业通用技术及设备 自动化技术 更多类别查询

 历史查询

 total completion time 总完工时间(10)完工时间和(4)加工时间(4)
 总完工时间
 For the single machine,batching,total completion time scheduling problems,the optimal batching structures on the batching ways:all jobs in exactly N(arbitrarily fixed batch number and 1 研究了目标函数为总完工时间、工件恰分N批的单机分批排序问题最优解的结构性质,其中N为1与工件数之间的任意整数. 短句来源 Inverse Problems of a Single Machine Scheduling to Minimize the Total Completion Time 单台机器总完工时间排序问题的反问题 短句来源 Optimal algorithms are presented for the problem of minimizing the makespan and total completion time,while for the problem of weighted total completion time,the agreeable relation of jobs were given. 对于目标函数为极小化最大完工时间和总完工时间的问题,给出了求解最优排序的多项式算法,对于目标函数为加权总完工时间的问题,给出了工件间的一致关系. 短句来源 Minimal Total Completion Time in Two-machine Flowshop with Setup, Processing and Removal Time Separated 有分离调整和移走时间的两机器流水作业总完工时间问题 短句来源 Inverse Scheduling Problem on a Single Machine Stochastic Scheduling to Minimize the Total Completion Time 单台机器总完工时间随机排序问题的反问题 短句来源 更多
 完工时间和
 Minimizing Total Completion Time of Bounded Batch Scheduling 极小化完工时间和的有界批调度问题(英文) 短句来源 Optimal algorithms are presented for the problem of minimizing the makespan and total completion time,while for the problem of weighted total completion time,the agreeable relation of jobs were given. 对于目标函数为极小化最大完工时间和总完工时间的问题,给出了求解最优排序的多项式算法,对于目标函数为加权总完工时间的问题,给出了工件间的一致关系. 短句来源 The dual target problem of mininmizing total completion time and variation of completion times can also be formulated as assignment problem. 对于极小化完工时间和与完工时间偏差的双目标问题,其一般情况同样可以转化成指派问题. 短句来源 Moreover,for some special cases,the simple algorithms are presented for the makespan and total completion time minimization problems. 此外,对于某些特殊情况,给出了极小化最大完工时间问题与完工时间和问题的简便算法. 短句来源
 加工时间
 The results are three necessary and sufficient conditions for the objective of total completion time and some sufficient conditions for the objective of maximum lateness time or for the objective of the number of tardy jobs under which an optimal schedule is of interval perturbation robustness. 本文的结果是目标函数为完成时间总和时在加工时间扰动下最优调度具有区间摄动鲁棒性的三个充分必要条件,目标函数为最大拖期时间时及目标函数为拖后工件个数时在加工时间和/或交付期扰动下最优调度具有区间摄动鲁棒性的若干充分条件. 短句来源 We study the problems of minimizing makespan and total completion time. 第六章研究一种加工时间依赖开工时间，并且机器带一个维护时间段的单台机排序问题。 短句来源 Chapter two investigates single processor scheduling problem minimizing makespan with group technology and single processor, scheduling problem of total completion time under the condition of linear deterioration of processing times. 第二章对工件的加工时间依赖其开工时间的情形,分别研究了单机成组最大完工时间问题和单机总完工时间问题。 短句来源 Moreover, we consider the minimal total completion time problem where there is not the idle time in machine M1, and derive the optimality conditions for this kind of flowshops scheduling problems. 本文以总完工时间为准则研究调整时间和移走时间均独立于加工时间的两机器流水作业问题,给出了问题最优解中工件排列应满足的条件; 短句来源
 “total completion time”译为未确定词的双语例句
 Minimizing Total Completion Time of Jobs on a Flexible Two Machine Flow Shop 流水作业由二台柔性机器组成时的极小完工时间之和问题 短句来源 Min-min algorithm, a classics algorithm in heuristic algorithm, which always completes the shortest total completion time task first, has the characteristic of simple and shortest completion time. So it catches a lot of close attentions in the field of studying for tasks scheduling algorithms in Grid. 作为启发式算法中的经典算法，Min-min算法总是先执行具有最短完成时间的作业，有着算法思路简单、总完成时间短的特点，是网格作业调度算法研究中倍受关注的一个算法。 短句来源 The problems of scheduling jobs with different ready time on parallel machines to minimize the total completion time are addressed. 研究工件带释放时间的两类并行机最小化总完成时间的调度问题. 短句来源 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)排序使总的完工时间取得最小,并进一步分析了带有准备时间的带权误工工件数排序问题的一些性质. 短句来源 Minimizing Total Completion Time of Orders with Multiple Job Classes 订单带多类工件时的极小完工时间之和问题 短句来源 更多

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

 total completion time
 The objective is to minimize the total completion time of the accepted jobs and the total penalty of the rejection jobs. The objective is to minimize the total completion time of the accepted jobs plus the total penalty of the rejected jobs. We present polynomial time algorithms to find the job sequence, the partition of the job sequence into batches and the resource allocation, which minimize the total completion time or the total production cost (inventory plus resource costs). Single machine batch scheduling to minimize total completion time and resource consumption costs For the $$\mathcal{NP}$$-hard problem of scheduling n jobs in a two-machine flow shop so as to minimize the total completion time, we present two equivalent lower bounds that are computable in polynomial time. 更多
 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)排序使总的完工时间取得最小,并进一步分析了带有准备时间的带权误工工件数排序问题的一些性质. M.Dror examined the open-shop scheduling problem with machine dependent processing times in 1992. Two criteria were considered: minimizing the maximum completion time (makespan), and minimizing the total completion time. In this paper we show that the "algorithm" for the second criterion proposed by him is wrong. Then, we formulate the problem to minimize the total completion time as an asslgnoment model when machines are continuously available and are never kept idle while work is walting， and apply... M.Dror examined the open-shop scheduling problem with machine dependent processing times in 1992. Two criteria were considered: minimizing the maximum completion time (makespan), and minimizing the total completion time. In this paper we show that the "algorithm" for the second criterion proposed by him is wrong. Then, we formulate the problem to minimize the total completion time as an asslgnoment model when machines are continuously available and are never kept idle while work is walting， and apply the Hungarian method to solve it． Several questions are still unanswered．We describe tree open problems for further research at last． 1992年M．Dror提出工件的加工时间依赖于机器的排序问题（schedulingwithmachinedependentprocessingtimes），并研究以最大完工时间（makespan）和以总的完工时间为优化目标的两种这类排序问题．然而，M．Dror对以总的完工时间为优化目标提出的“最优算法”是错误的．本文用算例表明他提出的算法不是最优的，并在机器连续加工的条件下，把这个排序问题转化成指派问题（assignmentproblem），从而可以用匈牙利算法得到最优解．最后，我们提出几个尚未解决的问题，以期引起国内外同行进一步研究． The sequencing of n independent work pieces which are processed in a single machine shop is discussed in which each job is assigned a common due date k and each work piece processing time distribution is assumed to be independent normal distribution. The object is to determine a common due date k *and to find an optimal sequence of n independent work pieces to minimize the expectation of the linear combination of total absolute deviation of completion time about a common due date and total completion... The sequencing of n independent work pieces which are processed in a single machine shop is discussed in which each job is assigned a common due date k and each work piece processing time distribution is assumed to be independent normal distribution. The object is to determine a common due date k *and to find an optimal sequence of n independent work pieces to minimize the expectation of the linear combination of total absolute deviation of completion time about a common due date and total completion time. 讨论 n个独立工件在一台机器上加工。工件的加工时间服从正态分布 ,所有工件交货期设置公共交货期。目标是确定公共交货期及工件的最优排序 ,使工件完工时间与公共交货期之差绝对值之和及工件完工时间之和的线性组合的期望值最小 . << 更多相关文摘
 相关查询

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

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

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