Performance testing of rectangular parts-nesting heuristics

DOI10.1080/00207548508904719MaRDI QIDQ3688074zbMATH OpenOpenAlexFDO

Authors Sharat S. Israni, Jerry L. Sanders

Publication date 1985

Published in International Journal of Production Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/00207548508904719

zbMATH Keywords

bin packingcutting stockperformance testingrectangular parts- nesting heuristicsworst case time complexities

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Production models (90B30) Applications of mathematical programming (90C90)

Recommendations

• An effective quasi-human based heuristic for solving the rectangle packing problem
• scientific article; zbMATH DE number 2111993
• A 2-exchange heuristic for nesting problems
• New heuristic and interactive approaches to 2D rectangular strip packing
• scientific article; zbMATH DE number 437550

Cites work

• A problem of scheduling conference accommodation
• scientific article; zbMATH DE number 3612277 (Why is no real title available?)
• Performance Bounds for Level-Oriented Two-Dimensional Packing Algorithms

Cited in

(9)

• Solution approaches to irregular nesting problems
• Packing problems
• An exact algorithm for orthogonal 2-D cutting problems using guillotine cuts
• Heuristic methods and applications: A categorized survey
• An improved version of Wang's algorithm for two-dimensional cutting problems
• A typology of cutting and packing problems
• New approaches for the nesting of two-dimensional shapes for press tool design
• A sliding algorithm for optimal nesting of arbitrarily shaped sheet metal blanks
• Data set generation for rectangular placement problems

This page was built for publication: Performance testing of rectangular parts-nesting heuristics

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3688074)