Algorithms for sheet metal nesting.

This paper discusses the problem of minimizing the cost of sheet metal punching when nesting (batching) orders. Although the problem is NP-complete, the solution to a linear programming relaxation yields an efficient heuristic. This paper analyzes the heuristic's worst-case performance and disc...

詳細記述

書誌詳細
出版年:IEEE Transactions on robotics and automation 17, 2 (2001).
第一著者: Herrmann, J.W
フォーマット: 論文
言語:English
主題: