This paper discusses the problem of minimizing the cost of sheet metal punc
hing when nesting (batching) orders. Although the problem is NP-complete, t
he solution to a linear programming relaxation yields an efficient heuristi
c. This paper analyzes the heuristic's worst-case performance and discusses
experimental results that demonstrate its ability to find good solutions a
cross a range of cost parameters and problem sizes.