Abstract

The grouping of parts and machines for design of cellular manufacturing systems is carried out by clustering analysis. Two major drawbacks of some clustering algorithms have been identified in handling bottleneck machines for forming machine cells. These drawbacks include solution inconsistency and possible misclustering which result in unnecessary bottleneck machines required. Presents a more robust clustering algorithm to overcome these drawbacks. The algorithm consists of four stages: selection of initial cluster centres; cluster‐seeking analysis; eliminating unnecessary bottleneck machines; and new parts assignments. The decision functions based on the formed machine cells are defined to assign new parts to the machine cells. The algorithm is capable of selecting an ideal set of initial cluster centres, and minimizing the number of bottleneck machines required for forming the desired number of machine cells. It can also provide alternative design of machine cells to accommodate the existing production environment.

Full Text
Published version (Free)

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