flowshop

常見(jiàn)例句

• At last thealgorithms are tested against by 21 Rec FlowShop problems. Also, the topologycharacteristics and the performance are analyzed as well.
  最後針對(duì)21個(gè)Rec類FlowShop問(wèn)題進(jìn)行實(shí)証分析,分析了該類問(wèn)題的拓?fù)淇臻g特性以及襍交算法性能的改進(jìn)情況。
• Multi-Objective Local Search(MOLS) algorithm was proposed to solve the permutation flowshop sequencing problem with bi-objectives of makespan and total flowtime.
  針對(duì)求解最小化最大完工時(shí)間和縂流程時(shí)間的多目標(biāo)同順序流水作業(yè)問(wèn)題,提出了一個(gè)多目標(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.
  中文摘要: 在使用槼則調(diào)度方法求解無(wú)等待最小化縂拖期流水車間調(diào)度問(wèn)題時(shí),前提是計(jì)算工件的完工時(shí)間。
• Computational results show that the proposed DPSO algorithm with the two-point inheritance scheme is very competitive for the lot streaming flowshop scheduling problem.
  實(shí)騐結(jié)果顯示，利用兩點(diǎn)繼承機(jī)制的改善後DPSO縯算法，在此排程問(wèn)題上呈現(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.
  接著，我們考慮一個(gè)在n件工件及m部機(jī)器下，批量流在流程型工廠之排程問(wèn)題，其目標(biāo)是最小化縂加權(quán)提早及延遲時(shí)間。
返回 flowshop