Abstract

A large number of non–traditional search algorithms are available for function optimisation. The cell formation problem is the important step in the design of a cellular manufacturing system. The objective is to identify part families and machine groups and consequently to form manufacturing cells with respect to minimising the number of exceptional elements. An efficient tabu search (TS) algorithm is proposed to solve cell formation problem because it perform considerable search before terminating to provide a good solution to the problem. In this work the implementation of tabu search for the design of cell formation problem and minimise the number of exceptional elements has been done by this method and it is compared with other existing methods.

Full Text
Paper version not known

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 call

Disclaimer: 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.