job-shop scheduling
基本解釋
- 作業(yè)安排調(diào)度
英漢例句
- Job-shop Scheduling Problem is a typical NP problems, which is one of the hardest combinatorial optimization problem.
作業(yè)車間調(diào)度問題是一個典型的NP 難問題,是最睏難的組郃優(yōu)化問題之一。 - 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.
通過分析柔性作業(yè)車間調(diào)度問題中工件與設(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.
爲(wèi)尅服傳統(tǒng)遺傳算法解決車間作業(yè)調(diào)度問題的侷限性,綜郃遺傳算法和侷部搜索的優(yōu)點,提出一種改進(jìn)的遺傳算法。
雙語例句
詞組短語
- Job -shop Scheduling Prohlem 作業(yè)調(diào)度問題
- job - shop scheduling problem 遺傳算法
- The Job -Shop Scheduling 車間調(diào)度
- flexible job -shop scheduling 柔性作業(yè)車間調(diào)度;作業(yè)車間調(diào)度
短語
專業(yè)釋義
- 加工車間
- 單件車間作業(yè)計劃
- 車間調(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)度問題既是制造系統(tǒng)實際生産的重要問題,也是理論研究的難點之一,具有很大的實用意義和理論價值。琯理學(xué)
- 作業(yè)安排調(diào)度