Product Family Manufacturing Plan Generation and Classification

In the concurrent engineering approach, the problems related to product fabrication are taken into account as early as possi ble in design process. Manufacturing and assembly process design are decisive and expensive processes conditioning all the future steps of industrialisation and fabrication. In this paper a new method for assembly plan generation, based on the concept of meta-prod uct, is presented. This method is designed for modern production environments that are organised in product families with multiple op tions and variants. Facing the combinatory explosion problem, the method proposes an original representation of assembly sequences allowing the generation of a minimal list of non-redundant assembly plans called meta-sequences. In this method, an optimal assembly sequence class is selected. Then, for each product variant an optimal specific plan class is deduced from a simple analysis of product variant's components. An assembly reactive control system, adapting this optimal solution to the real assembly workshop conditions is also proposed. Another competitive problem is the case of production of old or short-series products. To rationalise their manufacturing, a solution consists in classifying products into classes, on the basis of similarity of required manufacturing processes. This technique called group technology (GT) helps to minimize unnecessary variety of products in a manufacturing plant by making designers aware of existing simi lar components. In this paper a new GT method is presented. It allows the classification of sequential manufacturing sequences as well as tree-like manufacturing plans. The method is based on an adapted representation of tree-like manufacturing plans, the distance adapted to this special case, efficient heuristics, and hierarchical bottom-up classification. Then, each product class can be managed in accordance to our family product generation method, or can be served as a base for reengineering process of firm's range of products.

[1]  P. Baptiste,et al.  Manufacturing sequence family grouping for FMS design-a new approach , 1995, Proceedings 1995 INRIA/IEEE Symposium on Emerging Technologies and Factory Automation. ETFA'95.

[2]  Kevin Otto,et al.  Modeling Manufacturing Quality Constraints for Product Development , 1995 .

[3]  Michael J. Fischer,et al.  The String-to-String Correction Problem , 1974, JACM.

[4]  Jan Wolter,et al.  A structure-oriented approach to assembly sequence planning , 1997, IEEE Trans. Robotics Autom..

[5]  Eiichi Tanaka,et al.  The Tree-to-Tree Editing Problem , 1988, Int. J. Pattern Recognit. Artif. Intell..

[6]  Shin-Yee Lu A Tree-to-Tree Distance and Its Application to Cluster Analysis , 1979, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[7]  A. Bourjault,et al.  EVALUATION AND SELECTION OF ASSEMBLY PLANS , 1991 .

[8]  Shu Ming Ng,et al.  Bond Energy, Rectilinear Distance and a Worst-case Bound for the Group Technology Problem , 1991 .

[9]  John L. Burbidge,et al.  Change to group technology: process organization is obsolete , 1992 .

[10]  Arthur C. Sanderson,et al.  A correct and complete algorithm for the generation of mechanical assembly sequences , 1991, IEEE Trans. Robotics Autom..

[11]  Kuo-Chung Tai,et al.  The Tree-to-Tree Correction Problem , 1979, JACM.

[12]  Stanley M. Selkow,et al.  The Tree-to-Tree Editing Problem , 1977, Inf. Process. Lett..

[13]  Thomas L. DeFazio,et al.  An integrated computer aid for generating and evaluating assembly sequences for mechanical products , 1991, IEEE Trans. Robotics Autom..

[14]  Joël Favrel,et al.  Assembly Sequence Generation - Heuristic Research , 1998 .

[15]  Thomas L. DeFazio,et al.  Simplified generation of all mechanical assembly sequences , 1987, IEEE Journal on Robotics and Automation.

[16]  R.H. Wilson,et al.  On constraints in assembly planning , 1998, IEEE Trans. Robotics Autom..