助手标题  
全文文献 工具书 数字 学术定义 翻译助手 学术趋势 更多
查询帮助
意见反馈
   weighted completion time 的翻译结果: 查询用时:0.195秒
图标索引 在分类学科中查询
所有学科
数学
更多类别查询

图标索引 历史查询
 

weighted completion time
相关语句
  加权总完工时间
     In 1978, an algorithm for minimizing total weighted completion time with a series-parallel precedence was given by Lawler.
     1978年Lawler给出当任务间的优先约束关系为串并有向图时,加权总完工时间问题的算法。
短句来源
     Discounted Total Weighted Completion Time in No-Wait Flow Shop with Separated Setup Times
     折扣加权总完工时间的调整时间可分离无等待Flow Shop排序问题
短句来源
     Discounted total weighted completion time in three-machine no-wait flow shop scheduling problem with separated setup times was studied.
     研究 3台机器调整时间可分离的无等待 Flow Shop排序问题 ,目标函数为极小化折扣加权总完工时间
短句来源
     For the problem to minimize the total weighted completion time with the constraint of total penalties, we first verify that it is NP-hard and then design an FPTAS;
     对于在总惩罚费用的约束下极小化加权总完工时间的问题,证明了其NP-难性,设计出了FPTAS算法;
短句来源
     1. Minimize the total weighted completion time single machine scheduling problems.
     1.最小化加权总完工时间的单机排序问题.
短句来源
更多       
  加权完工时间
     ON-LINE RANDOMIZED ALGORITHM TO MINIMIZE WEIGHTED COMPLETION TIME FOR DIAL-A-RIDE PROBLEMS
     极小化总加权完工时间的Dial-a-Ride问题的在线随机算法(英文)
短句来源
     In this paper,on-line dial-a-ride problems with a single server to minimize total weighted completion time on general metric space are considered.
     讨论一般度量空间上带单服务器的极小化总加权完工时间在线Dial-a-Ride问题.
短句来源
     We consider the problem of minimizing total weighted completion time in flowshop.
     本文讨论了极小化加权完工时间和的Flowshop问题.
短句来源
     A Flowshop Scheduling Algorithm to Minimize Total Weighted Completion Time
     极小化加权完工时间和的Flowshop问题的算法(英文)
短句来源
     Dynamic Programming Algorithm on Two Machines Cross Docking Scheduling with Total Weighted Completion Time
     以总加权完工时间为目标的两台机越库排序的动态规划算法
短句来源
更多       
  加权完成时间
     Analysis of Heuristic Algorithm for the Scheduling Problem of the Multiprocessor Flow Shop Weighted Completion Time Scheduling Problem
     多机Flow shop加权完成时间调度问题的启发式算法分析
短句来源
     Analysis of Heuristic Algorithm for the Flexible Flow Shop Weighted Completion Time Scheduling Problem
     柔性Flow shop加权完成时间调度问题的启发式算法
短句来源
     Performance analysis of policy of heuristic for the stochastic flexible flow shop weighted completion time scheduling problem
     随机柔性Flow shop加权完成时间调度问题的启发式策略性能分析
短句来源
     Asymptotically Optimal Algorithm for the Multiprocessor Flow Shop Weighted Completion Time Scheduling Problem
     多机Flow Shop加权完成时间调度问题的渐近最优算法研究
短句来源
     For the scheduling problem of multiprocessor flow shop weighted completion time scheduling problem,this paper proves the heuristic algorithm based on weighted shortest expected processing requirement is asymptotically optimal by using single machine relaxation and probabilistic analysis.
     本文针对多机F low shop加权完成时间调度问题,使用单机松弛和概率分析方法,证明了基于加权最短处理时间需求的启发式算法是渐近最优的.
短句来源
更多       
  “weighted completion time”译为未确定词的双语例句
     We first formulate the problem of minimizing total weighted completion time on single batch processing machine 1|B|∑ωjCj and get some conclusions.
     本文首先介绍总完工时间和最小的带权单机分批排序问题1|B|∑ωjCj,然后将1|B|∑ωjCj表示成数学规划的形式,并且用数学规划中的对偶理论证明了SPT序是其特殊情况1|B=1|∑Cj的最优解。
短句来源
     We study the problem 1|B|ΣwjCj of minimizing the total weighted completion time on a batch machine.
     本文研究使带权总完工时间为最小的同时加工排序问题1|B|∑wjCj.
短句来源
     The problem of minimizing total weighted completion time in flow shop F2|prmu,s,pkij=pij,GT|∑wjcj is considered. The two-machine flow shop problem is discussed.
     讨论Flow Shop成组排序问题F2|prmu,s,pkij=pij,GT|∑wjcj.
短句来源
     The Scheduling Problem of the Total Weighted Completion Time on A Single Machine as the Processing Times Identical and the Ready Times Controllable
     单处理机在加工时间相同准备时间可控时的∑w_jC_j问题
短句来源
     An Optimal Algorithm for Solving the Single Machine Scheduling Problem with Treelike Precedence Ordering to Minimize Total Weighted Completion Time with Discounted Factor
     带有折扣因子的树型约束排序问题的最优算法
短句来源
更多       
查询“weighted completion time”译词为用户自定义的双语例句

    我想查看译文中含有:的双语例句
例句
为了更好的帮助您理解掌握查询词或其译词在地道英语中的实际用法,我们为您准备了出自英文原文的大量英语例句,供您参考。
  weighted completion time
Minimizing the total weighted completion time is shown to be NP-hard in the strong sense.
      
We consider the class of objectives ∑ fj(Cj) that includes objectives such as the total weighted completion time ∑ wjCj and the total weighted tardiness ∑ wjTj of the n orders.
      
We examine three basic scheduling criteria: minimizing makespan, minimizing maximum lateness, and minimizing total weighted completion time.
      
The complexity status of the problem with total weighted completion time criterion is also established.
      
A note on special optimal batching structures to minimize total weighted completion time
      
更多          


Many practical scheduling problems involve processing several batches of related jobs on a single machine where a setup time is incurred whenever there is a switch from processing a job in one batch to a job in another batch. The maximum lateness and total weighted completion time problems are solved by using dynamic programming algorithms that are polyuomially bounded in the number of jobs, but are exponential in the number of batches. In this paper we propose an approach that transfers a problem with...

Many practical scheduling problems involve processing several batches of related jobs on a single machine where a setup time is incurred whenever there is a switch from processing a job in one batch to a job in another batch. The maximum lateness and total weighted completion time problems are solved by using dynamic programming algorithms that are polyuomially bounded in the number of jobs, but are exponential in the number of batches. In this paper we propose an approach that transfers a problem with a large number of batches into one with a smaller number of batches. Hence the problem becomes easier to be solved.

成组排序具有深刻的实际应用背景,是近年来国外研究得较多的一个热点.已有的某些动态规划算法的复杂性随分类数的增长呈指数型增长趋势,本文用“归并”和解不超过四个新的子问题的方法把分类数较大时的问题转化为分类数较小时的相应问题,简化了问题的求解.

This paper discussed a scheduling model:single machine scheduling problem with multiple job classes.Althrough it is NP—complete,the author present a dynamic programming algorithm with computational complexity O(M~2(n/M+1)~M).Further,some result with weighted completion time are givea.

本文讨论了具有调整时间的多类工件单机排序问题I|MCS|∑Ci|尽.管该问题是强NP—完全的,但本文证明了一个最优解的必要条件,由此给出了一个复杂性为O(M~2(n/M+1)~M)的动态规划算法.这是一个相当满意的结果.本文还对表现测度为加权完工时间和的情况做了一些讨论,在权为类权时得到了与上述同样的结果.

This paper deals with the problem of scheduling the manufacture of components at a single facility for subsequent assembly into end products. Each product is composed of a unique component and a common component. Switching from unique components to common components needs a set up time.The objectives are to minimize the total weighted completion time under the case of either the batch availability or the item availability. The polynomial algorithm are given for both the cases.

本文考虑的是工件在单台机器上加工随后组装成产品的排序问题.每个产品由一个特殊工件和一个共同工件组成,机器从加工特殊工件转到加工共同工件有一个调整时间,目标是使所有产品完工时间在批可达或工件可达情况下的加权和最小.对两种情况我们都给出了多项式时间算法.

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

 


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

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