Abstract
In this paper, we study the configuration of machine cells in the presence of alternative routings for part types. The objective function is the minimization of transportation costs. Limits on cell sizes as well as separation constraints (i.e. machines that are not allowed to be placed in the same cell) and co-location constraints (i.e. machines that must be placed in the same cell) may be imposed. An efficient Tabu Search (TS) algorithm is proposed to solve this problem. Extensive computational experiences with large-size problems show that this method outperforms some existing Simulated Annealing (SA) approaches.
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.
