Graph Partitioning and Set Covering for the Optimal Design of a Production System in the Metal Industry
暂无分享,去创建一个
Abstract In this article, we are dealing with a design problem in the sheet metal industry. We are interested in the process of punching holes in various shapes on metal sheets, the blanks. A multi-head technology for the hole-punching phase is analyzed and the solution procedure is related to classical problems of combinatorial optimization. We shall describe the algorithmic implementation and report numerical results for the best multi-head configurations.
[1] Robert E. Tarjan,et al. Algorithmic Aspects of Vertex Elimination on Graphs , 1976, SIAM J. Comput..
[2] D. R. Fulkerson,et al. Incidence matrices and interval graphs , 1965 .