Sheet metal bending: Forming part families for generating shared press-brake setups

Sheet metal bending press brakes can be set up to produce more than one type of part without requiring a setup change. To exploit this flexibility, setup planning techniques are needed so that press-brake setups can be shared among many different parts. This paper describes algorithms for partitioning a given set of parts into setup-compatible part families that can be produced on the same setup. First is presented a greedy algorithm to form a part family using a bottom-up approach that makes use of the mixed-integer linear programming formulation for generating shared setups for each part family. Second is presented a mixed-integer linear programming formulation to generate a shared setup for a given set of parts if such a setup exists. By producing many different types of parts on the same setup, it is expected that there will be significant reductions in the number of setup operations, improved machine tool utilization, and more cost-effective small-batch manufacturing.

[1]  Satyandra K. Gupta,et al.  Sheet Metal Bending: Generating Shared Setups , 1999 .

[2]  Satyandra K Gupta,et al.  Automated design of sheet metal punches for bending multiple parts in a single setup , 2001 .

[3]  T. M. Hancock A systems approach to sheet metal processing , 1989 .

[4]  Hamid Seifoddini,et al.  Comparative study of similarity coefficients and clustering algorithms in cellular manufacturing , 1994 .

[5]  Satyandra K. Gupta,et al.  Automated process planning for sheet metal bending operations , 1998 .

[6]  Nallan C. Suresh,et al.  A neural network system for shape-based classification and coding of rotational parts , 1991 .

[7]  T. C. Chang,et al.  Graph-based heuristics for recognition of machined features from a 3D solid model , 1988 .

[8]  Hector Guerrero,et al.  A GENERAL SEARCH ALGORITHM FOR CELL FORMATION IN GROUP TECHNOLOGY , 1994 .

[9]  Abraham Mehrez,et al.  Formulation of the machine cell grouping problem with capacity and material movement constraints , 1994 .

[10]  Hamid Seifoddini,et al.  Part-family formation for cellular manufacturing: A case study at Harnischfeger , 1999 .

[11]  William C. Regli,et al.  Resolving non-uniqueness in design feature histories , 1999, SMA '99.

[12]  H.J.J. Kals,et al.  The generation of bending sequences in a CAPP system for sheet-metal components , 1994 .

[13]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[14]  Rangasami L. Kashyap,et al.  Automatic construction of process plans from solid model representations , 1992, IEEE Trans. Syst. Man Cybern..

[15]  C.-S. Chen A form feature oriented coding scheme , 1989 .

[16]  Andrew Kusiak,et al.  Grouping parts with a neural network , 1994 .

[17]  Richard H. Crawford,et al.  Automatic Part Coding Based on Interfeature Relationships , 1994 .

[18]  Jami J. Shah,et al.  Advances in Feature-Based Manufacturing , 1994 .

[19]  Gjergji Shiko A process planning-orientated approach to part family formation problem in group technology applications , 1992 .

[20]  Arlo L. Ames,et al.  Production ready feature recognition based automatic group technology part coding , 1991, SMA '91.

[21]  Satyandra K. Gupta SHEET METAL BENDING OPERATION PLANNING : USING VIRTUAL NODE GENERATION TO IMPROVE SEARCH EFFICIENCY , 1999 .

[22]  G. Nemhauser,et al.  Integer Programming , 2020 .

[23]  Mark Henderson,et al.  Automated Group Technology Part Coding From a Three-Dimensional CAD Database , 1988 .