Abstract
A linear zero-one integer programming approach is proposed to solve the machine-cell/part-family formation problem for designing cellular manufacturing systems. Given a machine-part incidence matrix that contains process routing information, a similarity coefficient is derived for each pair of machines/parts. The proposed linear zero-one integer programming approach seeks to maximize similarity coefficients of machines/parts subject to an upper bound on the number of machines/parts in each machine cell/part family and a constraint on the number of machine cells/part families. The solutions to the machine-cell/part-family formation problem based on different definitions of similarity coefficients are discussed. >
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.
