makespan
美 
英
例句
An optimal scheduling model, which had resource constraints and adopted makespan as objective function, was built.
建立了以资源限制为约束条件，以总生产完成时间最短为目标函数的优化调度模型。
The objective is to minimize the sum of the makespan and the number of machines to be purchased.
目标是使makespan与购买机器费用的总和尽可能小。
The case of jobs with same processing time is addressed and each party's processing cost is determined by his minimized makespan.
研究了加工工件都相同的情况下，由最小的最大完工时间作为加工成本的两人合作博弈问题。
An ant- colony heuristic algorithm was proposed for the No - Wait Flow Shop problem(NWFS) with makespan criterion.
针对以最大完成时间为目标的无等待流水车间调度问题，提出了一种蚁群算法。
The practical application showed that the average makespan was shortened by a large scale.
实际应用表明，平均加工周期是由大型缩短。
In this paper, we investigate parallel machine on-line scheduling problem with special jobs to minimize the makespan.
本文研究一类具有特殊工件的平行机在线排序问题，目标是最小化最大完工时间。
Discrete Particle Swarm Optimization(DPSO) algorithm was proposed for no-wait flow shop scheduling problem with makespan criterion.
针对以生产周期为目标的无等待流水车间调度问题，提出了一种离散粒子群优化算法。
So when grid users have constraints both on makespan and task waiting time, these two algorithms cannot facilitate strong usability. 3.
因而当用户同时对调度跨度与任务等待时间存在需求时，这两个算法均不具备较强的可用性。
The objective function is to minimize total resource consumption of setup time and jobs under makespan constrains.
目标函数为在满足最大完工时间限制条件下极小化安装时间消耗资源量与工件消耗资源量的总和。
A critical block is some operations that decided the makespan on given schedule.
关键块是给定调度中决定了总流程时间的部分工序。
A preemptive uniform machine scheduling problem with arrival time and minimum makespan is studied in this paper.
研究了可中断的带有到达时间的使总完工时间最小的恒速机排序问题。
A algorithm based on taboo search technique is presented for solving the minimum makespan problem of no-wait flow shop scheduling.
描述了一种以解决总完工时间最小为目标的无等待流水调度问题的算法。
The problem of flow shop scheduling with the effect of learning to minimize makespan is studied.
以最小化时间表长为目标函数，对具有学习效果的两机流水车间调度问题进行研究。
A new Algorithm for Minimizing the Makespan in the Case of Scheduling Identical Parallel Machines
相同并行机上工件排序问题的一种新算法
A Note on an On-line Algorithm for the Parallel-batching Scheduling to Minimize Makespan
平行批排序最小化最大完工时间在线算法的一个注记
Makespan Scheduling for A Class of Continuous Productions with Buffers
一类带缓冲区的连续生产过程的最速生产调度
Minimizing the Makespan of A Special Three Machines Flop Shop Problem
一类三机器流水作业极小化加工全长问题
Single Machine Scheduling and Job Delivery to Minimize Makespan with the Processing Times of Jobs being Proportional to Their Sizes
加工时间和尺寸成正比单机排序和工件运输的最小化最大完工时间问题
Genetic arithmetic designing for job Shop scheduling problem with minimal makespan
基于最小完工期的离散型作业车间调度问题的遗传算法设计
Makespan Problem in Group Processing with Controllable Processing Time
一个成组加工中加工时间可变的加工全程问题
Single Machine Batch Scheduling with Rejection to Minimize Makespan
极小化最大完工时间及拒绝费用的单机可拒绝分批排序
Scheduling a Single Continuous Batch Processing Machine to Minimize Makespan
极小化最大完工时间的单机连续型批调度问题
Fast algorithm for calculating the minimum makespan in tree-type networks
树状网络中最短接通时间的快速算法
Makespan Scheduling of Process Production
连续生产过程的最速生产调度
Research on Job Shop Scheduling of Makespan and Operating Cost with Bi-direction and Dual-objective Based on Genetic Algorithm
基于遗传算法的生产周期和生产费用双目标双向车间调度问题的研究
Minimizing Makespan in Single-Ma chine Batch Processing
极小化最大完工时间的单机分批加工问题
Makespan of a batch of partitionable tasks
可分任务的完工时间
