flow shop 中文意思是什麼

flow shop 解釋
流水車間
  • flow : vi 1 流，流動。2 （血液等）流通，循環。3 流過；川流不息；（時間）飛逝；（言語等）流暢。4 （衣服、...
  • shop : n 1 〈英國〉鋪子；店鋪；（零售）商店〈美國用 store〉；（大商店裡的）特殊部門。2 〈pl 〉工廠；工場...
  1. A heuristic algorithm for flow shop problem in batch processing

    成組排序問題的調度演算法設計及其界的估計
  2. Notwithstanding an unusual flow of company, the master of the wine-shop was not visible.

    雖然人們來往異常頻繁，酒鋪主人並不出現。
  3. T. p. hong, p. y. huang, and g. horng, ( 2004 ) " combining the lpt and the gupta approaches to solve group flexible flow - shop problems, " 15th international conference of information management, taiwan, may 29, 2004

    洪國寶，王乾隆，洪宗貝，黃?瑩， "擴展pt排程演演算法以解決彈性流程問題， " 2003人工智慧、模糊系統及灰色系統聯合研討會， 2003年12月
  4. Intelligent hybrid optimization strategy and its application to flow - shop scheduling

    智能混合優化策略及其在流水作業調度中的應用
  5. By this algorithm, the optimal solution can been obtained in transportation problem n assignment problem, traveling salesman problenu flow shop sequencing problems hamilton problem. in addition, numerical examples have been given to demonstrate the actual applicant procedure

    並且通過對排序問題、貨郎擔貨問題、指派問題、 hamilton問題等線形規劃問題典型算例的求解，表明新的分配原則在一定程度上簡化了原有的分配過程，具有更強的通用性。
  6. The paper details the objective, types and present research of production scheduling, discusses the current research state of the flow shop scheduling and the relative algorithm of this type of problem, pinpoints existing disadvantages, and then provides the generalization of ordinal coding of genetic algorithm and genetic computing element based on the order

    本文詳細介紹了生產作業調度問題的目標、類型及研究現狀，並著重就流水型作業調度問題的研究現狀和該類問題的數學模型與相關演算法，如啟發式方法、進化演算法、鄰域搜索方法等進行了探討，指出了存在的問題。
  7. Then, found its application in flow shop scheduling problems with two objects

    並應用該演算法解決了雙目標的流水車間調度問題。
  8. An improved evolutionary algorithm based on heuristic rules for flow shop scheduling

    基於啟發式規則的新型進化演算法在流水車間調度中的應用
  9. 3. aiming at the limitation of simulated anneal genetic algorithm on a high computation while applied to flow shop scheduling problems, the paper presented selected simulated anneal genetic algorithm

    三、針對模擬退火遺傳演算法解決流水車間調度問題存在收斂速度慢的局限性，提出了選擇性退火的遺傳演算法。
  10. Pan, chao - hsien and jen - shiang chen ( 2000 ), “ minimizing tardiness on a two - machine flow - shop ”, proceedings of the 5 th annual international conference on industrial engineering theory, applications and practice, pp. 1 - 12, hsin - chu, taiwan

    陳禎祥、蔡麗蕙等學生（ 2000 ） ，故障樹建立之應用案例探討，第十五屆全國技術及職業教育研討會：醫護類、公共衛生組，嶺東技術學院，第123 - 133頁。
  11. The fundamentals and basic flow of genetic algorithm are discussed in detail. associated with the production mode and characteristics of wall - paper industry, its production scheduling belongs to the hybrid flow shop ' s problem. applied based - on permutation coding genetic algorithm and used minimal production time as target function, it is solved the problem of low efficiency of wall - paper production equipments " utility that is caused by manpower scheduling and improved the production efficiency

    2 ）對生產調度問題的研究現狀和研究方法做了綜述和整理，深入探討了遺傳演算法的基本原理和基本流程，並結合墻紙行業的生產模式和生產特點，指出其屬于混合flowshop問題，採用基於置換編碼的遺傳演算法，並以最小生產時間作為目標函數，較好的解決了由人工調度帶來的墻紙生產設備使用效率偏低的問題，提高了生產效率。
  12. Flow - shop problem by partheno - genetic algorithm

    問題中的應用
  13. What is more, based on the computing model of the finishing time per piece of flow shop scheduling in the parallel movement, the paper analyzes the subordinate function of its finishing time per piece in respective conditions of definite due date and fuzzy due date, and mutual relationship of two objective functions between minimization of delayed term and maximization of general satisfaction, pointing that the former is the subset of the latter. and representing the satisfaction level of the manager toward finishing time of the piece with the subordinate function of fuzzy due date, making general satisfaction level as objective function, the paper accordingly sets up a mathematical model in the condition of fuzzy due date, and designs a computer simulating system in light of genetic algorithm to carry on an emulation experiment

    在平行順序移動方式下flowshop調度問題的工件完工時間的計算模型基礎上，分析了帶固定交貨期和模糊交貨期時該問題的工件完工時間的隸屬函數，及總拖期最小化和總滿意度最大化這兩個目標函數的相互關系，指出前者西南交通大學博士研究生學位論文第頁問題是後者問題的一個子集，用每個工件模糊交貨期的隸屬函數表示決策者對該工件完工時間的滿意度，以總滿意度為目標函數，相應地建立了該問題下帶模糊交貨期的數學模型，設計了一個基於遺傳演算法的計算機模擬系統進行模擬試驗，結果是令人滿意的。
  14. We have found that many application of linear programming, such as assignment problem., traveling salesman problem, flow shop sequencing problem, hamilton problem and so on, fall into the category of transportation problem, that is, of shipping at minimum total cost a homogeneous good from a set of m warehouses to a set of n markets

    元素判別值分配法是基於運輸問題引發出的通用解法，通過遍歷調運表中的各行各列計算出每個元素的分配優先權重? ?元素判別值，然後依據元素判別值，根據調配原則進行元素分配，使得分配方案在多數情況下一次分配即可獲得最優解，但目前仍需要完善。
  15. Parallel flow shop scheduling problem using probability learning based evolutionary algorithm

    并行流程車間調度問題及其概率學習進化演算法
  16. According to ants ' routing behavior model and its resemblance to hybrid flow shop scheduling, an ant - like scheduling algorithm for hybrid flow shop is put forward

    摘要根據螞蟻路逕尋優行?模型及其與混流車間調度的相似性，提出混流車間的螞蟻調度演算法。
  17. In this paper, the computational complexity of the three - stage flow - shop with some batch machines to minimize the makespan is studied

    摘要研究含有批處理機的三臺機器流水作業加工總長問題的計算復雜性。
  18. Some typical tsp problems from tsplib were chosen to test the performance of pmaco. the results show that the stagnation problem has been greatly improved and that the search precision and speed have been enhanced. pmaco is also applied to flow - shop scheduling problems, and can get a satisfying rate of finding the global optima

    2 .從tsplib中選取幾個典型問題對pmaco進行了tsp問題上的性能測試，模擬實驗結果表明，該演算法不僅對解決蟻群演算法的停滯問題非常有效，而且提高了運算精度和速度;將pmaco用於求解flow - shop生產調度問題，選取兩個應用實例對其進行檢驗，優化結果均令人滿意。
  19. Finally, genetic optimization research is summarized on several typical production scheduling problems. after expounding the general idea of genetic algorithm, the comparative advantages in contrast to the traditional algorithm, the basic characteristics of genetic algorithm and its theoretical base, the paper puts emphasis on the efficiency of genetic algorithm in the scheduling of flow shop, and puts forward an improving genetic algorithm : the ordinal genetic algorithm based on the heuristic rules. the new algorithm introduces into the initial group the solution of heuristic algorithm, and in the group structure adopts a strategy of first ordering according to the priority of the adaptive solution, and then defining a new way of choosing probability by segments, which provides more hybridizing opportunity for optimized individuals, and designs variation - control rule to prevent single population and partial optimal solution

    在論述了遺傳演算法的思想、與傳統搜索演算法的比較優勢、遺傳演算法的基本特徵和遺傳演算法的理論基礎（包括模式定理、隱含并行性、基因塊假設、欺騙問題和收斂性定理）后，重點探討了遺傳演算法在flowshop調度問題中的潛力和有效性；結合啟發式規則，提出了一個改進的遺傳演算法?基於啟發式規則的有序遺傳演算法，新演算法在初始種群中引入了啟發式演算法的解，在種群結構上採用了先按適應值優劣排序再分段確定選擇概率的新策略，使優質個體有更多的雜交機會，在變異中設計了變異控制規則，以防種群單一化，而陷入局部優化解。
  20. So far, the computational complexity of the makespan of the three - stage flow - shop with some batch machines in all situations is completely solved

    至此，含有批處理機的三臺機器流水作業加工總長問題在所有情形下的計算復雜性得到了解決。
分享友人
分享到 Line

分享到臉書