Mohammad Mohammadi; Kamran Forghani
Abstract
The cell formation problem and the group layout problem, both are two important problems in designing a cellular manufacturing system. The cell formation problem is consist of grouping parts into part families and machines into production cells. In addition, the group layout problem is to find the arrangement ...
Read More
The cell formation problem and the group layout problem, both are two important problems in designing a cellular manufacturing system. The cell formation problem is consist of grouping parts into part families and machines into production cells. In addition, the group layout problem is to find the arrangement of machines within the cells as well as the layout of cells.In this paper, an integrated approach is presented to solve the cell formation, group layout and routing problems. By Considering the dimension of machines, the width of the aisles, and the maximum permissible length of the plant site, a new framework, called spiral layout, is suggested for the layout of cellular manufacturing systems. To extend the applicability of the problem, parameters such as part demands, operation sequences, processing times and machine capacities are considered in the problem formulation. The problem is formulated as a bi-objective integer programming model, in which the first objective is to minimize the total material handling cost and the second one is to maximize the total similarity between machines. As the problem is NP-hard, three metaheuristic algorithms, based on Genetic Algorithm and Simulated Annealing are proposed to solve it. To enhance the performance of the algorithms, a Dynamic Programming algorithm is embedded within them. The performance of the algorithms is evaluated by solving numerical examples from the related literature. Finally, a comparison is carried out between the proposed spiral layout and the linear multi-row layout which has recently presented in the literature
Payam Chiniforooshan; Behrooz Pourghannad; Narges Shahraki
Volume 9, Issue 23 , December 2011, , Pages 209-231
Abstract
In this paper, a mathematical model is proposed to solve cell formation problem considering alternative process routings in which more than one process route for each part can be selected. The model attempts to minimize intercellular movements and incorporates several real-life production factors and ...
Read More
In this paper, a mathematical model is proposed to solve cell formation problem considering alternative process routings in which more than one process route for each part can be selected. The model attempts to minimize intercellular movements and incorporates several real-life production factors and practical constraints. In order to increase the flexibility provided by the multiplicity of routings, the model distributes production volume of each part among alternative routes. Also, a constraint enforcing work load balancing among machines is included in the model. Due to the complexity and combinatorial nature of this model, an enhanced algorithm comprised of a genetic algorithm and a linear programming is proposed for solving the model. The proposed algorithm is tested by a range of test problems and compared with two algorithms from the literature .The computational results show that the proposed algorithm is effective and the proposed approach offers better solution.
