Enforcing minimum run length in the cutting stock problem

DOI10.1016/j.ejor.2004.09.039zbMath1090.90161OpenAlexW2124905356MaRDI QIDQ817568

Adolf Diegel, Sias van Schalkwyk, Edouard Montocchio, Olaf Diegel, Garth S. Miller

Publication date: 16 March 2006

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2004.09.039

zbMATH Keywords

cutting stockdecklingrun lengthtrim loss problem

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Related Items (2)

Formulations and theoretical analysis of the one-dimensional multi-period cutting stock problem with setup cost ⋮ A heuristic approach to minimize the number of saw cycles in small-scale furniture factories

Cites Work

• Unnamed Item
• Cutting stock problems and solution procedures
• Setup minimising conditions in the trim loss problem
• A typology of cutting and packing problems
• An LP-based approach to cutting stock problems with multiple objectives
• Optimal solutions for the cutting stock problem

This page was built for publication: Enforcing minimum run length in the cutting stock problem