To read this content please select one of the options below:

Manufacturing cell formation problem: a graph partitioning approach

Hassan M. Selim (Department of Business Administration, College of Business & Economics, United Arab Emirates University, Al Ain, United Arab Emirates)

Industrial Management & Data Systems

ISSN: 0263-5577

Article publication date: 1 August 2002

931

Abstract

The design of a cellular manufacturing system requires that a machine population be partitioned into machine groups called manufacturing cells. A new graph partitioning heuristic is proposed to solve the manufacturing cell formation problem (MCFP). In the proposed heuristic, The MCFP is represented by a graph whose node set represents the machine cluster and edge set represents the machine‐pair association weights. A graph partitioning approach is used to form the manufacturing cells. This approach offers improved design flexibility by allowing a variety of design parameters to be controlled during cell formation. The effectiveness of the heuristic is demonstrated by comparing it to two MCFP published solution methods using several problems from the literature.

Keywords

Citation

Selim, H.M. (2002), "Manufacturing cell formation problem: a graph partitioning approach", Industrial Management & Data Systems, Vol. 102 No. 6, pp. 341-352. https://doi.org/10.1108/02635570210432046

Publisher

:

MCB UP Ltd

Copyright © 2002, MCB UP Limited

Related articles