Identifications of part families and bottleneck parts in cellular manufacturing

Abstract

The formation of machine‐part families is an important task in the design of cellular and flexible manufacturing systems. The formation results in the creation of many benefits for manufacturing systems. Among the many methods utilized in machine‐cells formation, the similarity coefficient method (SCM) is most widely used. When SCM is used, the rearrangement of machine and part components is required to form machine‐part families. This process of rearrangement has been considered as being subjective and difficult and may result in improper assignments to parts families, resulting in a negation of benefits promised. This paper presents an effective algorithm to identify part‐families and bottleneck‐parts, given machine groupings, rather than addressing the machine grouping problem in general.

A Framework to Support Semantic Interoperability in Product Design and Manufacture

“…The concept of part families, in which specific parts are grouped according to their manufacturing operation requirements, is particularly relevant to group technology and cellular manufacturing systems (Ang, 1998;Chan at al, 2006;Yang and Yang, 2008). Categorisation of part families with respect to specific viewpoints arising in design and manufacture, as is the case with features, is also a fact, for example, design, manufacturing and assembly part families (Westkämper et al, 2000;Simpson, 2004;Jiao et al, 2007;Gunendran and Young, 2008).…”

Scheduling Optimization Cell Formation Problem for Cellular Manufacturing System Using Meta-Heuristic Methods

“…An improperly scheduled and managed bottleneck is likely to incur a significant loss on the shop floor. Several approaches to grouping machine part families have emerged [4]. GT forms the basis of Cellular Manufacturing Systems (CMS).…”

Evaluation of Cell Formation Algorithms and Implementation of MOD-SLC Algorithm as An effective Cellular Manufacturing System in a Manufacturing Industry

“…Askin et al (1991) proposed a Hamiltonian-path algorithm for the grouping problem. David et al (1998) proposed an effective algorithm to identify part-families and bottleneck-parts, given machine groupings. Prabbahakaran et al (2002) addressed on an application of the maximal Spanning Tree approach for machine cell formation.…”