Machine assignment and part-families formation using group technology

✍ Scribed by M. Kamel; H. Ghenniwa; T. Liu

• Publisher: Springer US
• Year: 1994
• Tongue: English
• Weight: 869 KB
• Volume: 5
• Category: Article
• ISSN: 0956-5515
• DOI: 10.1007/bf00123695

✦ Synopsis

The conventional way of solving the group technology (GT) problem is to start from an assignment of parts to machines and try to find a partitioning of machine cells and part families. The similarity between parts is measured based on commonality of the machines assigned to them. However, parts are assigned to machines based on their operation requirements and the operation capabilities of machines. Similarity between parts should be based on their required operations. In this paper, the authors attempt to solve or facilitate solving the GT problem at the assignment level. An algorithm for assigning parts to machines is provided which utilizes the types of operations required by parts and applies GT principles in producing the assignment. This leads to better partitioning of machine cells and part-families. Furthermore, operation sequences required by parts in determining the similarity between parts have been considered. An algorithm to form part-families based on the operation sequence similarity coefficient has been developed. The resulting families are then used by the assignment algorithm to produce machine assignments to part-families. The use of the algorithm is demonstrated by examples.