A Cut Approach for Solving the Single-Row Machine Layout Problem (2014 年工業與應用數學學會第 62 屆年會發表論文摘要)
(Society of Industrial and Applied Mathematics, 2014 SIAM Annual Meeting) Session: CP30 Optimization: Friday, July 11, 4:00 PM - 6:00 PM
Shine-Der LEE
Graduate School of Industrial Management National Cheng Kung University 1 University Road, Tainan, 70101, Taiwan
Abstract
A cut approach is developed for the machine configuration in a single-row linear layout, with objective to minimize the total material movement cost. We show that the above equidistant linear layout problem is equivalent to the locale network problem by graph theory.
The minimum cut, which has the minimum capacity in each locale network, is the corresponding optimal layout that minimizes the material handling cost. The computational complexity of the cut approach is Ο n( )3 , where n is the number of workstations in the layout problem. In addition, the non-equidistant linear layout problem can be transformed into an equidistant linear layout problem; and then solved with the extended approach.
