A Three-Stage Approach to a Multirow Parallel Machine Layout Problem

Abstract

Facility layout is vital to save operational cost and enhance production efficiency. Multirow layout is a common pattern in practical manufacturing environment. Although parallel machines are frequently implemented in practice to enhance productivity, there lacks any in-depth study on multirow layout problem with parallel machines. In this paper, its mathematical programming formulation is established to minimize material flow cost. A three-stage approach is proposed to solve it. First, a Monte Carlo heuristic is devised to optimize the sequence of machines on multiple rows. Second, a linear program is used to determine the optimal exact location of each machine. Finally, an exchange heuristic is adopted to reassign material flows among parallel machines in different machine groups. An iterative optimization strategy is suggested to execute the three stages repeatedly to improve the solution quality. This approach is applied to a number of problem instances and compared against others. The experimental results show that it is able to effectively solve this new problem and significantly decrease material flow cost. Note to Practitioners —Multirow layout is common in practical manufacturing systems in which parallel machines are often used to improve productivity, shorten production time, and guarantee some flexibility. This paper studies a multirow parallel machine layout problem that involves machine groups, each of which contains parallel machines. Solving it is to locate all machines at multiple parallel rows to minimize material flow cost. It is challenging because one needs to decompose material flows and determine exact locations of machines simultaneously. A three-stage approach is proposed to do so. It is applied to many problem instances. The results demonstrate that it works well for such layout problems with parallel machines.