Title :
Algorithms for sheet metal nesting
Author :
Herrmann, Jeffrey W. ; Delalio, David R.
Author_Institution :
Dept. of Mech. Eng., Maryland Univ., College Park, MD, USA
fDate :
4/1/2001 12:00:00 AM
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 good solutions across a range of cost parameters and problem sizes
Keywords :
bin packing; computational complexity; heuristic programming; linear programming; minimisation; production control; relaxation theory; LP; NP-complete problem; cost minimization; efficient heuristic; linear programming relaxation; order batching; sheet metal nesting; sheet metal punching; Blanking; Condition monitoring; Costs; Finishing; Inorganic materials; Linear programming; Manufacturing processes; Performance analysis; Punching; Sheet materials;
Journal_Title :
Robotics and Automation, IEEE Transactions on
