Abstract
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 real-world problems, a practical example has been introduced and solved using the proposed model.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
