job-shop scheduling

基本解釋

• 作業(yè)安排調(diào)度

英漢例句

雙語(yǔ)例句

• Job-shop Scheduling Problem is a typical NP problems, which is one of the hardest combinatorial optimization problem.
  作業(yè)車間調(diào)度問(wèn)題是一個(gè)典型的NP 難問(wèn)題，是最困難的組合優(yōu)化問(wèn)題之一。
• A genetic algorithm with master-slave structure was proposed to solve the flexible Job-Shop scheduling problems based on the analysis of jobs, machines and their relationships.
  通過(guò)分析柔性作業(yè)車間調(diào)度問(wèn)題中工件與設(shè)備的特征及兩者間的關(guān)系，提出了一種主-從遺傳算法的調(diào)度方案。
• To overcome the limitations of traditional Genetic Algorithm (GA) when solving the problem of job-shop scheduling, an improved GA was proposed by taking advantages of traditional GA and local search.
  為克服傳統(tǒng)遺傳算法解決車間作業(yè)調(diào)度問(wèn)題的局限性，綜合遺傳算法和局部搜索的優(yōu)點(diǎn)，提出一種改進(jìn)的遺傳算法。

• job-shop scheduling更多例句

詞組短語(yǔ)

短語(yǔ)

• Job -shop Scheduling Prohlem 作業(yè)調(diào)度問(wèn)題
• job - shop scheduling problem 遺傳算法
• The Job -Shop Scheduling 車間調(diào)度
• flexible job -shop scheduling 柔性作業(yè)車間調(diào)度;作業(yè)車間調(diào)度

• job-shop scheduling更多詞組

專業(yè)釋義

機(jī)械工程

• 加工車間

經(jīng)濟(jì)學(xué)

• 單件車間作業(yè)計(jì)劃

能源科學(xué)技術(shù)

• 車間調(diào)度

  Job-shop scheduling problems are not only an important issue in practical production of manufacturing system but also one of the difficulties of theoretic research. It has large practical significance and theoretical value.
  車間調(diào)度問(wèn)題既是制造系統(tǒng)實(shí)際生產(chǎn)的重要問(wèn)題,也是理論研究的難點(diǎn)之一,具有很大的實(shí)用意義和理論價(jià)值。

  管理學(xué)

• 作業(yè)安排調(diào)度