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
可分任務的完工時間
