Enforcing minimum run length in the cutting stock problem

DOI10.1016/J.EJOR.2004.09.039MaRDI QIDQ817568zbMATH OpenOpenAlexFDO

Authors Adolf Diegel, Edouard Montocchio, Sias van Schalkwyk, 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)

Recommendations

• Setup minimising conditions in the trim loss problem
• Exact Algorithm for Minimising the Number of Setups in the One-Dimensional Cutting Stock Problem
• The generalized assortment and best cutting stock length problems
• One-dimensional cutting stock problems and solution procedures
• Optimal solutions for the cutting stock problem

Cites work

• scientific article; zbMATH DE number 3999654 (Why is no real title available?)
• A typology of cutting and packing problems
• An LP-based approach to cutting stock problems with multiple objectives
• Cutting stock problems and solution procedures
• Optimal solutions for the cutting stock problem
• Setup minimising conditions in the trim loss problem

Cited in

(2)

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

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

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