By Topic

Algorithms for sheet metal nesting

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Herrmann, J.W. ; Dept. of Mech. Eng., Maryland Univ., College Park, MD, USA ; Delalio, D.R.

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

Published in:

Robotics and Automation, IEEE Transactions on  (Volume:17 ,  Issue: 2 )