青年中文flow shop的意思
flow shop中文翻譯：
流水車間；流程型；流線式
flow───vi.流; 垂; 流出; （談話、文體等）流暢；n.流動；生產，供應；車流；流量；傳播；流通；滔滔不絕；連貫，流暢；漲潮；泛濫；（蘇格蘭）濕地，沼澤；月經；vt.使泛濫; 淹沒; 排出；n.流動; 滔滔不絕; 漲潮; 連貫；v.（使）流動，涌流；流通；傳播；流暢；充滿；大量供應；漲；漲潮；川流不息；飄揚；來自，由……產生；來月經；（礦物、巖石等）變形；n.(Flow)（美）弗洛（人名）
ceaseless flow───源源不斷的流動
cohesive flow───粘性流
flow controller───[自]流量控制器
current flow───電流
shop───vi.購物；買東西；vt.購物；n.商店；店鋪
flow about───流動
flow production───流水線生產；大規模生產
flow diagram───n.流程圖，作業圖，生產過程圖解; 框圖；[工業]流程圖；作業圖
Where it is usually found: In a cellular shop, batch flow shop, batch job shop.───通常發生在：密集性車間，批量流程車間生產，批量工作車間生產。
Then, found its application in flow shop scheduling problems with two objects.───并應用該算法解決了雙目標的流水車間調度問題。
Flow shop scheduling problems.───流水作業排序問題。
Flow-shop scheduling problem is known to be notoriously intractable, both in theory and practice.───流水作業調度問題在理論和實踐方面均是一個著名的難題。
A nested partition-algorithm and its application to the flow shop scheduling problem are addressed in this paper.───算法用嵌套分區樹來描述流水作業調度問題，對可行域進行系統性分區，然后集中搜索有優良解的區域。
The manufacture model of tube product line in shipyard can be considered as Hybrid Flow Shop.───造船企業管子加工生產的生產模式可以歸結為一種混合流水生產線。
Two new hybrid particle swarm optimization algorithms are proposed in this thesis to solve the flow-shop scheduling problem .───在本論文中我們發展了兩個混合式粒子群演算法來解決流水型工廠排程問題。
An ant colony optimization based algorithm for permutation flow shop scheduling was proposed.───提出了一種求解置換流水車間調度的蟻群優化算法。
The first algorithm allocates jobs to machines and converts the hybrid flow-shop problem in to several flow-shop problems.───第一個演算法分派工件給機器，并將混合式流程工作排程轉換成數個流程工作排程問題。
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."
No-wait flow shop scheduling problems with total flow time minimization is an important manufacturing system widely existing in industrial environments.
Give the arithmetic examples of flow shop and job shop , and show their schedule Gantt pictures.
No-wait flow shop problem is one of flow shop problems, and is a typically NP-complete problem, which means that it is impossible to find the global optimum in polynomial complexity.
An ant - colony heuristic algorithm was proposed for the No - Wait Flow Shop problem ( NWFS ) with makespan criterion.
An ant colony optimization based algorithm for permutation flow shop scheduling was proposed.