flowshop
基本解釋
- 流水車間
英漢例句
- At last thealgorithms are tested against by 21 Rec FlowShop problems. Also, the topologycharacteristics and the performance are analyzed as well.
最后針對21個Rec類FlowShop問題進行實證分析,分析了該類問題的拓撲空間特性以及雜交算法性能的改進情況。 - Multi-Objective Local Search(MOLS) algorithm was proposed to solve the permutation flowshop sequencing problem with bi-objectives of makespan and total flowtime.
針對求解最小化最大完工時間和總流程時間的多目標(biāo)同順序流水作業(yè)問題,提出了一個多目標(biāo)局部搜索算法。 - Abstract: To solve the no-wait flowshop scheduling problem to minimize total tardiness with rule scheduling methods, it is necessary to compute every job's complete time.
中文摘要: 在使用規(guī)則調(diào)度方法求解無等待最小化總拖期流水車間調(diào)度問題時,前提是計算工件的完工時間。 - Computational results show that the proposed DPSO algorithm with the two-point inheritance scheme is very competitive for the lot streaming flowshop scheduling problem.
實驗結(jié)果顯示，利用兩點繼承機制的改善后DPSO演算法，在此排程問題上呈現(xiàn)最好的績效。 - Then, we consider an n-job, m-machine lot streaming problem in a flowshop with equal-size sublots where the objective is to minimize the total weighted earliness and tardiness.
接著，我們考慮一個在n件工件及m部機器下，批量流在流程型工廠之排程問題，其目標(biāo)是最小化總加權(quán)提早及延遲時間。