助手标题  
全文文献 工具书 数字 学术定义 翻译助手 学术趋势 更多
查询帮助
意见反馈
   maximum lateness 的翻译结果: 查询用时:0.008秒
图标索引 在分类学科中查询
所有学科
数学
工业通用技术及设备
更多类别查询

图标索引 历史查询
 

maximum lateness     
相关语句
  最大迟后
     A Polynomial Time Algorithm for Maximum Lateness in Single Machine Scheduling with Batching
     单机分批加工最大迟后问题的一个多项式时间算法
短句来源
     Minimizing the Maximum Lateness of Order with Multiple Job Classes
     订单带多类工件时的最大迟后问题
短句来源
     A Quick Algorithm for the Maximum Lateness in Single Machine Scheduling with Batching
     单机分批加工最大迟后问题的一个快速算法
短句来源
     We are asked to schedule the n jobs in such a way that some objective functions are minimized. For the following three objective functions: the total weighted completion time, the maximum lateness and the number of tardy job, this paper proves that the WSPT rule, the EDD rule and the modified Moore-Hodgson algorithm can construct the optimal sequence under corresponding consistent condition, respectively. This paper givers also the error estimation for these three rules in general cases.
     本文对加权完工时间之和,最大迟后,延误工件数这三个目标函数,给出了在相应的一致条件下,对应的WSPT规则,EDD规则,修正Moore-Hodgson算法可获最优序,并估计了在一般情况下由该三规则所获序的误差.
短句来源
     Minimizing the Maximum Lateness on a Two Machine Flowshop with Batch Processors
     两台机器流水作业中带成组加工的最大迟后问题
短句来源
更多       
  最大延迟
     Minimizing the maximum lateness with major and minor setup times in batch processing
     成组加工中有主从调整时间的最大延迟问题
短句来源
     Rescheduling to Minimize Maximum Lateness and Total Tardiness under Compatible Job Systems
     相容工件系统的最小化最大延迟与误工和的重新排序(英文)
短句来源
     Minimizing Maximum Lateness On Batching Machine
     最大延迟时间的极小化分批排序问题
短句来源
     In view of the properties of multi product batch scheduling problem with major and minor setup times that are usually involved in a steel pipe plant of iron and steel industry, a 0 1 mixed integer programming model with minimizing of maximum lateness as an optimal objective function is proposed.
     针对钢管生产过程具有多产品和主从调整时间特性的实际批组调度问题 ,以最小化工件的最大延迟为目标函数 ,建立了问题的 0 - 1混合整数规划模型 ;
短句来源
     The first criterion is to minimize maximum lateness,the second criterion is to minimize makespan and the third criterion is to minimize an arbitrary regular objective function.
     第一指标为最大延迟,第二指标为最大完工时间,第三指标为关于工件完工时间的任意正规函数。
短句来源
  最大延误
     MINIMIZE THE MAXIMUM LATENESS WITH WEIGHTED IN A SINGLE MACHINE PROBLEM
     任务无准备时间最小化加权最大延误单机调度问题的若干结果
短句来源
     Optimal algorithms are presented respectively for single machine scheduling of minimizing the makespan, weighted sum ofcompletion times, weighted sum of completion times of chains precedence constraints. maximum cost and maximum lateness.
     研究递减率与基本加工时间相关的单机问题,对最大完工时间问题、加权完工时间和问题、工件具有平行链约束的加权完工时间和问题、最大费用问题与最大延误问题分别给出了最优算法。
短句来源
     Object function is to minimize schedule length ,total completion time and maximum lateness.
     目标函数主要考虑了最大完工时间(C_(max))、总完工时间(∑C_j)、最大延误时间(L_(max))。
短句来源
     Optimal algorithms are presented respectively for single machine scheduling problems of minimizing the makespan, weighted sum of completion times, maximum lateness and maximum cost.
     对单机调度问题中目标函数为极小化最大完工时间加权完工时间和 ,最大延误以及最大费用等问题分别给出了最优算法 .
短句来源
  最大延期
     In this study, we propose the 0-1 mixed integer programming and constraint programming model to solve this problem, the optimal objective of which is to minimize the maximum lateness of the order. With regard to the middle-small size problem, two models' optimal solutions are tested and compared by using the OPL Studio. The simulation results show that constraint programming is much more efficient, and the results could be used to evaluate the effectiveness of the other heuristic algorithm.
     针对这一问题 ,以订单的最大延期为优化目标 ,提出 0 -1混合整数规划和约束规划两种求解模型 ,并通过使用OPLStudio编程来验算、比较两种模型在中小问题规模下的最优解 ,仿真结果表明 ,利用约束规划模型得到的最优解更有效 ,同时其结果可用于验证其他启发式算法的有效性 .
短句来源

 

查询“maximum lateness”译词为其他词的双语例句

     

    查询“maximum lateness”译词为用户自定义的双语例句

        我想查看译文中含有:的双语例句
    例句
    为了更好的帮助您理解掌握查询词或其译词在地道英语中的实际用法,我们为您准备了出自英文原文的大量英语例句,供您参考。
      maximum lateness
    AnO (nlogn)-algorithm is given for the two-machine, job-shop scheduling problem withn unit-time tasks in which maximum lateness is to be minimized.
          
    Minimizing maximum lateness in a two-machine unit-time job shop
          
    We study the problem of scheduling a set of jobs on a single machine, to minimize the maximum lateness ML or the maximum weighted lateness MWL under stochastic order.
          
    Single-machine scheduling to stochastically minimize maximum lateness
          
    We give various extensions of this result including one to maximum lateness minimization with release times and due dates.
          
    更多          


    This paper discusses pre-emptively scheduling independent tasks with all releases time the same and all deadlines time the same on m parallel processors with processing speed being step functions.We present a necessary and sufficient condition for the existence of feasible pre- emptive schedule of tasks set T on parallel processors M_1,M_2,…M_m.If the feasible pre-emptive schedule existes,we give an 0(mblogb+nlogn+nb) algorithm to find one((where b is the sum number of jump points of all speed functions).If...

    This paper discusses pre-emptively scheduling independent tasks with all releases time the same and all deadlines time the same on m parallel processors with processing speed being step functions.We present a necessary and sufficient condition for the existence of feasible pre- emptive schedule of tasks set T on parallel processors M_1,M_2,…M_m.If the feasible pre-emptive schedule existes,we give an 0(mblogb+nlogn+nb) algorithm to find one((where b is the sum number of jump points of all speed functions).If any feasible pre-emptive schedule doesn't exist,we give an 0(nlogn+mblogm+blogb)algorithm to find a schedule which mimimize the maximum lateness over all jobs.

    本文讨论了具有加工速度为非负阶梯函数的平行机上工件具有共同起止的抢先进度安排问题,给出了工件集在平行机上存在可行的抢先进度安排的充要条件。当可行的抢先进度安排存在时,提出了一个计算复杂度为0(mblogb+nlogn+nb)的求解算法(其中b为阶梯函数的间断点的总个数):当可行的抢先进度安排不存在时,对该问题的最大廷误问题提出了计算复杂度为0(nlogn+mblogm+blogb)的求解算法。

    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.

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

    his paper deals with the following single machine scheduling with batching: n jobs arrive at time zero and need to be processed in batches on the same machine. The jobs in the same batch are processed successively and the completion times of the jobs in the same batch are equal to the completion time of the batch to which they belong. There exists a setup time for a machine whenever the machine begins to process a new batch. Taking the minimization of the maximum lateness of the jobs as the objective...

    his paper deals with the following single machine scheduling with batching: n jobs arrive at time zero and need to be processed in batches on the same machine. The jobs in the same batch are processed successively and the completion times of the jobs in the same batch are equal to the completion time of the batch to which they belong. There exists a setup time for a machine whenever the machine begins to process a new batch. Taking the minimization of the maximum lateness of the jobs as the objective function, this paper develops a dynamic programming for this batching problem.

    本文考虑下述单机分批加工问题:在时刻零同时到达的n个工件需分成若干批在同台机器上加工,同批中的工件相邻,任一工件的完工时间为所在批中全部工件完工时的时间,机器每加工一批工件需一相同的调整时间.文中以工件的最大迟后为目标函数,对上述分批问题用动态规划技术给出了一多项式时间算法.

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

     


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

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