in Two in Two in Two in Two----Stage Flowshops Stage Flowshops Stage Flowshops
in Two in Two in Two in Two----Stage Flowshops Stage Flowshops Stage Flowshops
复制标题
DOI：
--
复制
发表时间：
2000
期刊：
影响因子：
--
通讯作者：
G. Vairaktarakis;M. Elhafsi
中科院分区：
文献类型：
--
作者：
G. Vairaktarakis;M. Elhafsi
柔性制造系统通常被设计成由自动化材料处理设备支持的车间，这些设备便于在相邻阶段的任何两个处理器之间进行路由。这种路由结构是复杂的，并且导致过多的资本投资和管理成本。在本文中，我们提出了一个分解的两个阶段（CID：223）owshop到较小的独立（CID：223）owlines，只允许单向路由。本文用动态规划算法（DP）最优地解决了2条平行（cid：223）流水线的最小完工时间问题。基于DP，我们开发了由两个以上（cid：223）owlines组成的环境的吞吐量性能的下限。我们提出了几种启发式算法，并报告其最优性差距。使用这些算法，我们表明，分解的两个阶段（cid：223）owshop与复杂的路由到（cid：223）owline-like设计与单向路由与吞吐量性能的轻微损失，因此显着（cid：222）不能节省材料处理成本。
Flexible manufacturing systems are often designed as (cid:223) owshops supported by automated material handling devices that facilitate routing among any two processors of adjacent stages. This routing structure is complex, and results in excessive capital investment and costs of management. In this paper we propose a decomposition of two stage (cid:223) owshops into smaller independent (cid:223) owlines that allow for unidirectional routing only. We solve optimally the problem of minimizing makespan on 2 parallel (cid:223) owlines, by means of a dynamic programming algorithm (DP). Based on DP we develop lower bounds on the throughput performance of environments that consist of more than two (cid:223) owlines. We present several heuristic algorithms and report their optimality gaps. Using these algorithms, we show that the decomposition of two stage (cid:223) owshops with complicated routing into (cid:223) owline-like designs with unidirectional routing is associated with minor losses in throughput performance, and hence signi (cid:222) cant savings in material handling costs.