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.