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). |
|---|---|
| מחבר ראשי: | |
| פורמט: | Article |
| שפה: | English |
| נושאים: |