An approach to the machine layout problem in a cellular manufacturing environment

The model of the machine layout problem (MLP) in a cellular manufacturing environment attains additional dimensions as it should satisfy the qualitative interconnections between the machines and the location restrictions of an existing factory environment. A new MLP model based on merging pre-emptive goal programming and simulated annealing has been developed for machine layout in cells. This model seeks to find feasible solutions by addressing practical issues of implementation as well as reducing the total travel distances for parts between machines. The new model can also be applied to facility layout problems (FLP). The computational work is demonstrated by applying the model to problems of both quantitative and qualitative types, and has produced encouraging results. This model is particularly attractive for layout problems with realistic goals and constraints. To show the performance of the model in handling rear-world problems, a practical example has been introduced and solved using the proposed model.