Modeling Sheet Metal Integrated Production Planning for Laser Cutting and Air Bending

Over the past few years both sheet metal process planning and production planning issues received increased attention. For process planning of the laser cutting process, nesting algorithms are developed in order to decrease the waste material. Additionally, algorithms are available for path planning, i.e. determining the best sequence for cutting the different parts. Production planning is mainly performed based on the ability to fill a sheet. For air bending, process planning focuses on bend sequencing and tool selection, while production planning optimization aims at minimizing time consuming setups between the different production layouts at the press brake. However, when integrating both processes, the benefits from individual optimization counteract one another: good nestings at the laser machine can create additional setups at the press brake, hence increasing the makespan. An integrated approach is proposed to verify whether this problem can be solved by already taking into account possible setups at the press brake in the early nesting stage. Integration of both processes aims at an optimal combination of parts on a sheet and minimization of the setups at the press brake. In this paper, an overview of a modeling effort addressing both goals is proposed. When combining parts on a sheet, preference is given to parts requiring the same production layout at the press brake. If this is impossible, production layouts with low changeover times are preferred. Industrial cases are used to verify the applicability of the proposed model. The results are compared to a reference approach where nesting is performed with dedicated software and planning for air bending is based on an operator’s experience. Compared to this reference approach, a makespan reduction and a setup time reduction can be observed. The planning is generated almost instantaneously and no additional sheets are required compared to the reference approach. Future research will focus on expanding the model and verifying its applicability on a larger data-set.

[1]  C. H. Tang,et al.  Computer aided nesting in sheet metal for pressworking operations involving bending , 1994 .

[2]  Gilbert Laporte,et al.  Classical and modern heuristics for the vehicle routing problem , 2000 .

[3]  Herminia I. Calvete,et al.  A goal programming approach to vehicle routing problems with soft time windows , 2007, Eur. J. Oper. Res..

[4]  Paolo Toth,et al.  Models, relaxations and exact approaches for the capacitated vehicle routing problem , 2002, Discret. Appl. Math..

[5]  G. Laporte,et al.  A tabu search heuristic for periodic and multi-depot vehicle routing problems , 1997, Networks.

[6]  Jeffrey W. Herrmann,et al.  Algorithms for sheet metal nesting , 2001, IEEE Trans. Robotics Autom..

[7]  José M. Valério de Carvalho,et al.  LP models for bin packing and cutting stock problems , 2002, Eur. J. Oper. Res..

[8]  Dirk Cattrysse,et al.  Neighborhood search for integrated sheet metal production planning for laser cutting and air bending , 2006 .

[9]  Michel Gendreau,et al.  A tabu search heuristic for periodic and multi-depot vehicle routing problems , 1997, Networks.

[10]  George B. Dantzig,et al.  The Truck Dispatching Problem , 1959 .

[11]  S. Q. Xie,et al.  Optimal process planning for a combined punch-and-laser cutting machine using ant colony optimization , 2005 .

[12]  Joost Duflou,et al.  A Framework for Automatic Tool Selection in Integrated CAPP for Sheet Metal Bending , 2005 .

[13]  Joost R. Duflou,et al.  Computer aided process planning for sheet metal bending: A state of the art , 2005, Comput. Ind..

[14]  B. Verlinden,et al.  Integrated sheet-metal production planning for laser cutting and bending , 2007 .

[15]  D. Van Oudheusden,et al.  Automatic production planning of press brakes for sheet metal bending , 2006 .

[16]  Suck-Joo Na,et al.  A study on torch path planning in laser cutting processes part 2: Cutting path optimization using simulated annealing , 1999 .