Algorithms for sheet metal nesting.

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...

Mô tả đầy đủ

Chi tiết về thư mục
Xuất bản năm:IEEE Transactions on robotics and automation 17, 2 (2001).
Tác giả chính: Herrmann, J.W
Định dạng: Bài viết
Ngôn ngữ:English
Những chủ đề:
LP.
NP-complete problem.
Cost minimization.
Efficient heuristic.
Linear programming relaxation.
Order batching.
Sheet metal nesting.
Sheet metal punching.