Abstract
This paper presents a genetic algorithm (GA) approach to the machine-component grouping problem with multiple objectives: minimizing costs due to intercell and intracell part movements; minimizing the total within cell load variation; and minimizing exceptional elements. Manufacturing cells are formed based on production data, e.g. part routing sequence, production volume and workload. Also, we will discuss the implication of part alternative routings and the method we suggest to deal with it. Special genetic operators are developed and multiple experiments are performed. Finally, the results obtained with the proposed algorithm on the tested problems are compared with those of others.
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.
