Algorithms for sheet metal nesting

Abstract

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… (More)
DOI: 10.1109/70.928563

Topics

Cite this paper

@article{Herrmann2001AlgorithmsFS, title={Algorithms for sheet metal nesting}, author={Jeffrey W. Herrmann and David R. Delalio}, journal={IEEE Trans. Robotics and Automation}, year={2001}, volume={17}, pages={183-190} }