关键词: 车间布局, 启发式算法, 优化算法, 敏捷制造

Abstract: To reduce the nonproductive cost of workpiece in cellular shop，it is necessary to optimize the machine layout in cellular shop based on the machining process of workpiece. A heuristic algorithm was presented that addressed problems of machine layout in cellular manufacturing. The algorithm considered one cell at a time with a maximum of 9 machines, which was assigned into a 3 ×3-grid space according to the ranking result. The algorithm used adoption, merging, swapping operations to relate machines in a cell by examining the merged part flow weights of machine pairs. The establishment of the part flow weight included practical constrains, such as the part-handling factor and the number of parts per transportation. Then, an objective function was employed to determine the total traveling score in which the traveling distance was covered. The algorithm provided near-optimum layouts. Finally, a case was used to illustrate the operations.

Key words: machine layout, heuristic algorithm, optimum algorithm, cellular manufacturing