Algorithms for sheet metal nesting

  • Herrmann J
  • Delalio D
  • 12


    Mendeley users who have this article in their library.
  • 6


    Citations of this article.


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 discusses experimental results that demonstrate its ability to find good solutions across a range of cost parameters and problem sizes.

Author-supplied keywords

  • Batch processing
  • Manufacturing
  • Optimization
  • Sheet metal punching

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Find this document


  • Jeffrey W. Herrmann

  • David R. Delalio

Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free