This paper describes a tool allocation method applying the graph theory. In flowshop type FMS, it is necessary to make good use of the flowshop characteristics. Aiming at the direction of job flow, the backward flow must be minimized. In the case of completely separated functional FMS, the minimization is very important. Accordingly, by regarding the processing order as the directed graph and aiming to obtain strongly connected components of the graph, we propose an optimization of tool allocation to minimize the backward flow without overlapping tools.
|ジャーナル||Transactions of the Japan Society of Mechanical Engineers Series C|
|出版ステータス||Published - 1993|
ASJC Scopus subject areas